Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
From MaRDI portal
Publication:5900946
DOI10.1007/b11961zbMath1279.81040OpenAlexW4298253479MaRDI QIDQ5900946
Publication date: 26 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11961
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (27)
Analytical expression for variance of homogeneous-position quantum walk with decoherent position ⋮ Quantum Walks ⋮ One-dimensional continuous-time quantum walks ⋮ Searching for antipodal vertices in a symmetric Cayley graph of the group of the Boolean cube ⋮ Discrete-time interacting quantum walks and quantum hash schemes ⋮ Differential topology of adiabatically controlled quantum processes ⋮ Concentric network symmetry ⋮ Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix ⋮ Quantum Walk Based Search Algorithms ⋮ Quantum circuits for discrete-time quantum walks with position-dependent coin operator ⋮ An investigation of continuous-time quantum walk on hypercube in view of Cartesian product structure ⋮ Maximal entanglement from quantum random walks ⋮ Tree search and quantum computation ⋮ Bose-Mesner algebra on finite \(G/H\) coset graphs and its application on continuous time quantum walks ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ Quantum walks: a comprehensive review ⋮ Enhancing the spreading of quantum walks on star graphs by additional bonds ⋮ Asymptotic distributions of quantum walks on the line with two entangled coins ⋮ Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory ⋮ One-dimensional quantum walks with absorbing boundaries ⋮ Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm ⋮ The QWalk simulator of quantum walks ⋮ Coined quantum walks lift the cospectrality of graphs and trees ⋮ Graph matching using the interference of continuous-time quantum walks ⋮ Discrete quantum walks hit exponentially faster ⋮ The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors ⋮ The continuous-time quantum walk on some graphs based on the view of quantum probability
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques