The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Graphical description of the action of local Clifford transformations on graph states
Open accessAbstract
We translate the action of local Clifford operations on graph states into transformations on their associated graphs, i.e., we provide transformation rules, stated in purely graph theoretical terms, which completely characterize the evolution of graph states under local Clifford operations. As we will show, there is essentially one basic rule, successive application of which generates the orbit of any graph state under local unitary operations within the Clifford group.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The state | Φ ˆ θ 〉 △ is obtained via local complementation [44] on qubit 2 of | Φ ˆ θ 〉 ⊂ .”
From Demonstration of Blind Quantum Computing (2012) · cites this paper as [44]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,450
Diestel, R. (1997) · Cited by 5,082
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
Quantum Error Correction and Orthogonal Geometry
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.405 · Cited by 811
Multiparticle Entanglement Purification for Graph States
Dür, W., Aschauer, H. N., & Briegel, H. J. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.107903 · Cited by 216
Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
Dehaene, J., & De Moor, B. (2003) · Physical Review A · doi:10.1103/physreva.68.042318 · Cited by 183
Self-citationLocal permutations of products of Bell states and entanglement distillation
Dehaene, J., den Nest, M. V., Moor, B. D., & Verstraete, F. (2003) · Physical Review A · doi:10.1103/physreva.67.022310 · Cited by 84
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Items 301–333 of 333
Entanglement-assisted codeword-stabilized quantum codes with imperfect ebits
Ahn, B., Shin, J., & Heo, J. (2016) · ICT Express · doi:10.1016/j.icte.2016.05.005
Entanglement distribution in quantum complex networks
Cuquet, M. (2012) · TDX (Tesis Doctorals en Xarxa)
Characterizing quantum correlations: the genuine multiparticle negativity as entanglement monotone
Hofmann, M. (2014) · Recherche und Kataloge (Universitätsbibliothek Siegen)
Maximally nonlocal subspacesPreprint
Akshata Shenoy, H., & Srikanth, R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.05585
Creation of an unequally weighted four-mode square cluster state in a ring cavity
Yan, Y., Huang, G., Zhou, Z., & Li, G. (2019) · Journal of the Optical Society of America B · doi:10.1364/josab.36.001700
Access Structure in Graphs in High Dimension and Application to Secret Sharing
Marin, A., Markham, D., & Perdrix, S. (2013) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2013.308
Reducing stabilizer circuits without the symplectic groupPreprint
Bataille, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.09224
Aspects of Quantum Information and AdS/CFT Duality
Balushi, A. A. (2021) · UWSpace (University of Waterloo)
Quantum Multiple-Valued Decision Diagrams in Graphical CalculiPreprint
Vilmart, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.01186
Reduced quantum circuits for stabilizer states and graph statesPreprint
Bataille, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.00885
Graph states and the variety of principal minors
Galgano, V., & Holweck, F. (2023) · Annali di Matematica Pura ed Applicata (1923 -) · doi:10.1007/s10231-023-01361-8 · Cited by 1
Extending the graph formalism to higher-order gates
Khesin, A. B., & Ren, K. (2023) · Quantum Information and Computation · doi:10.26421/qic23.13-14-5
Provable quantum computational advantage with the cyclic cluster statePreprint
Daniel, A. K., Zhu, Y., Alderete, C. H., Buchemmavari, V., Green, A., Nguyen, N. H., Thurtell, T. G., Zhao, A., Linke, N. M., & Miyake, A. (2021) · arXiv (Cornell University)
General stabilizer approach for constructing highly entangled graph states
Raissi, Z., Burchardt, A., & Barnes, E. (2022) · Quantum 2.0 Conference and Exhibition · doi:10.1364/quantum.2022.qtu2a.15
Geometric graph-theoretic aspects of quantum stabilizer codes
Cafaro, C. (2022) · Physica Scripta · doi:10.1088/1402-4896/ac76ea
Report on scipost_202308_00029v1
Mesty\'an, M., Pozsgay, B., & Wanless, I. M. (2023) · SciPost Physics · doi:10.21468/scipost.report.8139
Report on scipost_202308_00029v1
Mesty\'an, M., Pozsgay, B., & Wanless, I. M. (2023) · SciPost Physics · doi:10.21468/scipost.report.8082
Shiraishi, K., Yamasaki, H., & Murao, M. (2024) · Physical Review A · doi:10.1103/physreva.110.052617
Universal Graph Theory Operations for Graph State Preparation
Cam, T., Gavoille, C., Borgne, Y. L., & Martiel, S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-97063-4_5
χ-colorable graph states: closed-form expressions and quantum orthogonal arrays
Revis, K.-R., Zakaryan, H., & Raissi, Z. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/adfe45
From Physical to Logical: Graph-State-Based Connectivity in Quantum Networks
Blanco, M. M., Fernández‐Veiga, M., Vilas, A. F., & Redondo, R. P. D. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00124
Bridging All-Photonic and Memory-Based Quantum Repeaters
Benchasattabuse, N., Hajdušek, M., & Meter, R. V. (2026) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2026.3653126
Localizable entanglement as an order parameter for measurement-induced phase transitions
Manna, S., Lakshminarayan, A., & Madhok, V. (2026) · Physical Review A · doi:10.1103/81zs-jht1
Improved Upper Bounds on Color Reversal by Local Inversions
Porte, K. S., Sandeep, R. B., & Santra, K. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-17156-6_32
Hartnett, G. S., Kielpinski, D., Maity, S., Mundada, P., Baum, Y., & Hush, M. (2026) · Physical Review A · doi:10.1103/c4v4-wz65 · Cited by 2
Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation
de Jesus, M., Hoefel, E., & Angelo, R. M. (2026) · Entropy · doi:10.3390/e28040386
Efficient construction of stabilizer codes via ZX-calculus
Wu, Z., Cheng, S., & Zeng, B. (2026) · Academia quantum. · doi:10.20935/acadquant8237
Multipartite communications over quantum networks
Meignant, C. (2021) · theses.fr (ABES) · doi:10.70675/3104b4a2z4773z4e41zb718zc3e93669f1aa
Hybrid variational quantum circuit approach for stabilizer-state classifiers
Aslam, H., & Holweck, F. (2026) · Physical Review A · doi:10.1103/tl4h-vs8y
Game-theoretic discovery of quantum error-correcting codes through Nash equilibria
Anonymous (2026) · Physical Review A · doi:10.1103/x1ph-v78g
Faster than MIP Decoding of Graph Codes with a Single Logical Qubit
Basak, N., & Paul, G. (2026) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl70331.2026.11668573
ZX-calculus for the working quantum computer scientist
van de Wetering, J. (2020) · arXiv · doi:10.48550/arxiv.2012.13966 · Cited by 68
Metadata
- Authors
- Van den Nest, M., Dehaene, J., & De Moor, B.
- Affiliations
- KU Leuven (BE)
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2004-02-24
- Volume
- 69
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2165148883
- Cited by
- 335
- References
- 8
- Citations by year
- 2026: 14 · 2025: 34 · 2024: 25 · 2023: 21 · 2022: 19 · 2021: 22 · 2020: 16 · 2019: 15 · 2018: 11 · 2017: 8 · 2016: 13 · 2015: 6 · 2014: 8 · 2013: 9 · 2012: 12
- FWCI
- 14.54
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- graph states, Clifford group, local unitary operations, graph transformation, quantum error correction, graph theory
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
