Polynomial-Time Simulation of Pairing Models on a Quantum Computer

Abstract

We propose a polynomial-time algorithm for simulation of the class of pairing Hamiltonians, e.g., the BCS Hamiltonian, on an NMR quantum computer. The algorithm adiabatically finds the low-lying spectrum in the vicinity of the gap between ground and first excited states, and provides a test of the applicability of the BCS Hamiltonian to mesoscopic superconducting systems, such as ultra-small metallic grains.

5 pages, RevTeX, Latest, modified version to appear in Phys. Rev. Lett

References in corpus (2)

• Quantum Algorithms for Fermionic Simulations
• Power of Anisotropic Exchange Interactions: Universality and Efficient Codes for Quantum Computing

Cited by in corpus (64)

• Quantum Simulation
• Quantum computational chemistry
• Effective quantum spin systems with ion traps
• Towards Quantum Chemistry on a Quantum Computer
• Elucidating Reaction Mechanisms on Quantum Computers
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Simulating chemistry using quantum computers
• Can One Trust Quantum Simulators?
• From transistor to trapped-ion computers for quantum chemistry
• Low rank representations for quantum simulation of electronic structure
• A quantum algorithm for evolving open quantum dynamics on quantum computing devices
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Electron-Phonon Systems on a Universal Quantum Computer
• Using Quantum Computers for Quantum Simulation
• Measurement reduction in variational quantum algorithms
• Quantum Simulation of Quantum Field Theory in the Light-Front Formulation
• Calculating energy derivatives for quantum chemistry on a quantum computer
• Limitations of Quantum Simulation Examined by Simulating a Pairing Hamiltonian using Nuclear Magnetic Resonance
• Digital quantum computation of fermion-boson interacting systems
• Simulation of chemical reaction dynamics on an NMR quantum computer
• Freezing a Quantum Magnet by Repeated Quantum Interference: An Experimental Realization
• Universal Leakage Elimination
• Computational Complexity in Electronic Structure
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance
• Qubits as Parafermions
• Simulating Hadronic Physics on NISQ devices using Basis Light-Front Quantization
• Introduction to Quantum Algorithms for Physics and Chemistry
• Initial state preparation for quantum chemistry on quantum computers
• Quantum Analogue Computing
• Quantum Simulation of Nuclear Inelastic Scattering
• On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants
• Information-theoretic equilibration: the appearance of irreversibility under complex quantum dynamics
• Canonical entanglement for two indistinguishable particle
• Adiabatic Time Evolution in Spin-Systems
• Ancilla-based quantum simulation
• Chemically Aware Unitary Coupled Cluster with ab initio Calculations on System Model H1: A Refrigerant Chemicals Application
• Error-transparent evolution: the ability of multi-body interactions to bypass decoherence
• Adiabatic Quantum Kitchen Sinks for Learning Kernels Using Randomized Features
• Classical Ising model test for quantum circuits
• Towards Large-Scale Quantum Computation
• Quantum computation algorithm for many-body studies
• Benchmarking near-term quantum devices with the Variational Quantum Eigensolver and the Lipkin-Meshkov-Glick model
• Quantum phase transition in a multiconnected Jaynes-Cummings lattice
• Branch-cut in the shear-stress response function of massless $\lambda {\phi }^4$ with Boltzmann statistics
• Comment on ``Polynomial-Time Simulation of Pairing Models on a Quantum Computer''
• Digital quantum simulation of the BCS model with a central-spin-like quantum processor
• A cryogenic surface-electrode elliptical ion trap for quantum simulation
• Proposal of Quantum Simulation of Pairing Model on an NMR Quantum Computer
• Effects of Noise, Correlations and errors in the preparation of initial states in Quantum Simulations
• Symmetry restoration and quantumness reestablishment
• Reply to: ``Comment on `Polynomial-Time Simulation of Pairing Models on a Quantum Computer'''
• Self-protected adiabatic quantum computation
• Exact Numerical Solution of the BCS Pairing Problem
• Ladder Operator Block-Encoding
• Quantum Simulation of Pairing Hamiltonians with Nearest-Neighbor Interacting Qubits
• Towards solving the BCS Hamiltonian gap in Near-Term Quantum Computers
• Universal Resources for QAOA and Quantum Annealing
• Exactly solvable pairing models in two dimensions
• Direct diagonalization of Fock space for an exact solution of pairing model
• Tunable Tradeoff between Quantum and Classical Computation via Nonunitary Zeno-like Dynamics
• Dynamics and Control of Two Coupled Quantum Oscillators: An Analytical Approach
• The energy spectrum symmetry of Heisenberg model in Fock space