Deep Circuit Compression for Quantum Dynamics via Tensor Networks

• URL: http://arxiv.org/abs/2409.16361v2
• Date: Wed, 25 Jun 2025 22:53:03 GMT
• Title: Deep Circuit Compression for Quantum Dynamics via Tensor Networks
• Abstract summary: 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.
• Score: 0.4972323953932129
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dynamic quantum simulation is a leading application for achieving quantum advantage. However, high circuit depths remain a limiting factor on near-term quantum hardware. We present a compilation algorithm based on Matrix Product Operators for generating compressed circuits enabling real-time simulation on digital quantum computers, that for a given depth are more accurate than all Trotterizations of the same depth. By the efficient use of environment tensors, the algorithm is scalable in depth beyond prior work, and we present circuit compilations of up to 64 layers of $SU(4)$ gates. Surpassing only 1D circuits, our approach can flexibly target a particular quasi-2D gate topology. We demonstrate this by compiling a 52-qubit 2D Transverse-Field Ising propagator onto the IBM Heavy-Hex topology. For all circuit depths and widths tested, we produce circuits with smaller errors than all equivalent depth Trotter unitaries, corresponding to reductions in error by up to 4 orders of magnitude and circuit depth compressions with a factor of over 6.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Efficient Equivalent of Shallow Quantum Hashing [45.88028371034407]
  We establish a connection between shallow quantum hashing and single-qubit quantum hashing for the amplitude form.<n>For a shallow circuit, we propose a circuit of depth 1 that achieves the same collision resistance.
  arXiv  Detail & Related papers  (2025-11-24T16:38:17Z)
• QASER: Breaking the Depth vs. Accuracy Trade-Off for Quantum Architecture Search [43.72215866683917]
  Quantum computing faces a key challenge: balancing the need for low circuit depth with the high accuracy required for complex computations.<n>We introduce a novel reinforcement learning approach featuring engineered reward functions, called textbfQASER.<n>We achieve up to 50% improved accuracy, while reducing 2-qubit gate counts and depths by 20%.
  arXiv  Detail & Related papers  (2025-11-20T11:53:38Z)
• Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• Data Complexity Measures for Quantum Circuits Architecture Recommendation [55.74527632797241]
  Quantum Parametric Circuits are constructed as an alternative to reduce the size of quantum circuits. determining the optimal circuit for a given problem remains an open question. In this work, a quantum circuit recommendation architecture for classification problems is proposed using database complexity measures.
  arXiv  Detail & Related papers  (2025-02-21T01:17:24Z)
• Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage [17.38734393793605]
  We propose an approximate method for compiling target quantum circuits into brick-wall layouts. This new circuit design consists of two-qubit CNOT gates that can be directly implemented on real quantum computers.
  arXiv  Detail & Related papers  (2025-01-13T15:04:39Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose arbitrary exponentials into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions. We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures [41.39072840772559]
  Route-Forcing is a quantum circuit mapping algorithm that shows an average speedup of $3.7times$. We present a quantum circuit mapping algorithm that shows an average speedup of $3.7times$ compared to the state-of-the-art scalable techniques.
  arXiv  Detail & Related papers  (2024-07-24T14:21:41Z)
• A two-circuit approach to reducing quantum resources for the quantum lattice Boltzmann method [41.66129197681683]
  Current quantum algorithms for solving CFD problems use a single quantum circuit and, in some cases, lattice-based methods. We introduce the a novel multiple circuits algorithm that makes use of a quantum lattice Boltzmann method (QLBM) The problem is cast as a stream function--vorticity formulation of the 2D Navier-Stokes equations and verified and tested on a 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Robust sparse IQP sampling in constant depth [3.670008893193884]
  NISQ (noisy intermediate scale quantum) approaches without any proof of robust quantum advantage and fully fault-tolerant quantum computation. We propose a scheme to achieve a provable superpolynomial quantum advantage that is robust to noise with minimal error correction requirements.
  arXiv  Detail & Related papers  (2023-07-20T09:41:08Z)
• Efficient parallelization of quantum basis state shift [0.0]
  We optimize the state shift algorithm by incorporating the shift in different directions in parallel. This provides a significant reduction in the depth of the quantum circuit in comparison to the currently known methods. We focus on the one-dimensional and periodic shift, but note that the method can be extended to more complex cases.
  arXiv  Detail & Related papers  (2023-04-04T11:01:08Z)
• Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach [1.237454174824584]
  We introduce AQCtensor, a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS) Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum many-body Hamiltonians. For simulation problems on 100 qubits, we show that AQCtensor achieves at least an order of magnitude reduction in the depth of the resulting optimized circuit.
  arXiv  Detail & Related papers  (2023-01-20T14:40:29Z)
• Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary Matrices with Asymptotically Optimal Gate Count [9.194399933498323]
  It is of great importance to optimize the depth/gate-count when designing quantum circuits for specific tasks. In this paper, we propose a depth-optimized synthesis algorithm that automatically produces a quantum circuit for any given diagonal unitary matrix.
  arXiv  Detail & Related papers  (2022-12-02T06:58:26Z)
• Wide Quantum Circuit Optimization with Topology Aware Synthesis [0.8469686352132708]
  Unitary synthesis is an optimization technique that can achieve optimal multi-qubit gate counts while mapping quantum circuits to restrictive qubit topologies. We present TopAS, a topology aware synthesis tool built with the emphBQSKit framework that preconditions quantum circuits before mapping.
  arXiv  Detail & Related papers  (2022-06-27T21:59:30Z)
• Gaussian initializations help deep variational quantum circuits escape from the barren plateau [87.04438831673063]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years. However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number. This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)

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.