Quantum Physics · arXiv:quant-ph/0512209 v1 · submitted 22 Dec 2005
Quantum Computation, Complexity, and Many-Body Physics
The paper says
“The results obtained show that the complexity of preparing a quantum state which contains the desired information for the computation is crucial.”
from the abstract · picked out as the main claim by a classifier
Reviews
Reviews by people
No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating non-classical correlations, or quantum entanglement, which is a phenomena hard or impossible to reproduce by classical-information methods. In this thesis I first investigate the simulation of quantum systems on a quantum computer constructed of two-level quantum elements or qubits. For this purpose, I present algebra mappings that allow one to obtain physical properties and compute correlation functions of fermionic, anyonic, and bosonic systems with such a computer. The results obtained show that the complexity of preparing a quantum state which contains the desired information for the computation is crucial. Second, I present a wide class of quantum computations, which could involve entangled states, that can be simulated with the same efficiency on both types of computers. The notion of generalized quantum entanglement then naturally emerges. This generalization of entanglement is based on the idea that entanglement is an observer-dependent concept, that is, relative to a set of preferred observables.
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-09-23 · no language-model review
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.09 · states limitation 0.62 · human participants 0.02 · controlled comparison 0.13 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.51 · mentions code or data availability 0.02
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. | background 1.00 | 0.05 | 0.08 | hedged possibility 0.98 |
| Among other reasons, this is due to the possibility of creating non-classical correlations, or quantum entanglement, which is a phenomena hard or impossible to reproduce by classical-information methods. | background 1.00 | 0.06 | 0.04 | hedged possibility 0.63 |
| In this thesis I first investigate the simulation of quantum systems on a quantum computer constructed of two-level quantum elements or qubits. | contribution 0.99 | 0.59 | 0.04 | asserted 0.93 |
| For this purpose, I present algebra mappings that allow one to obtain physical properties and compute correlation functions of fermionic, anyonic, and bosonic systems with such a computer. | method 0.78 | 0.90 | 0.06 | asserted 0.97 |
| The results obtained show that the complexity of preparing a quantum state which contains the desired information for the computation is crucial. | result 0.82 | 0.86 | 0.24 | asserted 1.00 |
| Second, I present a wide class of quantum computations, which could involve entangled states, that can be simulated with the same efficiency on both types of computers. | contribution 0.65 | 0.86 | 0.23 | hedged possibility 0.93 |
| The notion of generalized quantum entanglement then naturally emerges. | interpretation 0.81 | 0.49 | 0.10 | asserted 0.95 |
| This generalization of entanglement is based on the idea that entanglement is an observer-dependent concept, that is, relative to a set of preferred observables. | interpretation 0.76 | 0.37 | 0.14 | asserted 1.00 |
What kind of paper the classifier reports this is: method or tool 0.59 · evidence from proof or derivation 0.83
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,197 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Cited by 13 Pith papers
Reviewed papers on Pith that cite this one. OpenAlex reports about 59 citations worldwide. The full citation record
- Enabling Lie-Algebraic Classical Simulation beyond Free Fermions quant-ph · Apr 2026
- The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization quant-ph · May 2025
- A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits quant-ph · Sep 2023
- Unflattening by Flattening -- How Input Distributions Shape Output Variance in Angle-Encoded Circuits quant-ph · Oct 2026
- Characterizing quantum resourcefulness via group-Fourier decompositions quant-ph · Jun 2025
- Euclidean-Monte-Carlo-informed ground-state preparation for quantum simulation of scalar field theory quant-ph · Jun 2025
- Efficient Quantum Simulation of QCD Jets on the Light Front hep-ph · Nov 2024
- Showcasing a Barren Plateau Theory Beyond the Dynamical Lie Algebra quant-ph · Oct 2023
- Demonstration of Efficient Predictive Surrogates for Large-scale Quantum Processors quant-ph · Jul 2025
- Implicit solvent sample-based quantum diagonalization quant-ph · Feb 2025
- Toward simulating Superstring/M-theory on a quantum computer hep-th · Nov 2020
- Quantum simulation of quantum field theories as quantum chemistry hep-th · Apr 2020
- Barren Plateaus in Variational Quantum Computing quant-ph · May 2024
How the literature uses it
20 arXiv papers cite this in 31 sentences
Papers citing it · 15 sentences without a confident label
Uses its method or tool 4 papers
-
Our method, which works for fermionic, bosonic, and other types of Hamiltonians, uses a Lie algebraic version of the Jacobi eigenvalue algorithm for diagonalizing matrices [ref] , which we review.
Fast-forwarding quantum evolution · Lie-algebra diagonalization · 0.96
-
The standard Jordan-Wigner (JW) mapping is used to map fermions to qubits [ref] .
Implicit solvent sample-based quantum diagonalization · Sample-based quantum diagonalization with IEF-PCM · 0.98
-
Here, we map the fermionic degrees of freedom of Eq. [ref] to qubits with a Jordan-Wigner (JW) transformation [ref] .
Quantum-centric computation of molecular excited states with extended sample-based quantum diagonalization · Methods · 0.99
Cites it as support 1 paper
-
This is possible for all parameter settings for shallow hardware efficient ansätze [ref] and problem inspired ansätze with polynomial DLAs [ref] , and possible for any randomly chosen parameter setting with high probability for a wide class of unstructured parameterized quantum circuits [ref] , QCNNs [ref] , noisy circuits [ref] and small-angle initialization strategies [ref] .
Barren Plateaus in Variational Quantum Computing · Beyond barren plateaus in variational quantum computing · 0.98
Cites it as background 8 papers
-
Lie-algebraic expectation-value simulation originates in the generalized coherent-state and finite-representation framework of Somma et al. [ref] .
Lie-Algebraic Classical Simulation of Bosonic Systems Beyond Gaussian Dynamics · Classical simulability from finite reachable operator modules · 0.85
-
Early work by Somma et al. showed that quantum computational models whose gates and observables are confined to a compact, polynomial-dimensional Lie algebra can be exactly simulated classically with resources polynomial in the Lie-algebra dimension, even when the underlying Hilbert space is exponentially large [ref] .
Enabling Lie-Algebraic Classical Simulation beyond Free Fermions · Preliminaries · 0.98
-
In this context, prior studies of classical surrogates include those for; shallow hardware efficient ansätze [ref] , circuits with polynomial dynamical Lie Algebra [ref] , unstructured parameterized quantum circuits [ref] , quantum convolutional neural networks [ref] , quantum kernel-based circuits [ref] , noisy circuits [ref] and quantum machine learning [ref] .
Efficient quantum-enhanced classical simulation for patches of quantum landscapes · Introduction · 0.91
Challenges and discussion
Know something about this paper? Leave a comment.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment