Related papers: Abstraqt: Analysis of Quantum Circuits via Abstrac…
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…
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…
The study of quantum circuit simulation using classical computers is a key research topic that helps define the boundary of verifiable quantum advantage, solve quantum many-body problems, and inform development of quantum hardware and…
A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more…
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design.…
Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that…
Quantum circuit simulators running on classical computers offer a vital platform for designing, testing, and optimizing quantum algorithms, driving innovation despite limited access to real quantum hardware. However, their scalability is…
Achieving near-term quantum advantage will require accurate estimation of quantum observables despite significant hardware noise. For this purpose, we propose a novel, scalable error-mitigation method that applies to gate-based quantum…
In circuit quantum acoustodynamics (cQAD), superconducting circuits are combined with acoustic resonators to create and control non-classical states of mechanical motion. Simulating these systems is challenging due to the extreme difference…
We extend the recently introduced notion of tensor enumerator to the circuit enumerator. We provide a mathematical framework that offers a novel method for analyzing circuits and error models without resorting to Monte Carlo techniques. We…
We investigate the problem of evaluating the output probabilities of Clifford circuits with nonstabilizer product input states. First, we consider the case when the input state is mixed, and give an efficient classical algorithm to…
Quantum Entanglement is a fundamentally important resource in Quantum Information Science; however, generating it in practice is plagued by noise and decoherence, limiting its utility. Entanglement distillation and forward error correction…
We investigate Clifford+$T$ quantum circuits with a small number of $T$-gates. Using the sparsification lemma, we identify time complexity lower bounds in terms of $T$-gate count below which a strong simulator would improve on the…
Measuring global quantum properties-such as the fidelity to complex multipartite states-is both an essential and experimentally challenging task. Classical shadow estimation offers favorable sample complexity, but typically relies on…
Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage: In seminal work [Quantum Inf. Comput., 4(2):134--145], Terhal and DiVincenzo have shown that these…
As we continue to find applications where the currently available noisy devices exhibit an advantage over their classical counterparts, the efficient use of quantum resources is highly desirable. The notion of quantum autoencoders was…
We study how much noise can be tolerated by a universal gate set before it loses its quantum-computational power. Specifically we look at circuits with perfect stabilizer operations in addition to imperfect non-stabilizer gates. We prove…
Recent advances in quantum hardware are bringing fault-tolerant quantum computing (FTQC) closer to reality. In the early stage of FTQC, however, the numbers of available logical qubits and high-fidelity $T$ gates remain limited, making it…
Although quantum computing holds promise to accelerate a wide range of computational tasks, the quantum simulation of quantum dynamics as originally envisaged by Feynman remains the most promising candidate for achieving quantum advantage.…
The development of a framework for quantifying "non-stabiliserness" of quantum operations is motivated by the magic state model of fault-tolerant quantum computation, and by the need to estimate classical simulation cost for noisy…