Limitations of Quantum Simulation Examined by Simulating a Pairing Hamiltonian using Nuclear Magnetic Resonance

Abstract

Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and experimental study of an algorithm to find the low-lying spectrum of a Hamiltonian. While the number of elementary quantum gates does scale polynomially with the size of the system, it increases inversely to the desired error bound $\epsilon$. Making such simulations robust to decoherence using fault-tolerance constructs requires an additional factor of $1/\epsilon$ gates. These constraints are illustrated by using a three qubit nuclear magnetic resonance system to simulate a pairing Hamiltonian, following the algorithm proposed by Wu, Byrd, and Lidar.

6 pages, 2 eps figures

References in corpus (21)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum phase transition from a superfluid to a Mott insulator in a gas of ultracold atoms
• Quantum Mechanics helps in searching for a needle in a haystack
• Quantum Teleportation is a Universal Computational Primitive
• Simulated Quantum Computation of Molecular Energies
• Quantum Algorithms Revisited
• NMR Techniques for Quantum Control and Computation
• Reliable Quantum Computers
• A Theory of Fault-Tolerant Quantum Computation
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Separability of very noisy mixed states and implications for NMR quantum computing
• Sub-Riemannian Geometry and Time Optimal Control of Three Spin Systems: Quantum Gates and Coherence Transfer
• Experimental implementation of an adiabatic quantum optimization algorithm
• Quantum Simulations on a Quantum Computer
• Quantum Phase Transition of Ground-state Entanglement in a Heisenberg Spin Chain Simulated in an NMR Quantum Computer
• Good dynamics versus bad kinematics. Is entanglement needed for quantum computation?
• Polynomial-Time Simulation of Pairing Models on a Quantum Computer
• Exact results for quantum phase transitions in random XY spin chains
• Liquid state NMR simulations of quantum many-body problems
• Local Realistic Model for the Dynamics of Bulk-Ensemble NMR Information Processing
• Fast simulation of a quantum phase transition in an ion-trap realisable unitary map

Cited by in corpus (56)

• Quantum Simulation
• Programmable Quantum Simulations of Spin Systems with Trapped Ions
• Towards Quantum Chemistry on a Quantum Computer
• Universal digital quantum simulation with trapped ions
• Toward the first quantum simulation with quantum speedup
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Simulating chemistry using quantum computers
• Can One Trust Quantum Simulators?
• Witnessing eigenstates for quantum simulation of Hamiltonian spectra
• Quantum Computing with NMR
• Nearly optimal lattice simulation by product formulas
• Faster quantum simulation by randomization
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Using Quantum Computers for Quantum Simulation
• A random walk approach to quantum algorithms
• Laserless trapped-ion quantum simulations without spontaneous scattering using microtrap arrays
• Quantum Algorithm for Molecular Properties and Geometry Optimization
• Recent progress in quantum simulation using superconducting circuits
• Simulation of chemical reaction dynamics on an NMR quantum computer
• Freezing a Quantum Magnet by Repeated Quantum Interference: An Experimental Realization
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• Digital Quantum Simulation with Rydberg Atoms
• Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance
• Designing spin-1 lattice models using polar molecules
• Adiabatic Quantum Simulators
• Resource Requirements for Fault-Tolerant Quantum Simulation: The Transverse Ising Model Ground State
• Introduction to Quantum Algorithms for Physics and Chemistry
• A Two-Dimensional Lattice Ion Trap for Quantum Simulation
• Quantum Analogue Computing
• Quantum simulation of interacting high-dimensional systems: the influence of noise
• Hidden Inverses: Coherent Error Cancellation at the Circuit Level
• Measures of quantum computing speedup
• qSWIFT: High-order randomized compiler for Hamiltonian simulation
• Controlling error orientation to improve quantum algorithm success rates
• Optimal Trotterization in universal quantum simulators under faulty control
• Quantum Simulation of Tunneling in Small Systems
• Ancilla-based quantum simulation
• Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
• Error-transparent evolution: the ability of multi-body interactions to bypass decoherence
• Relation between fermionic and qubit mean fields in the electronic structure problem
• Direct Estimation of Single- and Two-Qubit Hamiltonians and Relaxation Rates
• Experimental implementation of quantum algorithm for association rules mining
• Energy protection arguments fail in the interaction picture
• Quantum computation algorithm for many-body studies
• Global-to-local incompatibility, monogamy of entanglement, and ground-state dimerization: Theory and observability of quantum frustration in systems with competing interactions
• Low Depth Quantum Circuits for Ising Models
• Quantum simulations of a particle in one-dimensional potentials using NMR
• A cryogenic surface-electrode elliptical ion trap for quantum simulation
• Effects of Noise, Correlations and errors in the preparation of initial states in Quantum Simulations
• Exploiting anticommutation in Hamiltonian simulation
• Quantum Simulation of Pairing Hamiltonians with Nearest-Neighbor Interacting Qubits
• Quantum Phase Estimation Algorithm for Finding Polynomial Roots
• Efficient preparation of the AKLT State with Measurement-based Imaginary Time Evolution
• Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas
• Linear-optical generation of eigenstates of the two-site XY model
• Exactly solvable pairing models in two dimensions