Efficient quantum Gibbs sampling of stabilizer codes using hybrid computation

• URL: http://arxiv.org/abs/2511.10839v1
• Date: Thu, 13 Nov 2025 22:49:30 GMT
• Title: Efficient quantum Gibbs sampling of stabilizer codes using hybrid computation
• Authors: Ivan H. C. Shum, Angela Capel,
• Abstract summary: We present hybrid Gibbs sampling algorithms for the stabilizer code Hamiltonians of the rotated surface code and the toric code with only local quantum algorithms.<n>We show that if we allow for non-local gates, the Gibbs state of the periodic 1D Ising model can be prepared in logarithmic depth and linearly many simultaneous measurements.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present hybrid Gibbs sampling algorithms for the stabilizer code Hamiltonians of the rotated surface code and the toric code with only local quantum algorithms, using $\sim L/2$ quantum circuit depth to prepare the Gibbs state of the rotated surface code Hamiltonian, and $L$ quantum circuit depth to prepare the Gibbs state of the toric code Hamiltonian, being $L$ the side of the side of the square lattice. We further show that if we allow for non-local gates, the Gibbs state of the periodic 1D Ising model can be prepared in logarithmic depth and linearly many simultaneous measurements.

Related papers

• Hamiltonian Decoded Quantum Interferometry [69.7049555871155]
  We introduce Hamiltonian Decoded Quantum Interferometry (HDQI)<n>HDQI utilizes coherent measurements and the symplectic representation of the Pauli group to reduce Gibbs sampling and Hamiltonian Bellians.<n>We show that HDQI efficiently prepares Gibbs states at arbitrary temperatures for a class of physically motivated commuting Hamiltonians.
  arXiv  Detail & Related papers  (2025-10-09T08:06:15Z)
• Qubit encodings for lattices of dipolar planar rotors [39.58317527488534]
  We investigate two qubit representations of the planar rotor lattice Hamiltonian.<n>The first representation is realized by decomposing the rotor Hamiltonian projectors in binary and mapping them to spin-1/2 projectors.<n>The second approach relies on embedding the planar rotor lattice Hilbert space in a larger space and recovering the relevant qubit encoded system as a quotient space projecting down to the physical degrees of freedom.
  arXiv  Detail & Related papers  (2025-07-23T21:48:20Z)
• 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)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• An efficient and exact noncommutative quantum Gibbs sampler [1.9218741065333018]
  We construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary noncommutative Hamiltonians.<n>Our construction can also be regarded as a continuous-time quantum analog of the Metropolis-Hastings algorithm.
  arXiv  Detail & Related papers  (2023-11-15T18:51:24Z)
• Digital quantum simulation of lattice fermion theories with local encoding [0.0]
  We numerically analyze the feasibility of a platform-neutral, general strategy to perform quantum simulations of fermionic lattice field theories. We observe a timescale separation for spin- and charge-excitations in a spin-$frac12$ Hubbard ladder in the $t-J$ model limit.
  arXiv  Detail & Related papers  (2023-10-23T16:54:49Z)
• Quantum Semidefinite Programming with Thermal Pure Quantum States [0.5639904484784125]
  We show that a quantization'' of the matrix multiplicative-weight algorithm can provide approximate solutions to SDPs quadratically faster than the best classical algorithms. We propose a modification of this quantum algorithm and show that a similar speedup can be obtained by replacing the Gibbs-state sampler with the preparation of thermal pure quantum (TPQ) states.
  arXiv  Detail & Related papers  (2023-10-11T18:00:53Z)
• Predicting Gibbs-State Expectation Values with Pure Thermal Shadows [1.4050836886292868]
  We propose a quantum algorithm that can predict $M$ linear functions of an arbitrary Gibbs state with only $mathcalO(logM)$ experimental measurements. We show that the algorithm can be successfully employed as a subroutine for training an eight-qubit fully connected quantum Boltzmann machine.
  arXiv  Detail & Related papers  (2022-06-10T18:00:08Z)
• Adaptive variational algorithms for quantum Gibbs state preparation [0.0]
  We introduce an objective function that, unlike the free energy, is easily measured, and (ii) using dynamically generated, problem-tailored ans"atze. This allows for arbitrarily accurate Gibbs state preparation using low-depth circuits. We numerically demonstrate that our algorithm can prepare high-fidelity Gibbs states across a broad range of temperatures and for a variety of Hamiltonians.
  arXiv  Detail & Related papers  (2022-03-23T22:54:19Z)
• 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)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)

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.