ON THE GAP OF HAMILTONIANS FOR THE ADIABATIC SIMULATION OF QUANTUM CIRCUITS

DOI10.1142/S0219749913500639zbMath1292.81017arXiv1307.4993OpenAlexW2963587429WikidataQ114072381 ScholiaQ114072381MaRDI QIDQ5417139

Anand Ganti, Rolando Somma

Publication date: 16 May 2014

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.4993

zbMATH Keywords

quantum computationquantum circuitsadiabatic state transformations

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cites Work

• The power of quantum systems on a line
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Improved gap estimates for simulating quantum circuits by adiabatic evolution
• Spectral Gap Amplification
• Quantum Approach to Classical Thermodynamics and Optimization
• Quantum Phase Transitions
• Simulating Sparse Hamiltonians with Star Decompositions
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Quantum Approach to Classical Statistical Mechanics
• Bounds for the adiabatic approximation with applications to quantum computation
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Complexity of Stoquastic Frustration-Free Hamiltonians
• Strengths and Weaknesses of Quantum Computing
• Higher order decompositions of ordered operator exponentials

This page was built for publication: ON THE GAP OF HAMILTONIANS FOR THE ADIABATIC SIMULATION OF QUANTUM CIRCUITS