Related papers: Circuit compression for 2D quantum dynamics

Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms, establishing boundaries of quantum advantage and exploring heuristic quantum algorithms. We present a full-state vector simulation…

Classical simulation of quantum circuits is crucial for evaluating and validating the design of new quantum algorithms. However, the number of quantum state amplitudes increases exponentially with the number of qubits, leading to the…

We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an…

We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in $d \geq 2$ dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be…

Characterizing quantum dynamics is essential for quantifying arbitrary properties of a quantum process -- such as its ability to exhibit quantum-mechanical dynamics or generate entanglement. However, current methods require a number of…

Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…

Open quantum systems are central to quantum optics, condensed matter, and chemistry, yet their simulation remains challenging for both classical and near-term quantum hardware. In this work we implement and execute utility-scale quantum…

Simulating quantum many-body dynamics is important both for fundamental understanding of physics and practical applications for quantum information processing. Therefore, classical simulation methods have been developed so far.…

We introduce a novel software-oriented model of quantum computation motivated by the practical constraints of near-term quantum hardware. In this model, gates are specified by constraints expressed in terms of Pauli observables, with each…

Nonequilibrium dynamics of quantum many-body systems is challenging for classical computing, providing opportunities for demonstrating practical quantum computational advantage with analogue quantum simulators. Owing to the intimate…

The optimization of quantum circuit depth is crucial for practical quantum computing, as limited coherence times and error-prone operations constrain executable algorithms. Measurement and feedback operations are fundamental in quantum…

Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a…

It is well-known that simulating quantum circuits with low but non-zero hardware noise is more difficult than without noise. It requires either to perform density matrix simulations (coming with a space overhead) or to sample over "quantum…

We present Quantum Depth Compression (QDC), a general compilation framework that utilizes dynamic circuits to reduce arbitrary quantum circuits to depth linear in the number of non-Clifford gates and to grid connectivity without the need…

In order to evaluate, validate, and refine the design of new quantum algorithms or quantum computers, researchers and developers need methods to assess their correctness and fidelity. This requires the capabilities of quantum circuit…

Quantum computers have the potential to efficiently simulate the dynamics of many interacting quantum particles, a classically intractable task of central importance to fields ranging from chemistry to high-energy physics. However,…

State-of-the-art quantum computers can only reliably execute circuits with limited qubit numbers and computational depth. This severely reduces the scope of algorithms that can be run. While numerous techniques have been invented to exploit…

Quantum simulation is a potentially powerful application of quantum computing, holding the promise to be able to emulate interesting quantum systems beyond the reach of classical computing methods. Despite such promising applications, and…

Quantum circuit complexity is a fundamental concept whose importance permeates quantum information, computation, many-body physics and high-energy physics. While extensively studied in closed systems, its characterization and behaviors in…

The real-time evolution of strongly interacting matter remains a frontier of fundamental physics, as classical simulations are hampered by exponential Hilbert space growth and rapid, unmanageable growth of quantum entanglement. This study…