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
Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
Bacon, D., Chuang, I. L., & Harrow, A. W. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.170502 · Cited by 193
Deterministic Dicke-state preparation with continuous measurement and control
Stockton, J. K., van Handel, R., & Mabuchi, H. (2004) · Physical Review A · doi:10.1103/physreva.70.022106 · Cited by 160
On the CNOT-cost of TOFFOLI gates
Shende, V., & Markov, I. L. (2009) · Quantum Information and Computation · doi:10.5555/2011791.2011799 · Cited by 127
Finding cliques by quantum adiabatic evolution
Childs, A. M., Farhi, E., Goldstone, J., & Gutmann, S. (2002) · Quantum Information and Computation · doi:10.26421/qic2.3-1 · Cited by 81
Preparation of Dicke states in an ion chain
Hume, D. B., Chou, C. W., Rosenband, T., & Wineland, D. J. (2009) · Physical Review A · doi:10.1103/physreva.80.052302 · Cited by 80
Operational Determination of Multiqubit Entanglement Classes via Tuning of Local Operations
Bastin, T., Thiel, C., von Zanthier, J., Lamata, L., Solano, E., & Agarwal, G. S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.053601 · Cited by 63
Xiao, Y., Zou, X., & Guo, G. (2007) · Physical Review A · doi:10.1103/physreva.75.012310 · Cited by 63
A necessary and sufficient condition to play games in quantum mechanical settings
Özdemir, Ş. K., Shimamura, J., & Imoto, N. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/2/043 · Cited by 58
Quantum Data Compression of a Qubit Ensemble
Rozema, L. A., Mahler, D. H., Hayat, A., Turner, P. S., & Steinberg, A. M. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.160504 · Cited by 57
Shao, X., Chen, L., Zhang, S., Zhao, Y., & Yeon, K.-H. (2010) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/90/50003 · Cited by 54
Efficient compression of quantum information
Plesch, M., & Bužek, V. (2010) · Physical Review A · doi:10.1103/physreva.81.032317 · Cited by 49
Quantum Networks for Generating Arbitrary Quantum States
Mosca, M., & Kaye, P. (2001) · Optical Fiber Communication Conference and International Conference on Quantum Information · doi:10.1364/icqi.2001.pb28 · Cited by 46
QuantikzPreprint
Kay, A. (2018) · arXiv (Cornell University) · doi:10.17637/rh.7000520 · Cited by 42
Generation of Dicke states in the ultrastrong-coupling regime of circuit QED systems
Wu, C., Guo, C., Wang, Y., Wang, G., Feng, X., & Chen, J. (2017) · Physical Review A · doi:10.1103/physreva.95.013845 · Cited by 40
Generalized parity measurements
Ionicioiu, R., Popescu, A. E., Munro, W. J., & Spiller, T. P. (2008) · Physical Review A · doi:10.1103/physreva.78.052326 · Cited by 31
Reversible arithmetic coding for quantum data compression
Chuang, I. L., & Modha, D. S. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841192 · Cited by 27
Ivanov, S. S., Vitanov, N. V., & Korolkova, N. (2013) · New Journal of Physics · doi:10.1088/1367-2630/15/2/023039 · Cited by 26
Deterministic generation of arbitrary symmetric states and entanglement classes
Lamata, L., López, C. E., Lanyon, B. P., Bastin, T., Retamal, J. C., & Solano, E. (2013) · Physical Review A · doi:10.1103/physreva.87.032325 · Cited by 25
Quantum Networks for Generating Arbitrary Quantum StatesPreprint
Kaye, P., & Mosca, M. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0407102 · Cited by 17
Efficient quantum algorithms to construct arbitrary Dicke states
Chakraborty, K., Choi, B.-S., Maitra, A., & Maitra, S. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0797-8 · Cited by 10
Finding cliques by quantum adiabatic evolution
Childs, A. M., Farhi, E., Goldstone, J., & Gutmann, S. (2002) · Quantum Information and Computation · doi:10.26421/qic2.3 · Cited by 10
Diker, F. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.09290 · Cited by 5
All bipartitions of arbitrary Dicke statesPreprint
Moreno, G., & Parisio, F. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.00762 · Cited by 3
Efficient quantum algorithm to construct arbitrary Dicke statesPreprint
Chakraborty, K., Choi, B.-S., Maitra, A., & Maitra, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1209.5932 · Cited by 1
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
Noise resilience of variational quantum compiling
Sharma, K., Khatri, S., Cerezo, M., & Coles, P. J. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab784c · Cited by 196
Noise resilience of variational quantum compiling
Sharma, K., Khatri, S., Cerezo, M., & Coles, P. J. (2020) · Civil War Book Review · Cited by 184
Variational quantum state eigensolver
Cerezo, M., Sharma, K., Arrasmith, A., & Coles, P. J. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00611-6 · Cited by 174
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
Bartschi, A., & Eidenbenz, S. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00020 · Cited by 122
Self-citationThe Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
Cook, J., Eidenbenz, S., & Bärtschi, A. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00021 · Cited by 87
Self-citation
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
