Phase Estimation with Compressed Controlled Time Evolution

• URL: http://arxiv.org/abs/2511.21225v1
• Date: Wed, 26 Nov 2025 09:54:09 GMT
• Title: Phase Estimation with Compressed Controlled Time Evolution
• Abstract summary: This work establishes a compression protocol for encoding the controlled time evolution operator of translationally invariant, local Hamiltonians into a quantum circuit.<n>It achieves a near-optimal scaling in circuit depth while reducing the control overhead from a multiplicative to an additive factor.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Many optimally scaling quantum simulation algorithms employ controlled time evolution of the Hamiltonian, which is typically the major bottleneck for their efficient implementation. This work establishes a compression protocol for encoding the controlled time evolution operator of translationally invariant, local Hamiltonians into a quantum circuit. It achieves a near-optimal scaling in circuit depth $\mathcal{O}(t \text{ polylog}(t N/ε))$, while reducing the control overhead from a multiplicative to an additive factor. We report that this compression protocol enables the implementation of Iterative Quantum Phase Estimation with as few as 414 CNOT gates for a frustrated quantum spin system on a 6x6 triangular lattice and delivers ground state energy errors below 1% (with $\pm$ 1.5% variation, calculated with a hardware noise aware pipeline) on a 4x4 triangular lattice using the noisy emulator of the Quantinuum H2 trapped ion device.

Related papers

• Inverse Design of Quantum Control Sequences with Fourier Neural Operators [57.63590760083204]
  We introduce a Fourier Neural Operator (FNO)-based framework for learning high dimensional molecular quantum dynamics.<n>We develop the FNO pulse-measurement planner (FNO-SPMP), which constructs pulse sequences to purify an initially mixed Boltzmann distribution.<n>In a shared discrete control space, FNO-SPMP achieves nearly twice the success rate of a reinforcement-learning baseline.
  arXiv  Detail & Related papers  (2026-08-04T14:06:59Z)
• Near-Optimal Quantum Time Evolution Circuits via Provably Convergent Compression [0.0]
  Variational compression can significantly lower implementation overheads for encoding the time evolution of Hamiltonians into quantum circuits.<n>We provide a recipe for choosing the initial point of such variational optimizations that guarantees convergence to a quantum circuit.
  arXiv  Detail & Related papers  (2026-05-16T16:35:09Z)
• 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)
• Quantum-Inspired Algorithms beyond Unitary Circuits: the Laplace Transform [0.0]
  Quantum-inspired algorithms can deliver substantial speedups over classical state-of-the-art methods.<n>We introduce a tensor-network approach to compute the discrete Laplace transform, a non-unitary, aperiodic transform.<n>We demonstrate simulations up to $N=230$ input data points, with up to $260$ output data points, and quantify how bond dimension controls runtime and accuracy.
  arXiv  Detail & Related papers  (2026-01-25T07:19:56Z)
• Fast and Robust Remote Two-Qubit Gates on Distributed Qubits [13.099136824902303]
  This article proposes and demonstrates a remote quantum geometric gate scheme via parametric modulation.<n>We experimentally realize the rapid remote SWAP and $sqrttextSWAP$ gates with high fidelity, completing operation in about 30 ns.
  arXiv  Detail & Related papers  (2025-11-03T10:12:16Z)
• Simulating high-accuracy nuclear motion Hamiltonians in discrete variable representation using Walsh-Hadamard QROM with fault-tolerant quantum computers [0.0]
  We present a quantum algorithm for simulating rovibrational Hamiltonians on fault-tolerant quantum computers.<n>The quantum volume required for computing the rovibrational spectrum of water can be reduced by up to $105$ times.
  arXiv  Detail & Related papers  (2025-10-21T20:31:12Z)
• Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution [47.60253809426628]
  We present the Pre-Trajectory Sampling technique, increasing efficiency and utility of trajectory simulations by tailoring error types.<n>We generate massive datasets of one trillion and one million shots, respectively.
  arXiv  Detail & Related papers  (2025-04-22T22:36:18Z)
• Deep Circuit Compression for Quantum Dynamics via Tensor Networks [0.4972323953932129]
  We present a compilation algorithm for generating compressed circuits enabling real-time simulation on digital quantum computers.<n>For a given depth, the algorithm is more accurate than all Trotterizations of the same depth.<n>We demonstrate this by compiling a 52-qubit 2D Transverse-Field Ising propagator onto the IBM Heavy-Hex topology.
  arXiv  Detail & Related papers  (2024-09-24T18:00:05Z)
• Tensor-based quantum phase difference estimation for large-scale demonstration [1.46955585643264]
  We develop an energy calculation algorithm leveraging quantum phase difference estimation (QPDE) scheme.<n>Alongside its efficient implementation, this algorithm reduces depolarization noise affections exponentially.<n>We demonstrate energy gap calculations for one-dimensional Hubbard models on IBM superconducting devices.
  arXiv  Detail & Related papers  (2024-08-09T09:01:37Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• 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 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• 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.