The DOI matches its Crossref record; 34 of the 38 references it cites were found in a registry or an index.
Deterministic Preparation of Dicke States
Open accessOverview
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“For example, states with this property are Dicke states [54].”
From Towards violations of Local Friendliness with quantum computers (2025) · cites this paper as [54]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Assuming this is also a lower bound, the equal superposition of such a state and the all-zero state would have branch factor Ω(kn).”
From Towards violations of Local Friendliness with quantum computers (2025) · cites this paper as [54]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Then, for δ = 1, assuming the asymptotic upper bound of the circuit complexity in [54] is also a lower bound C I ≥ Ω(n 2 ), C D = O(1), and B = Ω(n 2 ),”
From Towards violations of Local Friendliness with quantum computers (2025) · cites this paper as [54]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“In [54], they show quantum circuits with circuit complexity O(kn).”
From Towards violations of Local Friendliness with quantum computers (2025) · cites this paper as [54]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Then for δ = 1 [53] C I ≥ 4 n /9 -n/3 -1/9, C D ≤ n, and B ≥ 4 n /9 -4n/3 -1/9, (10 ) with high probability”
From Towards violations of Local Friendliness with quantum computers (2025) · cites this paper as [53]
Experimental — accuracy not yet measured
In the citing paper
“This state is non-trivial to implement, as it requires a circuit with O(N) two-qubit gate depth41.”
From Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer (2022) · cites this paper as [41]
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
Coherence in Spontaneous Radiation Processes
Dicke, R. H. (1954) · Physical Review · doi:10.1103/physrev.93.99 · Cited by 7,445
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Three qubits can be entangled in two inequivalent ways
Dür, W., Vidal, G., & Cirac, J. I. (2000) · Physical Review A · doi:10.1103/physreva.62.062314 · Cited by 3,384
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789
Synthesis of quantum-logic circuits
Shende, V., Bullock, S. S., & Markov, I. L. (2006) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2005.855930 · Cited by 786
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Multipartite entanglement and high-precision metrology
Tóth, G. (2012) · Physical Review A · doi:10.1103/physreva.85.022322 · Cited by 560
Experimental Realization of Dicke States of up to Six Qubits for Multiparty Quantum Networking
Prevedel, R., Cronenberg, G., Tame, M. S., Paternostro, M., Walther, P., Kim, M. S., & Zeilinger, A. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.020503 · Cited by 301
Experimental Entanglement of a Six-Photon Symmetric Dicke State
Wieczorek, W., Krischek, R., Kiesel, N., Michelberger, P., Tóth, G., & Weinfurter, H. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.020504 · Cited by 290
Experimental Observation of Four-Photon Entangled Dicke State with High Fidelity
Kiesel, N., Schmid, C., Tóth, G., Solano, E., & Weinfurter, H. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.063604 · Cited by 262
Research works printed but not linked: 1
- Bärtschi, A., Eidenbenz, S.: Deterministic Preparation of Dicke States. arXiv e-prints, April 2019. https://arxiv.org/abs/1904.07358 · arXiv
Cited by
Sorted by citations
Items 101–122 of 122
Grigoryan, A. M., Gomez, A. A., Espinoza, I., & Agaian, S. С. (2025) · Information · doi:10.3390/info16060466 · Cited by 1
A dynamical algebra of protocol-induced transformations on Dicke states
Bernard, P.-A., & Vinet, L. (2025) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2024.0415 · Cited by 1
An Optimum Algorithm for Quantum SearchPreprint
Liu, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.03949 · Cited by 1
Efficient classical algorithms for simulating symmetric quantum systemsPreprint
Anschuetz, E. R., Bauer, A., Kiani, B. T., & Lloyd, S. (2022) · arXiv (Cornell University) · doi:10.17169/refubium-41788 · Cited by 1
Towards violations of Local Friendliness with quantum computers
Zeng, W. J., Labib, F., & Russo, V. (2025) · Quantum · doi:10.22331/q-2025-09-05-1851
“For example, states with this property are Dicke states [54].”
InfluentialThe Black Hole Information Paradox SolvedPreprint
Wilson, J. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4835028
The black hole paradox solvedPreprint
Wilson, J. J. (2024) · doi:10.31219/osf.io/wsrpa
Variational quantum algorithm for designing quantum information maskers*
Li, J., Wang, M., & Zhou, B. (2024) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ad89ac
Dhara, B., Agrawal, M., & Roy, S. D. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10457
MPS Stability and the Intersection Property
Garre-Rubio, J., Turzillo, A., & Molnár, A. (2025) · Annales Henri Poincaré · doi:10.1007/s00023-025-01650-3
Expanding a 4-qubit Dicke state to a 5-qubit Dicke state with limited qubit access
Thapa, B., Moran, O., Vu, D. D., & Özaydin, F. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-05021-z · Cited by 2
The Divided-QUBO-Based Quantum Algorithm for Optimal Wireless Link Scheduling
Ruan, Y., Chen, P., Yang, Z., Zhao, W., Tang, F., Liu, Z., & Kato, N. (2025) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2025.3630066
Rhodes, N., Spiers, S., Bùi, H. T., Srikumar, M., Kulkarni, S., Loxton, R., & Egan, M. (2025) · IEEE International Conference on Industrial Engineering and Engineering Management · doi:10.1109/ieem63636.2025.11357835
Solving the k-Hitting Set Problem with Dicke State Quantum Search
Jiang, J. (2026) · IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE) · doi:10.3390/engproc2026134038
W-State Leader Election for PBFT Based Quantum Leader Election
Meza, J. P. R., Mišić, J., & Mišić, V. B. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00182
Dicke-State-Initialized Grover’s Algorithm for Solving the Hitting Set Problem
Jiang, J., & Lin, Q.-Y. (2026) · IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE) · doi:10.3390/engproc2026134094
Quantum Walks for Collision-Based Information Set Decoding
Perriello, S., Barenghi, A., & Pelosi, G. (2026) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3801487.3801826
Spin‐sU(1)‐Eigenstate Preparation
Harofteh, N. Z., & Nepomechie, R. I. (2026) · Annalen der Physik · doi:10.1002/andp.70239
Quantum Key Search Algorithms under Side-channel AttackPreprint
Yang, Y., Shi, J., Zhang, H., Li, H., Fu, X., Yang, Y., Zhu, Y., & Zhou, Y. (2026) · Research Square · doi:10.21203/rs.3.rs-10245840/v1
Gajula, K. K., & Karnewar, S. (2026) · QP-AIDSE · doi:10.65713/qpv2i122
Quantum Exhaustive Search for Assignment Problems in NAFD Cell-Free Networks Using Dicke States
Kotani, A., Ichikawa, M., Ishikawa, N., & Ishibashi, K. (2026) · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) · doi:10.1109/pimrc69400.2026.11711769
QDoctor: Probe-Based Testing for Quantum Programs
WANG, Q. F., Xia, S., Guo, X., & Zhao, J. (2026) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1145/3832783.3837488
Metadata
- Authors
- Bärtschi, A., & Eidenbenz, S.
- Affiliations
- Los Alamos National Laboratory (US)
- Corresponding author
- Bärtschi, Andreas
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2019
- Pages
- 126-139
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2937696121
- Cited by
- 127
- References
- 38
- Citations by year
- 2026: 17 · 2025: 28 · 2024: 25 · 2023: 18 · 2022: 16 · 2021: 13 · 2020: 10
- FWCI
- 3.65
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Lecture notes in computer science (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. Department of Energy (#89233218CNA000001)
- National Nuclear Security Administration (89233218C-NA000001)
- Laboratory Directed Research and Development (89233218CNA000001)
- Los Alamos National Laboratory (89233218CNA 000001)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- Dicke states, quantum circuits, entangled states, combinatorial optimization, quantum circuit depth, quantum information compression, Hamming weight
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
