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/0302125 · Journal of Modern Optics

Requirement for quantum computation

Stephen D. Bartlett, Barry C. Sanders

Published Jan 1, 2003• 27 citations
arXivHTMLPDF

Abstract

We identify ‘proper quantum computation’ with computational processes that cannot be efficiently simulated on a classical computer. For optical quantum computation, we establish no-go theorems for classes of quantum optical experiments that cannot yield proper quantum computation, and we identify requirements for optical proper quantum computation that correspond to violations of assumptions underpinning the no-go theorems.

DOI
10.1080/09500340308233564

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

Classical simulators of quantum computers and no-go theorems

Alexander Yu. Vlasov

It is discussed, why classical simulators of quantum computers escape from some no-go claims like Kochen-Specker, Bell, or recent Conway-Kochen "Free Will" theorems.

arXiv:quant-ph/0605219•May 25, 2006•1 citation

The quantum computer condition: requirements for viable computation

Gerald N. Gilbert, Michael Hamrick, F. Javier Thayer +1 more

In this paper we review the content of the Quantum Computer Condition, which is a rigorously specified criterion that provides a set of mathematical constraints that must be satisfied by a physical system if we intend to use that system as a quantum computing machine, and we discuss an important consequence of it known as the Quantum Computing No-Go Theorem, which establishes a bound for decoherence and dissipation beyond which quantum computation is not possible. In connection with this theorem, we explicitly calculate a universal critical damping value for fault-tolerant quantum computation. We also discuss a relevant class of time-dependent generalizations of the Lindblad equation.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 5, 2006•0 citations

Propagation of errors and quantitative quantum simulation with quantum advantage

Stuart Flannigan, Natalie Pearson, Guang Hao Low +5 more

Abstract The rapid development in hardware for quantum computing and simulation has led to much interest in problems where these devices can exceed the capabilities of existing classical computers and known methods. Approaching this for problems that go beyond testing the performance of a quantum device is an important step, and quantum simulation of many-body quench dynamics is one of the most promising candidates for early practical quantum advantage. We analyse the requirements for quantitatively reliable quantum simulation beyond the capabilities of existing classical methods for analogue quantum simulators with neutral atoms in optical lattices and trapped ions. Considering the primary sources of error in analogue devices and how they propagate after a quench in studies of the Hubbard or long-range transverse field Ising model, we identify the level of error expected in quantities we extract from experiments. We conclude for models that are directly implementable that regimes of practical quantum advantage are attained in current experiments with analogue simulators. We also identify the hardware requirements to reach the same level of accuracy with future fault-tolerant digital quantum simulation. Verification techniques are already available to test the assumptions we make here, and demonstrating these in experiments will be an important next step.

arXiv:2204.13644•Quantum Science and Technology•Aug 11, 2022•50 citations

Optical Quantum Computation

Kae Nemoto, William J. Munro, Timothy P. Spiller

We review recent theoretical progress in finding ways to perform quantum processing with optics using photon encoded qubits, qudits and continuous variables. We discuss the requirements, advantages and disadvantages of each approach and show that optics holds significant promise for computation.

•Mar 1, 2006•1 citation

A "thoughtful" Local Friendliness no-go theorem: a prospective experiment with new assumptions to suit

Howard M. Wiseman, Eric G. Cavalcanti, Eleanor Gilbert Rieffel

A recent paper by two of us and co-workers \cite{CQD20}, based on an extended Wigner's friend scenario, demonstrated that certain empirical correlations predicted by quantum theory (QT) violate inequalities derived from a set of metaphysical assumptions we called "Local Friendliness" (LF). These assumptions are strictly weaker than those used for deriving Bell inequalities. Crucial to the theorem was the premise that a quantum system with reversible evolution could be an observer (colloquially, a "friend"). However, that paper was noncommittal on what would constitute an observer for the purpose of an experiment. Here, we present a new LF no-go theorem which takes seriously the idea that a system's having thoughts is a sufficient condition for it to be an observer. Our new derivation of the LF inequalities uses four metaphysical assumptions, three of which are thought-related, including one that is explicitly called "Friendliness". These four assumptions, in conjunction, allow one to derive LF inequalities for experiments involving the type of system that "Friendliness" refers to. In addition to these four metaphysical assumptions, this new no-go theorem requires two assumptions about what is technologically feasible: Human-Level Artificial Intelligence, and Universal Quantum Computing which is fast and large scale. The latter is often motivated by the belief that QT is universal, but this is not an assumption of the theorem. The intent of the new theorem is to give a clear goal for future experimentalists, and a clear motivation for trying to achieve that goal. We review various approaches to QT in light of our theorem. The popular stance that "quantum theory needs no interpretation" does not question any of our assumptions and so is ruled out. Finally, we quantitatively discuss how difficult the experiment we envisage would be, and briefly discuss milestones on the paths towards it.

arXiv:2209.08491•Quantum•Sep 14, 2023•40 citations
We identify ‘proper quantum computation’ with computational processes that cannot be efficiently simulated on a classical computer. For optical quantum computation, we establish no-go theorems for classes of quantum optical experiments that cannot yield proper quantum computation, and we identify requirements for optical proper quantum computation that correspond to violations of assumptions underpinning the no-go theorems.
In this paper we review the content of the Quantum Computer Condition, which is a rigorously specified criterion that provides a set of mathematical constraints that must be satisfied by a physical system if we intend to use that system as a quantum computing machine, and we discuss an important consequence of it known as the Quantum Computing No-Go Theorem, which establishes a bound for decoherence and dissipation beyond which quantum computation is not possible. In connection with this theorem, we explicitly calculate a universal critical damping value for fault-tolerant quantum computation. We also discuss a relevant class of time-dependent generalizations of the Lindblad equation.
Abstract The rapid development in hardware for quantum computing and simulation has led to much interest in problems where these devices can exceed the capabilities of existing classical computers and known methods. Approaching this for problems that go beyond testing the performance of a quantum device is an important step, and quantum simulation of many-body quench dynamics is one of the most promising candidates for early practical quantum advantage. We analyse the requirements for quantitatively reliable quantum simulation beyond the capabilities of existing classical methods for analogue quantum simulators with neutral atoms in optical lattices and trapped ions. Considering the primary sources of error in analogue devices and how they propagate after a quench in studies of the Hubbard or long-range transverse field Ising model, we identify the level of error expected in quantities we extract from experiments. We conclude for models that are directly implementable that regimes of practical quantum advantage are attained in current experiments with analogue simulators. We also identify the hardware requirements to reach the same level of accuracy with future fault-tolerant digital quantum simulation. Verification techniques are already available to test the assumptions we make here, and demonstrating these in experiments will be an important next step.
A recent paper by two of us and co-workers \cite{CQD20}, based on an extended Wigner's friend scenario, demonstrated that certain empirical correlations predicted by quantum theory (QT) violate inequalities derived from a set of metaphysical assumptions we called "Local Friendliness" (LF). These assumptions are strictly weaker than those used for deriving Bell inequalities. Crucial to the theorem was the premise that a quantum system with reversible evolution could be an observer (colloquially, a "friend"). However, that paper was noncommittal on what would constitute an observer for the purpose of an experiment. Here, we present a new LF no-go theorem which takes seriously the idea that a system's having thoughts is a sufficient condition for it to be an observer. Our new derivation of the LF inequalities uses four metaphysical assumptions, three of which are thought-related, including one that is explicitly called "Friendliness". These four assumptions, in conjunction, allow one to derive LF inequalities for experiments involving the type of system that "Friendliness" refers to. In addition to these four metaphysical assumptions, this new no-go theorem requires two assumptions about what is technologically feasible: Human-Level Artificial Intelligence, and Universal Quantum Computing which is fast and large scale. The latter is often motivated by the belief that QT is universal, but this is not an assumption of the theorem. The intent of the new theorem is to give a clear goal for future experimentalists, and a clear motivation for trying to achieve that goal. We review various approaches to QT in light of our theorem. The popular stance that "quantum theory needs no interpretation" does not question any of our assumptions and so is ruled out. Finally, we quantitatively discuss how difficult the experiment we envisage would be, and briefly discuss milestones on the paths towards it.