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
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-citationEmbedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies
Zbinden, S., Bärtschi, A., Djidjev, H. N., & Eidenbenz, S. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-50743-5_10 · Cited by 76
Self-citationConstrained quantum optimization for extractive summarization on a trapped-ion quantum computer
Niroula, P., Shaydulin, R., Yalovetzky, R., Minssen, P., Herman, D., Hu, S., & Pistoia, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-20853-w · Cited by 59
Error mitigation for variational quantum algorithms through mid-circuit measurements
Botelho, L., Glos, A., Kundu, A., Miszczak, J. A., Salehi, Ö., & Zimborás, Z. (2022) · Physical Review A · doi:10.1103/physreva.105.022441 · Cited by 65
Fast Multiqubit Gates through Simultaneous Two-Qubit Gates
Gu, X. Q., Fernández-Pendás, J., Vikstål, P., Abad, T., Warren, C., Bengtsson, A., Tancredi, G., Shumeiko, V. S., Bylander, J., Johansson, G., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040348 · Cited by 49
A Divide-and-Conquer Approach to Dicke State Preparation
Aktar, S., Bärtschi, A., Badawy, A. A., & Eidenbenz, S. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3174547 · Cited by 47
Self-citationShort-Depth Circuits for Dicke State Preparation
Bärtschi, A., & Eidenbenz, S. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00027 · Cited by 43
Self-citationPreparing Bethe Ansatz Eigenstates on a Quantum Computer
Dyke, J. S. V., Barron, G. S., Mayhall, N. J., Barnes, E., & Economou, S. E. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040329 · Cited by 44
Quantum algorithm for persistent Betti numbers and topological data analysis
Hayakawa, R. (2022) · Quantum · doi:10.22331/q-2022-12-07-873 · Cited by 40
Preparing Dicke States on a Quantum Computer
Mukherjee, C. S., Maitra, S., Gaurav, V., & Roy, D. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3041479 · Cited by 38
State preparation by shallow circuits using feed forward
Buhrman, H., Folkertsma, M., Loff, B., & Neumann, N. M. P. (2024) · Quantum · doi:10.22331/q-2024-12-09-1552 · Cited by 35
Preparing Dicke states in a spin ensemble using phase estimation
Wang, Y., & Terhal, B. M. (2021) · Physical Review A · doi:10.1103/physreva.104.032407 · Cited by 31
Universal programmable photonic architecture for quantum information processing
Bartlett, B., & Fan, S. (2020) · Physical Review A · doi:10.1103/physreva.101.042319 · Cited by 31
Threshold-Based Quantum Optimization
Golden, J. K., Bärtschi, A., O’Malley, D., & Eidenbenz, S. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00030 · Cited by 33
Self-citationPreparing exact eigenstates of the open XXZ chain on a quantum computer
Dyke, J. S. V., Barnes, E., Economou, S. E., & Nepomechie, R. I. (2021) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac4640 · Cited by 31
Efficient classical algorithms for simulating symmetric quantum systems
Anschuetz, E. R., Bauer, A., Kiani, B. T., & Lloyd, S. (2023) · Quantum · doi:10.22331/q-2023-11-28-1189 · Cited by 28
Entanglement in highly symmetric multipartite quantum states
Burchardt, A., Czartowski, J., & Życzkowski, K. (2021) · Physical Review A · doi:10.1103/physreva.104.022426 · Cited by 25
Permutation-invariant quantum coding for quantum deletion channels
Ouyang, Y. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518078 · Cited by 31
Implementing Graph-Theoretic Feature Selection by Quantum Approximate Optimization Algorithm
Li, Y., Zhou, R., Xu, R., Luo, J., Hu, W., & Fan, P. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3190042 · Cited by 28
Quantum approximate optimization for combinatorial problems with constraints
Ruan, Y., Yuan, Z., Xue, X., & Liu, Z. (2022) · Information Sciences · doi:10.1016/j.ins.2022.11.020 · Cited by 28
Golden, J. K., Bärtschi, A., O’Malley, D., & Eidenbenz, S. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00063 · Cited by 42
Self-citationPreparing quantum many-body scar states on quantum computers
Gustafson, E., Li, A. C. Y., Khan, A., Kim, J., Kürkçüog̃lu, D. M., Alam, M. S., Orth, P. P., Rahmani, A., & Iadecola, T. (2023) · Quantum · doi:10.22331/q-2023-11-07-1171 · Cited by 25
Data re-uploading with a single qudit
Wach, N. L., Rudolph, M. S., Jendrzejewski, F., & Schmitt, S. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00125-0 · Cited by 19
Low-rank density-matrix evolution for noisy quantum circuits
Chen, Y.-T., Farquhar, C., & Parrish, R. M. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00392-4 · Cited by 24
Polylogarithmic-depth controlled-NOT gates without ancilla qubits
Claudon, B., Zylberman, J., Feniou, C., Debbasch, F., Peruzzo, A., & Piquemal, J. (2024) · Nature Communications · doi:10.1038/s41467-024-50065-x · Cited by 28
Efficient implementation of arbitrary two-qubit gates using unified control
Chen, Z., Liu, W., Ma, Y., Sun, W., Wang, R., Wang, H., Xu, H., Xue, G., Yan, H., Yang, Z., et al. (2025) · Nature Physics · doi:10.1038/s41567-025-02990-x · Cited by 17
Interplay between transport and quantum coherences in free fermionic systems
Jin, T., Gautié, T., Krajenbrink, A., Ruggiero, P., & Yoshimura, T. (2021) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac20ef · Cited by 18
Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers
Carbone, A., Galli, D. E., Motta, M., & Jones, B. (2022) · Symmetry · doi:10.3390/sym14030624 · Cited by 18
A Complete Quantum Circuit to Solve the Information Set Decoding Problem
Perriello, S., Barenghi, A., & Pelosi, G. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00056 · Cited by 19
Finding Small and Large $k$-Clique Instances on a Quantum Computer
Metwalli, S. A., Gall, F. L., & Meter, R. V. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3045692 · Cited by 16
Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
Bakó, B., Glos, A., Salehi, Ö., & Zimborás, Z. (2025) · Quantum · doi:10.22331/q-2025-03-20-1663 · Cited by 32
Parity Quantum Optimization: Encoding Constraints
Drieb-Schön, M., Ender, K., Javanmard, Y., & Lechner, W. (2023) · Quantum · doi:10.22331/q-2023-03-17-951 · Cited by 25
QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computersPreprint
Mesman, K. J., Al-Ars, Z., & Möller, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.17193 · Cited by 38
Raveh, D., & Nepomechie, R. I. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad1ea4 · Cited by 14
Deterministic Bethe state preparation
Raveh, D., & Nepomechie, R. I. (2024) · Quantum · doi:10.22331/q-2024-10-24-1510 · Cited by 16
Exploring light-cone distribution amplitudes from quantum computing
Li, T., Guo, X., Lai, W. K., Liu, X., Wang, E., Xing, H., Zhang, D.-B., & Zhu, S.-L. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-023-2120-1 · Cited by 13
Optimizing Initial State of Detector Sensors in Quantum Sensor Networks
Zhan, C., Gupta, H., & Hillery, M. S. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3655028 · Cited by 13
Marti-Dafcik, D., Burton, H. G. A., & Tew, D. P. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013191 · Cited by 20
Mixer-phaser Ansätze for quantum optimization with hard constraints
LaRose, R., Rieffel, E. G., & Venturelli, D. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00069-x · Cited by 18
Efficient Preparation of Dicke States
Yu, J., Muleady, S. R., Wang, Y.-X., Schine, N., Gorshkov, A. V., & Childs, A. M. (2025) · Physical Review Letters · doi:10.1103/9gjk-rgql · Cited by 12
Nepomechie, R. I., & Raveh, D. (2024) · Quantum Information and Computation · doi:10.26421/qic24.1-2-2 · Cited by 12
Quantum Speedup of the Dispersion and Codebook Design Problems
Yukiyoshi, K., Mikuriya, T., Rou, H. S., de Abreu, G. T. F., & Ishikawa, N. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3450852 · Cited by 12
Kasai, H., Takeuchi, Y., Hakoshima, H., Matsuzaki, Y., & 都倉, 康. (2022) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.91.074005 · Cited by 12
Symmetric quantum states: a review of recent progress
Marconi, C., Müller-Rigat, G., Romero-Pallejà, J., Tura, J., & Sanpera, A. (2026) · Reports on Progress in Physics · doi:10.1088/1361-6633/ae440a · Cited by 28
JuliQAOA: Fast, Flexible QAOA Simulation
Golden, J. K., Bärtschi, A., O’Malley, D., Pelofske, E., & Eidenbenz, S. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3624062.3624220 · Cited by 11
Self-citationState Preparation of Antisymmetrized Geminal Power on a Quantum Computer without Number Projection
Khamoshi, A., Dutta, R., & Scuseria, G. E. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c00525 · Cited by 11
Permutation-Invariant Quantum Codes With Transversal Generalized Phase Gates
Kubischta, E., & Teixeira, I. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3487964 · Cited by 26
The fastest generation of multipartite entanglement with natural interactions
Cieśliński, P., Kłobus, W., Kurzyński, P., Paterek, T., & Laskowski, W. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acf953 · Cited by 9
A Quantum Circuit to Speed-Up the Cryptanalysis of Code-Based Cryptosystems
Perriello, S., Barenghi, A., & Pelosi, G. (2021) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-90022-9_25 · Cited by 11
Universal Control of Symmetric States Using Spin Squeezing
Gutman, N., Gorlach, A. A., Tziperman, O., Ruimy, R., & Kaminer, I. E. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.153601 · Cited by 14
Spin‐s$s$ Dicke States and Their Preparation
Nepomechie, R. I., Ravanini, F., & Raveh, D. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400057 · Cited by 8
Efficient Preparation of Entangled States in Cavity QED with Grover’s Algorithm
Nagib, O., Saffman, M. E., & Mølmer, K. (2025) · Physical Review Letters · doi:10.1103/3fzf-wsr2 · Cited by 8
Quantum Telecloning on NISQ Computers
Pelofske, E., Bärtschi, A., Garcia, B., Kiefer, B., & Eidenbenz, S. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00083 · Cited by 8
Self-citationMovassagh, R., & Ouyang, Y. (2024) · Quantum · doi:10.22331/q-2024-11-27-1541 · Cited by 9
Probing Quantum Telecloning on Superconducting Quantum Processors
Pelofske, E., Bärtschi, A., Eidenbenz, S., Garcia, B., & Kiefer, B. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3391654 · Cited by 8
Self-citationA Novel Approach to State-to-State Transformation in Quantum Computing
Grigoryan, A. M., Gomez, A. A., & Agaian, S. С. (2025) · Information · doi:10.3390/info16080689 · Cited by 5
Quantum Circuit Design for the Lee-Brickell Based Information Set Decoding
Perriello, S., Barenghi, A., & Pelosi, G. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-61489-7_2 · Cited by 5
Fast preparation of Dicke state by shortcuts to adiabatic passages
Wang, C. Q., Ji, Y., Zhang, W. Y., Wang, J., Zhang, Z., Liu, Y. L., Dong, L., & Xiu, X. (2024) · Results in Physics · doi:10.1016/j.rinp.2024.107868 · Cited by 5
Quantum State Preparation Using an Exact CNOT Synthesis Formulation
Wang, H., Cong, J., & Micheli, G. D. (2024) · Design, Automation, and Test in Europe · doi:10.23919/date58400.2024.10546633 · Cited by 5
A novel quantum algorithm for converting between one-hot and binary encodings
Chen, B., Wu, H.-Q., Yuan, H., Wu, L., & Li, X. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04403-z · Cited by 9
New Permutation-Free Quantum Circuits for Implementing 3- and 4-Qubit Unitary Operations
Grigoryan, A. M. (2025) · Information · doi:10.3390/info16070621 · Cited by 4
Clifford orbits from cayley graph quotients
Keeler, C. A., Munizzi, W., & Pollack, J. (2024) · Quantum Information and Computation · doi:10.26421/qic24.1-2-1 · Cited by 7
Hardware-efficient preparation of architecture-specific graph states on near-term quantum computers
Brandhofer, S., Polian, I., Barz, S., & Bhatti, D. (2025) · Scientific Reports · doi:10.1038/s41598-024-82715-x · Cited by 5
Sharma, A., & Tulapurkar, A. A. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03063-7 · Cited by 4
Hybrid Decoding – Classical-Quantum Trade-Offs for Information Set Decoding
Esser, A., Ramos-Calderer, S., Bellini, E., Latorre, J. I., & Manzano, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-17234-2_1 · Cited by 4
Jentschura, U. D., & Adhikari, C. M. (2023) · Atoms · doi:10.3390/atoms11010010 · Cited by 4
Succinct Quantum Testers for Closeness and k-Wise Uniformity of Probability Distributions
Luo, J., Wang, Q., & Li, L. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3393756 · Cited by 12
The Asymptotic Induced Matching Number of Hypergraphs: Balanced Binary Strings
Arunachalam, S., Vrana, P., & Zuiddam, J. (2020) · The Electronic Journal of Combinatorics · doi:10.37236/9019 · Cited by 4
On Actual Preparation of Dicke State on a Quantum ComputerPreprint
Mukherjee, C. S., Maitra, S., Gaurav, V., & Roy, D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.01681 · Cited by 4
Dicke State Quantum Search for Solving the Vertex Cover Problem
Jiang, J. (2025) · Mathematics · doi:10.3390/math13183005 · Cited by 4
Quantum Algorithm for Mining Frequent Patterns for Association Rule Mining
Alasow, A., & Perkowski, M. A. (2023) · Journal of Quantum Information Science · doi:10.4236/jqis.2023.131001 · Cited by 3
Roncallo, S., Maccone, L., & Macchiavello, C. (2023) · AVS Quantum Science · doi:10.1116/5.0177905 · Cited by 3
Scalable Experimental Bounds for Dicke and GHZ States Fidelities
Aktar, S., Badawy, A. A., Bärtschi, A., & Eidenbenz, S. (2023) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3587135.3592197 · Cited by 3
Self-citationQuantum Circuit Complexity of Genomic Data Encoding
Ye, O., & Strelchuk, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10439 · Cited by 2
Improving Grover’s Algorithm with Dicke States
Jiang, J., & Lin, Q.-Y. (2025) · IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan) · doi:10.1109/icce-taiwan66881.2025.11207978 · Cited by 2
Dicke subsystems are entangled
Szalay, S., & Nyári, P. (2025) · Quantum · doi:10.22331/q-2025-11-06-1908 · Cited by 2
The Lie algebra of XY-mixer topologies and warm starting QAOA for constrained optimization
Kordonowy, S., & Leipold, H. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01192-4 · Cited by 3
Low-Depth Quantum Symmetrization
Liu, Z., Childs, A. M., & Gottesman, D. (2026) · Physical Review X · doi:10.1103/9qhy-ms2y · Cited by 4
Efficient sparse state preparation via quantum walks
Gonzales, A., Herrman, R., Campbell, C., Gaidai, I., Liu, J., Tomesh, T., & Saleem, Z. H. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01093-y · Cited by 5
Hybrid spin-phonon architecture for scalable solid-state quantum nodes
Peng, R., Wu, X., Wang, Y., Zhang, J., Geng, J., Dasari, D. B. R., Cleland, A. N., & Wrachtrup, J. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01138-2 · Cited by 3
Optimized Telecloning Circuits: Theory and Practice of Nine NISQ Clones
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2022) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc57508.2022.00009 · Cited by 3
Self-citationLayout-Aware Quantum Circuitry and Algorithmic Extensions to Grover's Algorithm
Al-Bayaty, A. (2025) · doi:10.15760/etd.3924 · Cited by 2
Robust quantum circuit for clique problem with intermediate qudits
Sanyal, A., Saha, A., Saha, B., & Chakrabarti, A. (2023) · Nano Communication Networks · doi:10.1016/j.nancom.2023.100466 · Cited by 1
Bases for optimising stabiliser decompositions of quantum states
de Silva, N., Yin, M., & Strelchuk, S. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad53fc · Cited by 1
Quadratic Advantage with Quantum Randomized Smoothing Applied to Time-Series Analysis
Franco, N., Kempkes, M., Spiegelberg, J., & Lorenz, J. M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00042 · Cited by 1
Grover Adaptive Search With Spin Variables
Fujiwara, S., & Ishikawa, N. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3595910 · Cited by 1
Multiclass portfolio optimization via variational quantum Eigensolver with Dicke state ansatz
Scursulim, J. V. S., Langeloh, G. M., Beltran, V. L., & Brito, S. (2026) · Scientific Reports · doi:10.1038/s41598-026-36333-4 · Cited by 4
Simple Ways of Preparing Qudit Dicke States
Kerzner, N. B., Galeazzi, F., & Nepomechie, R. I. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0036 · Cited by 1
End-to-end quantum algorithm for topology optimization in structural mechanics
Hölscher, L., Ahrend, O., Karch, L., L'Estocq, C., Marfany, M. A., Stollenwerk, T., Wilhelm, F. K., & Kowalski, J. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae4cfe · Cited by 2
Quantum Circuit Design for Decoded Quantum Interferometry
Patamawisut, N., Benchasattabuse, N., Hajdušek, M., & Meter, R. V. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00041 · Cited by 1
Entropic analysis of non-separability in noisy Dicke states
Nawareg, M. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04994-1 · Cited by 1
Quantum-Assisted Maximum Likelihood Detection of Generalized Spatial Modulation
Mikuriya, T., Rou, H. S., de Abreu, G. T. F., Ishibashi, K., & Ishikawa, N. (2025) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2025-fall65116.2025.11310105 · Cited by 1
Efficient Preparation of Cyclic Quantum States
Mozafari, F., Yang, Y., & Micheli, G. D. (2022) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac52403.2022.9712522 · Cited by 1
Optimizing quantum codes with an application to the loss channel with partial erasure information
Desef, B., & Plenio, M. B. (2022) · Quantum · doi:10.22331/q-2022-03-11-667 · Cited by 5
Scalable Experimental Bounds for Entangled Quantum State Fidelities
Aktar, S., Bärtschi, A., Badawy, A. A., & Eidenbenz, S. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3700885 · Cited by 1
Self-citationReducing the Number of Qubits in Solving LWE
Benedikt, B. J. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-86602-9_9 · Cited by 1
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
