High-Order Splitting of Non-Unitary Operators on Quantum Computers

• URL: http://arxiv.org/abs/2511.19659v1
• Date: Mon, 24 Nov 2025 19:45:06 GMT
• Title: High-Order Splitting of Non-Unitary Operators on Quantum Computers
• Authors: Peter Brearley, Philipp Pfeffer,
• Abstract summary: Complex-coefficient splitting methods with positive real parts are chosen for stable integration in a quantum circuit.<n>A single sixth-order step in three dimensions on 35 trillion cells requires 1,562 CNOT gates, which can be executed within the coherence time of modern quantum processors.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a high-order splitting method for simulating non-unitary dynamics by sequential real- and imaginary-time Hamiltonian evolutions. Complex-coefficient splitting methods with positive real parts are chosen for stable integration in a quantum circuit, avoiding the unstable, norm-amplifying negative steps that arise from real-coefficient splitting at high orders. The method is most beneficial for dynamics that naturally separate into unitary and dissipative components, with broad applications across science and engineering. These systems frequently admit compact spectral representations of the split operators, which we demonstrate by deriving efficient quantum circuits for simulating the damped-wave equation with up to sixth-order accuracy in time. A single sixth-order step in three dimensions on 35 trillion cells requires 1,562 CNOT gates, which can be executed within the coherence time of modern quantum processors.

Related papers

• Performance Characterization of a Multi-Module Quantum Processor with Static Inter-Chip Couplers [63.42120407991982]
  Three-dimensional integration technologies such as flip-chip bonding are a key prerequisite to realize large-scale superconducting quantum processors.<n>We present a design for a multi-chip module comprising one carrier chip and four qubit modules.<n>Measuring two of the qubits, we analyze the readout performance, finding a mean three-level state-assignment error of $9 times 10-3$ in 200 ns.<n>We demonstrate a controlled-Z two-qubit gate in 100 ns with an error of $7 times 10-3$ extracted from interleaved randomized benchmarking.
  arXiv  Detail & Related papers  (2025-03-16T18:32:44Z)
• Syncopated Dynamical Decoupling for Suppressing Crosstalk in Quantum Circuits [2.6107310251235876]
  We study the use of dynamical decoupling in characterizing and suppressing undesired two-qubit couplings.<n>We find sequences that protect against decoherence and selectively target unwanted two-qubit interactions.<n>The syncopated decoupling technique significantly boosts performance in a realistic algorithmic quantum circuit.
  arXiv  Detail & Related papers  (2024-03-12T17:18:35Z)
• Unified framework for efficiently computable quantum circuits [0.0]
  Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure that allows these circuits can be efficiently simulatable.
  arXiv  Detail & Related papers  (2024-01-16T08:04:28Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations [55.41644538483948]
  We study strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. We find that the gate complexity using second order Trotter- Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing.
  arXiv  Detail & Related papers  (2022-07-07T09:39:40Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Effective non-local parity-dependent couplings in qubit chains [0.0]
  We harness the simultaneous coupling of qubits on a chain and engineer a set of non-local parity-dependent quantum operations. The resulting effective long-range couplings directly implement a parametrizable Trotter-step for Jordan-Wigner fermions. We present numerical simulations of the gate operation in a superconducting quantum circuit architecture.
  arXiv  Detail & Related papers  (2022-03-14T17:33:40Z)
• Orders of magnitude reduction in the computational overhead for quantum many-body problems on quantum computers via an exact transcorrelated method [0.0]
  We show that the Hamiltonian becomes non-Hermitian, posing problems for quantum algorithms based on the variational principle. We overcome these limitations with the ansatz-based quantum imaginary time evolution algorithm. Our work paves the way for the use of exact transcorrelated methods for the simulations of ab initio systems on quantum computers.
  arXiv  Detail & Related papers  (2022-01-09T16:37:32Z)
• Circuit quantum electrodynamics (cQED) with modular quasi-lumped models [0.23624125155742057]
  Method partitions a quantum device into compact lumped or quasi-distributed cells. We experimentally validate the method on large-scale, state-of-the-art superconducting quantum processors.
  arXiv  Detail & Related papers  (2021-03-18T16:03:37Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• 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.