scientific article

zbMath1187.81063arXivquant-ph/0012104MaRDI QIDQ3522370

Sam Gutmann, Andrew M. Childs, Edward Farhi

Publication date: 3 September 2008

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Quantum computation (81P68)

Related Items (36)

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

This page was built for publication: