Logarithmic depth compression of Heisenberg Hamiltonian simulation by fan-out parallelization, with built-in error detection

• URL: http://arxiv.org/abs/2608.20250v1
• Date: Thu, 20 Aug 2026 16:46:41 GMT
• Title: Logarithmic depth compression of Heisenberg Hamiltonian simulation by fan-out parallelization, with built-in error detection
• Abstract summary: Fan-out-based gadget compiler trades circuit depth for width in simulations of Heisenberg-type nuclear magnetic resonance (NMR) Hamiltonians.<n>We simulate the zero-field NMR spectrum of tetramethylsilane, a 13-spin star system.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Noisy intermediate-scale quantum computers are constrained by circuit depth, while product-formula simulation of spin systems leads to narrow and deep circuits. Here we introduce a fan-out-based gadget compiler that trades circuit depth for width in simulations of Heisenberg-type nuclear magnetic resonance (NMR) Hamiltonians. Each logical spin is encoded into a small repetition-code register sized by its interaction degree, so that all pairwise interactions of a given Pauli type execute in parallel after a logarithmic-depth CNOT fan-out, and the redundant registers provide error detection for post-selection at no additional algorithmic overhead. The central result is a fixed-protocol resource comparison of the two compilations, transpiled to heavy-hex superconducting and all-to-all trapped-ion targets across a set of NMR spin systems. For interaction graphs with a high-degree hub the volume-optimal schedule halves the two-qubit depth and reduces the volume 1.7-fold for the 13-spin demonstration, which on heavy-hex also lowers the two-qubit gate count, and the depth reduction rises to 2.5-fold on all-to-all for the highest-degree molecule studied. On all-to-all the two-qubit gate count rises for every system, so the volume reduction is a benefit on depth-limited hardware. The gain grows with the degree inhomogeneity of the interaction graph and vanishes for dense uniform graphs, where the optimum is the sequential circuit. We simulate the zero-field NMR spectrum of tetramethylsilane, a 13-spin star system. Under a noise model scaled from a published present-day processor calibration, the shallower gadget circuits match or surpass the sequential compilation only after post-selection on their built-in error detection, once error rates improve by one to one and a half orders of magnitude. We verify the spectra against an independent classical computation.

Related papers

• The ZZ feature map induces a signless Laplacian metric: a closed-form classical surrogate for quantum kernel regression [0.0]
  We prove that in the small-bandwidth regime the induced kernel is, to leading order, an anisotropic Gaussian kernel with metric M = I + pi2 Q.<n>The corresponding classical kernel requires no fitted parameters and no quantum simulation.
  arXiv  Detail & Related papers  (2026-08-29T19:59:00Z)
• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Neural-Network Inverse Design of SRF Cavities and Transmons for Bosonic Quantum Computation [36.94429692322632]
  Three-dimensional superconducting radio-frequency (SRF) cavities provide exceptionally long-lived electromagnetic modes.<n>In inverse design of such systems, i.e., recovering device geometries that produce specified electromagnetic and coupling targets, is generally a one-to-many problem.<n>We present two deep neural network (DNN) approaches that address this inverse-design problem at complementary levels of the design stack.
  arXiv  Detail & Related papers  (2026-07-02T15:06:11Z)
• Active Quantum Kernel Acquisition for Gaussian Process Regression [30.032230630492155]
  Recent work on quantum kernel classification has shown that allocating shots non-uniformly across kernel entries can reduce the shot budget required to reach a target accuracy.<n>We extend this idea to Gaussian process (GP) regression, a setting whose downstream quantities (full-spectrum posterior variance, log-determinant, marginal likelihood) couple to kernel error more tightly than the sign-only outputs of classification.<n>We derive three closed-form pair-level sensitivities predictive coupling $|_i_j|$, leave-one-out residual, and marginal-likelihood gradient and plug them into a Neyman-style minimum
  arXiv  Detail & Related papers  (2026-06-27T09:40:20Z)
• Effective Dimension Governs Generalization in Quantum Kernel Vision Models [31.082191748525137]
  We show that entanglement structure and quantum noise are two knobs that move $d_rm eff$.<n>Amplitude damping contracts $d_rm eff$ and lifts test accuracy by up to $+13%$ along an inverted-U sweet spot.
  arXiv  Detail & Related papers  (2026-06-18T12:55:59Z)
• Approximate Hamiltonian Simulation Algorithm for Efficient Fluid Quantum Simulations [7.831166491139832]
  This work aims to address the bottleneck issues of hardware resource limitation and decoherence error in the Hamiltonian simulation of quantum fluids.<n>We propose an approximate operator optimization scheme aimed at reducing the circuit depth in Hamiltonian evolution.
  arXiv  Detail & Related papers  (2026-04-19T15:26:25Z)
• EqDeepRx: Learning a Scalable MIMO Receiver [6.732584013520367]
  This paper presents EqDeepRx, a practical deep-learning-aided multiple-input multiple-output (MIMO) receiver.<n>At the core of the receiver model is a shared-weight DetectorNN that operates independently on each spatial stream or layer.<n>5G/6G-compliant end-to-end simulations across multiple channel scenarios, pilot patterns, and inter-cell interference conditions show improved error rate and spectral efficiency.
  arXiv  Detail & Related papers  (2026-02-12T11:22:30Z)
• Improving fermionic variational quantum eigensolvers with Majorana swap networks [0.0]
  We introduce two Majorana swap network techniques for variational quantum eigensolvers.<n>First, we develop a cyclic compilation algorithm that localizes all two-particle interaction terms in a general fermionic Hamiltonian.<n>Second, we design a Majorana swap network for the UpCCGSD variational ansatz, which is already more compact than UCCGSD.
  arXiv  Detail & Related papers  (2025-09-09T15:33:13Z)
• Simulation of one and two qubit superconducting quantum gates under the non-Markovian $1/f$ noise [0.45880283710344066]
  We develop a hierarchical equations of motion (HEOM) framework that enables efficient and reliable modeling of qubit dynamics and gate operations under $1/f$ noise.<n>Results establish HEOM as a robust methodology for simulating the environmental noise in superconducting circuits.
  arXiv  Detail & Related papers  (2025-09-09T12:57:08Z)
• Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
  We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons. This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
  arXiv  Detail & Related papers  (2024-09-05T17:58:20Z)
• Demonstration of tunable three-body interactions between superconducting qubits [38.98439939494304]
  We present a superconducting circuit architecture in which a coupling module mediates 2-local and 3-local interactions. The 3-local interaction is coherently tunable over several MHz via the coupler flux biases and can be turned off.
  arXiv  Detail & Related papers  (2022-05-09T20:23:43Z)
• High fidelity two-qubit gates on fluxoniums using a tunable coupler [47.187609203210705]
  Superconducting fluxonium qubits provide a promising alternative to transmons on the path toward large-scale quantum computing. A major challenge for multi-qubit fluxonium devices is the experimental demonstration of a scalable crosstalk-free multi-qubit architecture. Here, we present a two-qubit fluxonium-based quantum processor with a tunable coupler element.
  arXiv  Detail & Related papers  (2022-03-30T13:44:52Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• 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)

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.