Progress in Quantum Algorithms
Quantum Information Processing
High-level interconnect model for the quantum logic array architecture
ACM Journal on Emerging Technologies in Computing Systems (JETC)
On a measurement-free quantum lambda calculus with classical control
Mathematical Structures in Computer Science
Non-classical computing: feasible versus infeasible
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
Programmable Hamiltonian for One-way Patterns
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity of Stoquastic Frustration-Free Hamiltonians
SIAM Journal on Computing
Permutational quantum computing
Quantum Information & Computation
Eigenpath traversal by phase randomization
Quantum Information & Computation
The complexity of quantum spin systems on a two-dimensional square lattice
Quantum Information & Computation
On the hamiltonian operators for adiabatic quantum reduction of SAT
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Quantum Information & Computation
Minimum-Time Frictionless Atom Cooling in Harmonic Traps
SIAM Journal on Control and Optimization
Quantum walks: a comprehensive review
Quantum Information Processing
Quantum adiabatic machine learning
Quantum Information Processing
Hamiltonian simulation using linear combinations of unitary operations
Quantum Information & Computation
An alternate quantum adiabatic evolution for the Deutsch---Jozsa problem
Quantum Information Processing
Generalized quantum partial adiabatic evolution
Quantum Information Processing
| Hi-index | 0.00 |
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which implies that the adiabatic computation model and the conventional quantum computation model are polynomially equivalent. Our result can be extended to the physically realistic setting of particles arranged on a two-dimensional grid with nearest neighbor interactions. The equivalence between the models allows stating the main open problems in quantum computation using well-studied mathematical objects such as eigenvectors and spectral gaps of sparse matrices.