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

Canadian Journal of Physics

Can a quantum computer simulate quantum field theory – efficiently?

Daria Ahrensmeier

Published Apr 1, 2008• 0 citations
Publisher

Abstract

The question posed in the title is discussed from a conceptual point of view. Typical complex problems in quantum field theory are described, the basic principles of quantum computing and simulation are explained and illustrated by examples, and suggestions for further investigations are made.PACS Nos.: 03.67.Lx, 11.10.–z
DOI
10.1139/p07-181

Related papers

Computational Methods for Simulating Quantum Computers

Hans A. De Raedt, Kristel F. L. Michielsen

This review gives a survey of numerical algorithms and software to simulate quantum computers. It covers the basic concepts of quantum computation and quantum algorithms and includes a few examples that illustrate the use of simulation software for ideal and physical models of quantum computers.

arXiv:quant-ph/0406210•Jun 27, 2004•36 citations

An attempt to close the Einstein–Podolsky–Rosen debate

T Krüger

Based on a new rigorous ensemble approach to quantum mechanics, and without stressing any idea or concept of reality, the entire Einstein–Podolsky–Rosen (EPR) problem can be boiled down to the question of whether the separability principle of the natural sciences is universally valid. To give a precise answer first of all Bell's inequality is deduced from said ensemble point of view and with minimal requirements only. (In the final discussion of the results it turns out that Bell's inequality defines the upper bound for those basic correlations that are due to a mere conservation law.) Then, by use of Wheeler's gedanken experiment with coin halves, I show that the statistical operator representing an ensemble under investigation may be either separable (in a simplified sense) or not. The conceptual consequences of nonseparability are explained, and a general EPR-type experiment is re-examined. Thereby, it is proven that, if and only if, the statistical operator is nonseparable, Bell's inequality may be violated. Experimental evidence demands nonseparable operators. So, if quantum mechanics is assumed to make statistical statements on the results of measurements on ensembles only, there is no way to avoid acceptance of its (operationally) holistic character, and the question posed at the outset must be negated. PACS Nos : 03.65.Ta, 03.65.Ud

Canadian Journal of Physics•Jan 1, 2004•6 citations

Hidden symmetry detection on a quantum computer

Ralf Schützhold, William George Unruh

The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved efficiently by quantum computers, it will be demonstrated by means of a simple example, that the detection of more general hidden (two-point) symmetries {$V\{f(x),f(U[x])\}=0$} by a quantum algorithm can also admit an exponential speed-up. E.g., one member of this class of symmetries {$V\{f(x),f(U[x])\}=0$} is discrete self-similarity (or discrete scale invariance). PACS: 03.67.Lx, 89.70.+c.

arXiv:quant-ph/0304090•Apr 12, 2003•0 citations

Simulations of Many-Body Quantum Systems by a Quantum Computer

Stephen J. Wiesner

We suggest that quantum computers can solve quantum many-body problems that are impracticable to solve on a classical computer.

arXiv:quant-ph/9603028•Mar 26, 1996•127 citations

Simulating Strongly Coupled Quantum Field Theory with Quantum Algorithms

Nonperturbative quantum field theory problems can often be difficult to solve with classical algorithms. Researchers now develop quantum computing algorithms to understand such problems in the Hamiltonian formalism.

JPS Hot Topics•Jan 1, 2022•0 citations

Hidden symmetry detection on a quantum computer

Ralf Schützhold, William George Unruh

The fastest quantum algorithms (for the solution of classical computational problems) known so far are basically variations of the hidden subgroup problem f(U[x])=f(x). By means of some simple examples it is demonstrated that the detection of more general hidden (two-point) symmetries V{f(x),f(U[x])}=0 by a quantum computer can also admit an exponential speed-up. PACS: 03.67.Lx, 03.67.-a, 89.70.+c.

•Apr 12, 2003•0 citations
Based on a new rigorous ensemble approach to quantum mechanics, and without stressing any idea or concept of reality, the entire Einstein–Podolsky–Rosen (EPR) problem can be boiled down to the question of whether the separability principle of the natural sciences is universally valid. To give a precise answer first of all Bell's inequality is deduced from said ensemble point of view and with minimal requirements only. (In the final discussion of the results it turns out that Bell's inequality defines the upper bound for those basic correlations that are due to a mere conservation law.) Then, by use of Wheeler's gedanken experiment with coin halves, I show that the statistical operator representing an ensemble under investigation may be either separable (in a simplified sense) or not. The conceptual consequences of nonseparability are explained, and a general EPR-type experiment is re-examined. Thereby, it is proven that, if and only if, the statistical operator is nonseparable, Bell's inequality may be violated. Experimental evidence demands nonseparable operators. So, if quantum mechanics is assumed to make statistical statements on the results of measurements on ensembles only, there is no way to avoid acceptance of its (operationally) holistic character, and the question posed at the outset must be negated. PACS Nos : 03.65.Ta, 03.65.Ud
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {f(U[x])=f(x)f(U[x])=f(x)f(U[x])=f(x)}. Following a discussion regarding which tasks might be solved efficiently by quantum computers, it will be demonstrated by means of a simple example, that the detection of more general hidden (two-point) symmetries {V{f(x),f(U[x])}=0V\{f(x),f(U[x])\}=0V{f(x),f(U[x])}=0} by a quantum algorithm can also admit an exponential speed-up. E.g., one member of this class of symmetries {V{f(x),f(U[x])}=0V\{f(x),f(U[x])\}=0V{f(x),f(U[x])}=0} is discrete self-similarity (or discrete scale invariance). PACS: 03.67.Lx, 89.70.+c.