Publication:3522370

zbMath1187.81063arXivquant-ph/0012104MaRDI QIDQ3522370

Sam Gutmann, Andrew M. Childs, Jeffrey Goldstone, Edward Farhi

Publication date: 3 September 2008

Full work available at URL: https://arxiv.org/abs/quant-ph/0012104

Mathematics Subject Classification ID

68W40: Analysis of algorithms

05C80: Random graphs (graph-theoretic aspects)

81P68: Quantum computation

Related Items

QUBO formulation for the contact map overlap problem, Correlation between the continuous-time quantum walk and cliques in graphs and its application, Exploring adiabatic quantum trajectories via optimal control, A class of time-energy uncertainty relations for time-dependent Hamiltonians, The fundamental gap for a class of Schrödinger operators on path and hypercube graphs, Product formulas for exponentials of commutators, Iterative classical superadiabatic algorithm for combinatorial optimization, Why adiabatic quantum annealing is unlikely to yield speed-up, Statistical Analysis of Quantum Annealing, Solving the traveling salesman problem with a hybrid quantum-classical feedforward neural network, Performance of two different quantum annealing correction codes, Differential geometric treewidth estimation in adiabatic quantum computation, Bose-Mesner algebra on finite \(G/H\) coset graphs and its application on continuous time quantum walks, Efficient quantum algorithms to construct arbitrary Dicke states, An adiabatic quantum algorithm and its application to DNA motif model discovery, A study of heuristic guesses for adiabatic quantum computation, The travelling salesman problem and adiabatic quantum computation: an algorithm, Quantum information processing: The case of vanishing interaction energy, Adiabatic quantum counting by geometric phase estimation, Quantum central limit theorem for continuous-time quantum walks on odd graphs in quantum probability theory, Role of coherence in adiabatic search algorithms, A review on quantum search algorithms, Quantum algorithm design: techniques and applications, Asymptotic distributions of quantum walks on the line with two entangled coins, Mixing-time and large-decoherence in continuous-time quantum walks on one-dimension regular networks, Quantum approximate optimization algorithm for Bayesian network structure learning, Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results, Quantum science and quantum technology, Circuit-based digital adiabatic quantum simulation and pseudoquantum simulation as new approaches to lattice gauge theory, Quantum adiabatic machine learning, Is the addition of an assisted driving Hamiltonian always useful for adiabatic evolution?, Quantum search in structured database using local adiabatic evolution and spectral methods, Anti-crossings and spectral gap during quantum adiabatic evolution, Preparation of spin eigenstates including the Dicke states with generalized all-coupled interaction in a spintronic quantum computing architecture, Programmable Hamiltonian for One-way Patterns, CONTINUOUS-TIME QUANTUM WALKS AND TRAPPING