Robust analog quantum simulators by quantum error-detecting codes

• URL: http://arxiv.org/abs/2412.07764v1
• Date: Tue, 10 Dec 2024 18:58:05 GMT
• Title: Robust analog quantum simulators by quantum error-detecting codes
• Authors: Yingkang Cao, Suying Liu, Haowei Deng, Zihan Xia, Xiaodi Wu, Yu-Xin Wang,
• Abstract summary: We provide a recipe for error-resilient Hamiltonian simulations, making use of an excited encoding subspace stabilized by solely $2$-local commuting Hamiltonians.<n>Our method is scalable as it only requires penalty terms that scale to system size.
• Score: 22.034646136056804
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Achieving noise resilience is an outstanding challenge in Hamiltonian-based quantum computation. To this end, energy-gap protection provides a promising approach, where the desired quantum dynamics are encoded into the ground space of a penalty Hamiltonian that suppresses unwanted noise processes. However, existing approaches either explicitly require high-weight penalty terms that are not directly accessible in current hardware, or utilize non-commuting $2$-local Hamiltonians, which typically leads to an exponentially small energy gap. In this work, we provide a general recipe for designing error-resilient Hamiltonian simulations, making use of an excited encoding subspace stabilized by solely $2$-local commuting Hamiltonians. Our results thus overcome a no-go theorem previously derived for ground-space encoding that prevents noise suppression schemes with such Hamiltonians. Importantly, our method is scalable as it only requires penalty terms that scale polynomially with system size. To illustrate the utility of our approach, we further apply this method to a variety of $1$- and $2$-dimensional many-body spin models, potentially extending the duration of high-fidelity simulation by orders of magnitude in current hardware.

Related papers

• Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers [0.6536048280842786]
  We develop randomized quantum algorithms to simulate quantum collision models, also known as repeated interaction schemes. Our methods can leverage quantum collision models for both Markovian and non-Markovian dynamics on early fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2025-04-30T12:09:54Z)
• Hamiltonian Neural Networks approach to fuzzball geodesics [39.58317527488534]
  Hamiltonian Neural Networks (HNNs) are tools that minimize a loss function to solve Hamilton equations of motion. In this work, we implement several HNNs trained to solve, with high accuracy, the Hamilton equations for a massless probe moving inside a smooth and horizonless geometry known as D1-D5 circular fuzzball.
  arXiv  Detail & Related papers  (2025-02-28T09:25:49Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• General, efficient, and robust Hamiltonian engineering [0.20482269513546453]
  We introduce an efficient and robust scheme to engineer arbitrary local many-body Hamiltonians. These sequences are constructed by efficiently solving a linear program (LP) which minimizes the total evolution time. In particular, we solve the Hamiltonian engineering problem for arbitrary two-body Hamiltonians on a 2D square lattice with $225$ qubits in only $60$ seconds.
  arXiv  Detail & Related papers  (2024-10-25T18:00:01Z)
• Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers [1.2912607909040075]
  Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians. We show that utilizing quantum algorithms for obtaining the properties of downfolded Hamiltonians can indeed yield high-fidelity solutions.
  arXiv  Detail & Related papers  (2024-09-18T18:00:04Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding [9.219297088819634]
  Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian. In this paper, we propose a technique named Hamiltonian embedding. This technique simulates a desired sparse Hamiltonian by embedding it into the evolution of a larger and more structured quantum system.
  arXiv  Detail & Related papers  (2024-01-16T18:19:29Z)
• Perturbative gadgets for gate-based quantum computing: Non-recursive constructions without subspace restrictions [0.9249657468385781]
  We introduce a versatile universal, non-recursive, non-adiabatic perturbative gadget construction without subspace restrictions. Our construction requires $rk$ additional qubits for a $k$-body Hamiltonian comprising $r$ terms. We also provide a recipe for constructing similar gadgets, which can be tailored to different properties.
  arXiv  Detail & Related papers  (2022-10-06T17:51:23Z)
• Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation [1.433758865948252]
  We show how to design MPFs that do not amplify the hardware and sampling errors, and demonstrate their performance. We observe an error reduction of up to an order of magnitude when compared to a product formula approach by suppressing hardware noise with Pauli Twirling, pulse efficient transpilation, and a novel zero-noise extrapolation based on scaled cross-resonance pulses.
  arXiv  Detail & Related papers  (2022-07-22T18:00:05Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)
• Digital-Analog Quantum Simulations Using The Cross-Resonance Effect [0.0]
  Digital-analog quantum computation aims to reduce the currently infeasible resource requirements needed for near-term quantum information processing. We consider superconducting architectures and extend the cross-resonance effect, up to first order in theory, from a two-qubit interaction to an analog Hamiltonian acting on 1D chains and 2D square lattices.
  arXiv  Detail & Related papers  (2020-11-20T17:07:28Z)
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware [6.445605125467574]
  We develop quantum algorithms for Hamiltonian simulation "one level below" the circuit model. We analyse the impact of these techniques under the standard error model. We derive analytic circuit identities for efficiently synthesising multi-qubit evolutions from two-qubit interactions.
  arXiv  Detail & Related papers  (2020-03-15T18:22:02Z)

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.