Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2112.06682

Quantum simulation using noisy unitary circuits and measurements

Oliver Lunt·Jonas Richter·Arijeet Pal
View original source ↗Read source document ↗Export metadata ↓

Abstract

Many-body quantum systems are notoriously hard to study theoretically due to the exponential growth of their Hilbert space. It is also challenging to probe the quantum correlations in many-body states in experiments due to their sensitivity to external noise. Using synthetic quantum matter to simulate quantum systems has opened new ways of probing quantum many-body systems with unprecedented control, and of engineering phases of matter which are otherwise hard to find in nature. Noisy quantum circuits have become an important cornerstone of our understanding of quantum many-body dynamics. In particular, random circuits act as minimally structured toy models for chaotic nonintegrable quantum systems, faithfully reproducing some of their universal properties. Crucially, in contrast to the full microscopic model, random circuits can be analytically tractable under a reasonable set of assumptions, thereby providing invaluable insights into questions which might be out of reach even for state-of-the-art numerical techniques. Here, we give an overview of two classes of dynamics studied using random-circuit models, with a particular focus on the dynamics of quantum entanglement. We will especially pay attention to potential near-term applications of random-circuit models on noisy-intermediate scale quantum (NISQ) devices. In this context, we cover hybrid circuits consisting of unitary gates interspersed with nonunitary projective measurements, hosting an entanglement phase transition from a volume-law to an area-law phase of the steady-state entanglement. Moreover, we consider random-circuit sampling experiments and discuss the usefulness of random quantum states for simulating quantum many-body dynamics on NISQ devices by leveraging the concept of quantum typicality. We highlight how emergent hydrodynamics can be studied by utilizing random quantum states generated by chaotic circuits.

Explore related subjects

quant-phcond-mat.stat-mechcond-mat.str-el

Keep this discovery

BibTeXRIS

Oliver Lunt, Jonas Richter, Arijeet Pal. 2021-12-13. Quantum simulation using noisy unitary circuits and measurements. https://doi.org/10.1007/978-3-031-03998-0_10

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗