Simulating large-size quantum spin chains on cloud-based superconducting quantum computers
arXiv:2207.09994 · doi:10.1103/PhysRevResearch.5.013183
Abstract
Quantum computers have the potential to efficiently simulate large-scale quantum systems for which classical approaches are bound to fail. Even though several existing quantum devices now feature total qubit numbers of more than one hundred, their applicability remains plagued by the presence of noise and errors. Thus, the degree to which large quantum systems can successfully be simulated on these devices remains unclear. Here, we report on cloud simulations performed on several of IBM's superconducting quantum computers to simulate ground states of spin chains having a wide range of system sizes up to one hundred and two qubits. We find that the ground-state energies extracted from realizations across different quantum computers and system sizes reach the expected values to within errors that are small (i.e. on the percent level), including the inference of the energy density in the thermodynamic limit from these values. We achieve this accuracy through a combination of physics-motivated variational Ansatzes, and efficient, scalable energy-measurement and error-mitigation protocols, including the use of a reference state in the zero-noise extrapolation. By using a 102-qubit system, we have been able to successfully apply up to 3186 CNOT gates in a single circuit when performing gate-error mitigation. Our accurate, error-mitigated results for random parameters in the Ansatz states suggest that a standalone hybrid quantum-classical variational approach for large-scale XXZ models is feasible.
arXiv comment21 pages, 12 figures, 4 tables; title change; substantial revision
References in corpus (31)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum computational advantage using photons
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Noisy intermediate-scale quantum (NISQ) algorithms
- Error mitigation for short-depth quantum circuits
- Strong quantum computational advantage using a superconducting quantum processor
- Thermodynamic limit of the density matrix renormalization for the spin-1 Heisenberg chain
- Extending the computational reach of a noisy superconducting quantum processor
- Hartree-Fock on a superconducting qubit quantum computer
- Towards Practical Quantum Variational Algorithms
- Noise tailoring for scalable quantum computation via randomized compiling
- Practical Quantum Error Mitigation for Near-Future Applications
- Optimal Quantum Circuits for General Two-Qubit Gates
- Quantum-Classical Computation of Schwinger Model Dynamics using Quantum Computers
- Cloud Quantum Computing of an Atomic Nucleus
- Mitigating measurement errors in multi-qubit experiments
- Quantum walks on a programmable two-dimensional 62-qubit superconducting processor
- Scalable mitigation of measurement errors on quantum computers
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
- Scalable error mitigation for noisy quantum circuits produces competitive expectation values
- Mitigating depolarizing noise on quantum computers with noise-estimation circuits
- Realising the Symmetry-Protected Haldane Phase in Fermi-Hubbard Ladders
- Efficient variational simulation of non-trivial quantum states
- Detector Tomography on IBM 5-qubit Quantum Computers and Mitigation of Imperfect Measurement
- Efficient correction of multiqubit measurement errors
- Variational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
- Joint Quantum-State and Measurement Tomography with Incomplete Measurements
- Experimental Quantum Simulation of Entanglement in Many-body Systems
- Detecting phase boundaries of quantum spin-1/2 XXZ ladder via bipartite and multipartite entanglement transitions
Cited by in corpus (21)
- IBM Quantum Computers: Evolution, Performance, and Future Directions
- Enhancing quantum utility: simulating large-scale quantum spin chains on superconducting quantum computers
- Ergotropy and capacity optimization in Heisenberg spin-chain quantum batteries
- A comprehensive survey on quantum computer usage: How many qubits are employed for what purposes?
- A Study on Thermal Quantum Resources and Probabilistic Teleportation in Spin-1/2 Heisenberg XYZ+DM+KSEA Model under Variable Zeeman Splitting
- Benchmarking the performance of quantum computing software
- Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits
- Localized Virtual Purification
- Optimal realization of Yang-Baxter gate on quantum computers
- Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
- Sketching phase diagrams using low-depth variational quantum algorithms
- Efficient Frequency Allocation for Superconducting Quantum Processors Using Improved Optimization Techniques
- Comparison of encoding schemes for quantum computing of spin chains
- From Heisenberg to Hubbard: An initial state for the shallow quantum simulation of correlated electrons
- Simulating polaritonic ground states on noisy quantum devices
- Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations
- Capturing the Page Curve and Entanglement Dynamics of Black Holes in Quantum Computers
- Superdiffusion resilience in Heisenberg Chains with 2D interactions on a quantum processor
- Sampling (noisy) quantum circuits through randomized rounding
- Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation
- Evaluating Sample-Based Krylov Quantum Diagonalization for Heisenberg Models with Applications to Materials Science