Details
| Originalsprache | Englisch |
|---|---|
| Aufsatznummer | 042602 |
| Fachzeitschrift | Physical Review A |
| Jahrgang | 112 |
| Ausgabenummer | 4 |
| Frühes Online-Datum | 2 Okt. 2025 |
| Publikationsstatus | Veröffentlicht - Okt. 2025 |
Abstract
Negativity in certain quasiprobability representations is a necessary condition for a quantum computational advantage. Here we define a quasiprobability representation exhibiting this property with respect to quantum computations in the magic state model. It is based on generalized Jordan-Wigner transformations, and it has a close connection to the probability representation of universal quantum computation based on the _ polytopes. For each number of qubits, it defines a polytope contained in the _ polytope with some shared vertices. It leads to an efficient classical simulation algorithm for magic state quantum circuits for which the input state is positively represented, and it outperforms previous representations in terms of the states that can be positively represented.
ASJC Scopus Sachgebiete
- Physik und Astronomie (insg.)
- Atom- und Molekularphysik sowie Optik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Physical Review A, Jahrgang 112, Nr. 4, 042602, 10.2025.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Simulation of quantum computation with magic states via Jordan-Wigner transformations
AU - Zurel, Michael
AU - Cohen, Lawrence Z.
AU - Raussendorf, Robert
N1 - Publisher Copyright: © (2025), (American Physical Society). All rights reserved.
PY - 2025/10
Y1 - 2025/10
N2 - Negativity in certain quasiprobability representations is a necessary condition for a quantum computational advantage. Here we define a quasiprobability representation exhibiting this property with respect to quantum computations in the magic state model. It is based on generalized Jordan-Wigner transformations, and it has a close connection to the probability representation of universal quantum computation based on the _ polytopes. For each number of qubits, it defines a polytope contained in the _ polytope with some shared vertices. It leads to an efficient classical simulation algorithm for magic state quantum circuits for which the input state is positively represented, and it outperforms previous representations in terms of the states that can be positively represented.
AB - Negativity in certain quasiprobability representations is a necessary condition for a quantum computational advantage. Here we define a quasiprobability representation exhibiting this property with respect to quantum computations in the magic state model. It is based on generalized Jordan-Wigner transformations, and it has a close connection to the probability representation of universal quantum computation based on the _ polytopes. For each number of qubits, it defines a polytope contained in the _ polytope with some shared vertices. It leads to an efficient classical simulation algorithm for magic state quantum circuits for which the input state is positively represented, and it outperforms previous representations in terms of the states that can be positively represented.
UR - http://www.scopus.com/inward/record.url?scp=105019773565&partnerID=8YFLogxK
U2 - 10.1103/ng4l-96kd
DO - 10.1103/ng4l-96kd
M3 - Article
AN - SCOPUS:105019773565
VL - 112
JO - Physical Review A
JF - Physical Review A
SN - 2469-9926
IS - 4
M1 - 042602
ER -