Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0204065 · Physical Review Letters

Efficient Classical Simulation of Optical Quantum Information Circuits

Stephen D. Bartlett, Barry C. Sanders

Published Oct 29, 2002• 68 citations
arXivHTMLPDF

Abstract

We identify a broad class of physical processes in an optical quantum circuit that can be efficiently simulated on a classical computer: this class includes unitary transformations, amplification, noise, and measurements. This simulatability result places powerful constraints on the capability to realize exponential quantum speedups as well as on inducing an optical nonlinear transformation via linear optics, photodetection-based measurement, and classical feedforward of measurement results, optimal cloning, and a wide range of other processes.

DOI
10.1103/physrevlett.89.207903

Related papers

Efficient classical simulation of measurements in optical quantum information

Stephen D. Bartlett, Barry C. Sanders

We present conditions for the efficient simulation of a broad class of optical quantum circuits on a classical machine: this class includes unitary transformations, amplification, noise, and measurements. Various proposed schemes for universal quantum computation using optics are assessed against these conditions, and we consider the minimum resource requirements needed in any optical scheme to generate optical nonlinear processes and perform universal quantum computation.

arXiv:quant-ph/0209133•Sep 25, 2002•0 citations

Implementation of classical linear stochastic systems using quantum optical components

Shi Wang, Hendra I. Nurdin, Guofeng Zhang +1 more

The purpose of this paper is to show how classical linear stochastic systems can be physically implemented using quantum optical components. Quantum optical systems typically have much higher bandwidth than electronic devices, meaning faster response and

Australian Control Conference•Jan 1, 2011•2 citations

Measurement-Driven Quantum Advantages in Shallow Circuits

Chenfeng Cao, Jens Eisert

Quantum advantage schemes probe the boundary between classically simulatable and classically intractable quantum dynamics. We explore the impact of midcircuit measurements on the computational power of quantum circuits. To this effect, we focus on quantum sampling and introduce a constant-depth measurement-driven approach for efficiently sampling from a broad class of commuting diagonal quantum circuits and associated structured phase states, previously requiring polynomial-depth unitary circuits. By interleaving midcircuit measurements with feedforward in randomized "fan-out staircases," our dynamical circuits bypass Lieb-Robinson light-cone constraints, enabling global entanglement with flexible auxiliary qubit usage on bounded-degree lattices (e.g., two-dimensional grids). The generated phase states exhibit random-matrix statistics and anticoncentration comparable to fully random architectures. We further demonstrate measurement-driven feature maps that distinguish phases of an extended Su-Schrieffer-Heeger model from random eigenstates in a quantum machine-learning benchmark (reservoir computing). Technologically, our results harness midcircuit measurements to realize quantum advantages on bounded-degree hardware with a favorable topology. Conceptually, they provide complexity-theoretic support for quantum speedups by midcircuit measurements.

arXiv:2505.04705•Physical Review Letters•Jan 9, 2026•6 citations

Introduction to Optical Quantum Information Processing

Pieter Kok, Brendon W. Lovett

Quantum information processing offers fundamental improvements over classical information processing, such as computing power, secure communication, and high-precision measurements. However, the best way to create practical devices is not yet known. This textbook describes the techniques that are likely to be used in implementing optical quantum information processors. After developing the fundamental concepts in quantum optics and quantum information theory, the book shows how optical systems can be used to build quantum computers according to the most recent ideas. It discusses implementations based on single photons and linear optics, optically controlled atoms and solid-state systems, atomic ensembles, and optical continuous variables. This book is ideal for graduate students beginning research in optical quantum information processing. It presents the most important techniques of the field using worked examples and over 120 exercises.

Cambridge University Press eBooks•Apr 22, 2010•344 citations

QFARE: Quantum Feedforward Adaptive Reinforcement Ensemble for MNIST Classification

Yichen Xie

We introduce QFARE, a hybrid quantum-classical architecture for MNIST digit classification. Our approach employs a classical variational autoencoder (VAE) to compress 28×28 grayscale images into 64-dimensional latent representations. These compressed features are then loaded into an 8-qubit register. We augment this register with 4 additional ancilla qubits, whose partial mid-circuit measurements and subsequent conditional resets induce nonunitary transformations on the main qubits. This effectively provides a nonlinearity mechanism in an otherwise unitary quantum circuit, analogous to activation functions in classical neural networks. We train the resulting model end-to-end using a reinforcement learning algorithm (TD3) that explores the space of circuit parameters without relying on gradients of the quantum circuit, thus avoiding barren plateaus. Our theoretical framework proves that these measurement-based feedforward operations can simulate broad classes of nonunitary channels, guaranteeing universal classification capability when paired with a classical classifier. On a noiseless simulator, our experiments demonstrate that QFARE achieves around 99% accuracy on MNIST with significantly fewer parameters than purely classical neural network baselines. We also investigate the impact of circuit depth, the number of ancilla qubits, and how these aspects scale. This work shows how feedforward-enabled discrete-qubit designs can yield powerful and parameter-efficient classifiers for standard image recognition tasks.

International Joint Conference on Neural Networks (IJCNN)•Jun 30, 2025•0 citations

Simulating quantum computers with probabilistic methods

Maarten Van den Nest

We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate new classes of classically simulatable quantum circuits where standard techniques relying on the exact computation of measurement probabilities fail to provide efficient simulations. For example, we show how various concatenations of matchgate, Toffoli, Clifford, bounded-depth, Fourier transform and other circuits are classically simulatable. We also prove that sparse quantum circuits as well as circuits composed of CNOT and $\exp[{i\theta X}]$ gates can be simulated classically. In a second part, we apply our results to the simulation of quantum algorithms. It is shown that a recent quantum algorithm, concerned with the estimation of Potts model partition functions, can be simulated efficiently classically. Finally, we show that the exponential speed-ups of Simon's and Shor's algorithms crucially depend on the very last stage in these algorithms, dealing with the classical postprocessing of the measurement outcomes. Specifically, we prove that both algorithms would be classically simulatable if the function classically computed in this step had a sufficiently peaked Fourier spectrum.

Quantum Information and Computation•Sep 1, 2011•55 citations
We identify a broad class of physical processes in an optical quantum circuit that can be efficiently simulated on a classical computer: this class includes unitary transformations, amplification, noise, and measurements. This simulatability result places powerful constraints on the capability to realize exponential quantum speedups as well as on inducing an optical nonlinear transformation via linear optics, photodetection-based measurement, and classical feedforward of measurement results, optimal cloning, and a wide range of other processes.
Quantum advantage schemes probe the boundary between classically simulatable and classically intractable quantum dynamics. We explore the impact of midcircuit measurements on the computational power of quantum circuits. To this effect, we focus on quantum sampling and introduce a constant-depth measurement-driven approach for efficiently sampling from a broad class of commuting diagonal quantum circuits and associated structured phase states, previously requiring polynomial-depth unitary circuits. By interleaving midcircuit measurements with feedforward in randomized "fan-out staircases," our dynamical circuits bypass Lieb-Robinson light-cone constraints, enabling global entanglement with flexible auxiliary qubit usage on bounded-degree lattices (e.g., two-dimensional grids). The generated phase states exhibit random-matrix statistics and anticoncentration comparable to fully random architectures. We further demonstrate measurement-driven feature maps that distinguish phases of an extended Su-Schrieffer-Heeger model from random eigenstates in a quantum machine-learning benchmark (reservoir computing). Technologically, our results harness midcircuit measurements to realize quantum advantages on bounded-degree hardware with a favorable topology. Conceptually, they provide complexity-theoretic support for quantum speedups by midcircuit measurements.
Quantum information processing offers fundamental improvements over classical information processing, such as computing power, secure communication, and high-precision measurements. However, the best way to create practical devices is not yet known. This textbook describes the techniques that are likely to be used in implementing optical quantum information processors. After developing the fundamental concepts in quantum optics and quantum information theory, the book shows how optical systems can be used to build quantum computers according to the most recent ideas. It discusses implementations based on single photons and linear optics, optically controlled atoms and solid-state systems, atomic ensembles, and optical continuous variables. This book is ideal for graduate students beginning research in optical quantum information processing. It presents the most important techniques of the field using worked examples and over 120 exercises.
We introduce QFARE, a hybrid quantum-classical architecture for MNIST digit classification. Our approach employs a classical variational autoencoder (VAE) to compress 28×28 grayscale images into 64-dimensional latent representations. These compressed features are then loaded into an 8-qubit register. We augment this register with 4 additional ancilla qubits, whose partial mid-circuit measurements and subsequent conditional resets induce nonunitary transformations on the main qubits. This effectively provides a nonlinearity mechanism in an otherwise unitary quantum circuit, analogous to activation functions in classical neural networks. We train the resulting model end-to-end using a reinforcement learning algorithm (TD3) that explores the space of circuit parameters without relying on gradients of the quantum circuit, thus avoiding barren plateaus. Our theoretical framework proves that these measurement-based feedforward operations can simulate broad classes of nonunitary channels, guaranteeing universal classification capability when paired with a classical classifier. On a noiseless simulator, our experiments demonstrate that QFARE achieves around 99% accuracy on MNIST with significantly fewer parameters than purely classical neural network baselines. We also investigate the impact of circuit depth, the number of ancilla qubits, and how these aspects scale. This work shows how feedforward-enabled discrete-qubit designs can yield powerful and parameter-efficient classifiers for standard image recognition tasks.
We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate new classes of classically simulatable quantum circuits where standard techniques relying on the exact computation of measurement probabilities fail to provide efficient simulations. For example, we show how various concatenations of matchgate, Toffoli, Clifford, bounded-depth, Fourier transform and other circuits are classically simulatable. We also prove that sparse quantum circuits as well as circuits composed of CNOT and exp⁡[iθX]\exp[{i\theta X}]exp[iθX] gates can be simulated classically. In a second part, we apply our results to the simulation of quantum algorithms. It is shown that a recent quantum algorithm, concerned with the estimation of Potts model partition functions, can be simulated efficiently classically. Finally, we show that the exponential speed-ups of Simon's and Shor's algorithms crucially depend on the very last stage in these algorithms, dealing with the classical postprocessing of the measurement outcomes. Specifically, we prove that both algorithms would be classically simulatable if the function classically computed in this step had a sufficiently peaked Fourier spectrum.