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

Bulletin of the American Physical Society

Can multi-particle systems be too entangled to be useful for quantum computation?

Jens Eisert

Published Mar 16, 2009• 0 citations
OpenAlex

Related papers

Multi-particle entanglement in quantum computers

Klaus Mølmer, Anders Søndberg Sørensen

Springer eBooks•Jan 1, 2001•0 citations

RISQ-reduced instruction set quantum computers

Klaus Mølmer, Anders S⊘rensen

Candidates for quantum computing which offer only restricted control, e.g. due to lack of access to individual qubits, are not useful for general purpose quantum computing. We present concrete proposals for the use of systems with such limitations as RISQ-reduced instruction set quantum computers and devices-for simulation of quantum dynamics, for multi-particle entanglement and squeezing of collective spin variables. These tasks are useful in their own right, and they also provide experimental probes for the functioning of quantum gates in premature prototypes of quantum computers.

arXiv:quant-ph/0004014•Journal of Modern Optics•Nov 1, 2000•8 citations

RISQ - reduced instruction set quantum computers

Klaus Mølmer, Anders Sørensen

Candidates for quantum computing which offer only restricted control, e.g., due to lack of access to individual qubits, are not useful for general purpose quantum computing.We present concrete proposals for the use of systems with such limitations as RISQreduced instruction set quantum computers and devices -for simulation of quantum dynamics, for multi-particle entanglement and squeezing of collective spin variables.These tasks are useful in their own right, and they also provide experimental probes for the functioning of quantum gates in pre-mature proto-types of quantum computers.

Journal of Modern Optics•Nov 20, 2000•1 citation

Understanding the role of entanglement in quantum computing

Benoît Vermersch

•Sep 1, 2022•0 citations

A criterion for testing multi-particle NPT entanglement

Bei Zeng, D. L. Zhou, P. Zhang +2 more

We revisit the criterion of multi-particle entanglement based on the overlaps of a given quantum state $ρ$ with maximally entangled states. For a system of $m$ particles, each with $N$ distinct states, we prove that $ρ$ is $m$-particle negative partial transpose (NPT) entangled, if there exists a maximally entangled state $|{\rm MES}>$, such that $>{1}/{N}$. While this sufficiency condition is weaker than the Peres-Horodecki criterion in all cases, it applies to multi-particle systems, and becomes especially useful when the number of particles ($m$) is large. We also consider the converse of this criterion and illustrate its invalidity with counter examples.

arXiv:quant-ph/0305091•May 16, 2003•0 citations

Quantum Networks and Multi-Particle Entanglement

H. J. Briegel, S. J. van Enk, J. I. Cirac +9 more

Springer eBooks•Jan 1, 2000•3 citations
Candidates for quantum computing which offer only restricted control, e.g. due to lack of access to individual qubits, are not useful for general purpose quantum computing. We present concrete proposals for the use of systems with such limitations as RISQ-reduced instruction set quantum computers and devices-for simulation of quantum dynamics, for multi-particle entanglement and squeezing of collective spin variables. These tasks are useful in their own right, and they also provide experimental probes for the functioning of quantum gates in premature prototypes of quantum computers.
Candidates for quantum computing which offer only restricted control, e.g., due to lack of access to individual qubits, are not useful for general purpose quantum computing.We present concrete proposals for the use of systems with such limitations as RISQreduced instruction set quantum computers and devices -for simulation of quantum dynamics, for multi-particle entanglement and squeezing of collective spin variables.These tasks are useful in their own right, and they also provide experimental probes for the functioning of quantum gates in pre-mature proto-types of quantum computers.
We revisit the criterion of multi-particle entanglement based on the overlaps of a given quantum state ρρρ with maximally entangled states. For a system of mmm particles, each with NNN distinct states, we prove that ρρρ is mmm-particle negative partial transpose (NPT) entangled, if there exists a maximally entangled state ∣MES>|{\rm MES}>∣MES>, such that >1/N>{1}/{N}>1/N. While this sufficiency condition is weaker than the Peres-Horodecki criterion in all cases, it applies to multi-particle systems, and becomes especially useful when the number of particles (mmm) is large. We also consider the converse of this criterion and illustrate its invalidity with counter examples.