Improved Accreditation of Analogue Quantum Simulation and Establishing Quantum Advantage

• URL: http://arxiv.org/abs/2502.06463v1
• Date: Mon, 10 Feb 2025 13:44:27 GMT
• Title: Improved Accreditation of Analogue Quantum Simulation and Establishing Quantum Advantage
• Authors: Andrew Jackson, Animesh Datta,
• Abstract summary: We improve on the results of [A. Jackson et al. Proc. Acad. Sci. U.S.A 121 (6). 2024] on the verification of analogue quantum simulators by eliminating the use of universal Hamiltonians. No longer assuming error is represented by identical maps across simulations. New protocol better reflects the reality of extant analogue simulators.
• Score: 1.7495213911983414
• License:
• Abstract: We improve on the results of [A. Jackson et al. Proc. Natl. Acad. Sci. U.S.A 121 (6). 2024] on the verification of analogue quantum simulators by eliminating the use of universal Hamiltonians, removing the need for two-qubit gates, and no longer assuming error is represented by identical maps across simulations. This new protocol better reflects the reality of extant analogue simulators. It integrates well with recent complexity theoretic results, leading to a near-term feasible simulation-based route to establishing quantum advantage.

Related papers

• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• Engineering quantum states with neutral atoms [0.16060719742433227]
  Aquila, an analog quantum simulation platform developed by QuEra Computing, supports control of the position and coherent evolution of up to 256 neutral atoms. This study details novel experimental protocols designed for analog quantum simulators that generate Bell state entanglement far away from the blockade regime. We additionally evaluate the effectiveness of readout error mitigation techniques in improving the fidelity of measurement results.
  arXiv  Detail & Related papers  (2024-04-05T21:20:41Z)
• A Multi-Grained Symmetric Differential Equation Model for Learning Protein-Ligand Binding Dynamics [73.35846234413611]
  In drug discovery, molecular dynamics (MD) simulation provides a powerful tool for predicting binding affinities, estimating transport properties, and exploring pocket sites. We propose NeuralMD, the first machine learning (ML) surrogate that can facilitate numerical MD and provide accurate simulations in protein-ligand binding dynamics. We demonstrate the efficiency and effectiveness of NeuralMD, achieving over 1K$times$ speedup compared to standard numerical MD simulations.
  arXiv  Detail & Related papers  (2024-01-26T09:35:17Z)
• Accreditation of Analogue Quantum Simulators [1.7510560590853574]
  The protocol is ready for immediate usage and practical for the long term. It builds on the recent theoretical advances of strongly universal Hamiltonians and quantum accreditation.
  arXiv  Detail & Related papers  (2023-06-05T17:31:14Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Analogue Quantum Simulation with Fixed-Frequency Transmon Qubits [0.16385815610837165]
  We experimentally assess the suitability of transmon qubits with fixed frequencies and fixed interactions for the realization of analogue quantum simulations of spin systems. With moderate improvements, analogue simulation of a rich family of time-dependent many-body spin Hamiltonians may be possible.
  arXiv  Detail & Related papers  (2022-11-29T18:10:45Z)
• Hybrid Physical-Neural ODEs for Fast N-body Simulations [0.22419496088582863]
  We present a new scheme to compensate for the small-scales approximations resulting from Particle-Mesh schemes for cosmological N-body simulations. We find that our approach outperforms PGD for the cross-correlation coefficients, and is more robust to changes in simulation settings.
  arXiv  Detail & Related papers  (2022-07-12T13:06:06Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Supercomputer simulations of transmon quantum computers [0.0]
  We develop a simulator for quantum computers composed of superconducting transmon qubits. We present results for the simulation of up to 16 transmons and resonators. We also demonstrate the transition from an isolated system to an open quantum system governed by a Lindblad master equation.
  arXiv  Detail & Related papers  (2020-08-31T11:07:02Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.