- Physical Review Journals
All JournalsPhysics Magazine
Access Provided by Xinjiang University

Physical Review Applied

Export citation

Export citation

Choose format for download:

Download Citation
  • Access by Xinjiang University

Reducing circuit depth in quantum state preparation for quantum simulation using measurements and feedforward

Hyeonjun Yeo1,*, Ha Eum Kim2,3, IlKwon Sohn4, and Kabgyun Jeong5,6,†

  • *Contact author: duguswns11@snu.ac.kr
  • †Contact author: kgjeong6@snu.ac.kr
PDF

Phys. Rev. Applied 23, 054066 – Published 27 May, 2025

DOI: https://doi.org/10.1103/PhysRevApplied.23.054066

Abstract

Reducing circuit depth and identifying an optimal trade-off between circuit depth and width is crucial for successful quantum computation. In this context, midcircuit measurement and feedforward have been shown to significantly reduce the depth of quantum circuits, particularly in implementing logical gates. By leveraging these techniques, we propose several parallelization strategies that reduce quantum circuit depth at the expense of increasing width in preparing various quantum states relevant to quantum simulation. With measurements and feedforward, we demonstrate that utilizing unary encoding as a bridge between two quantum states substantially reduces the circuit depth required for preparing quantum states, such as sparse quantum states and sums of Slater determinants within the first quantization framework, while maintaining an efficient circuit width. Additionally, we show that a Bethe wave function, characterized by its high degree of freedom in its phase, can be probabilistically prepared in a constant-depth quantum circuit using measurements and feedforward. We anticipate that our study will contribute to the reduction of circuit depth in initial state preparation, particularly for quantum simulation, which is a critical step toward achieving quantum advantage.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (95)

  1. L. Piroli, G. Styliaris, and J. I. Cirac, Quantum circuits assisted by local operations and classical communication: Transformations and phases of matter, Phys. Rev. Lett. 127, 220503 (2021).
  2. T.-C. Lu, L. A. Lessa, I. H. Kim, and T. H. Hsieh, Measurement as a shortcut to long-range entangled quantum matter, PRX Quantum 3, 040337 (2022).
  3. K. C. Smith, A. Khan, B. K. Clark, S. Girvin, and T.-C. Wei, Constant-depth preparation of matrix product states with adaptive quantum circuits, PRX Quantum 5, 030344 (2024).
  4. M. Foss-Feig, A. Tikku, T.-C. Lu, K. Mayer, M. Iqbal, T. M. Gatterman, J. A. Gerber, K. Gilmore, D. Gresh, A. Hankin, et al., Experimental demonstration of the advantage of adaptive quantum circuits, ArXiv:2302.03029.
  5. E. Bäumer, V. Tripathi, D. S. Wang, P. Rall, E. H. Chen, S. Majumder, A. Seif, and Z. K. Minev, Efficient long-range entanglement using dynamic circuits, PRX Quantum 5, 030339 (2024).
  6. D. Malz, G. Styliaris, Z.-Y. Wei, and J. I. Cirac, Preparation of matrix product states with log-depth quantum circuits, Phys. Rev. Lett. 132, 040404 (2024).
  7. S. Bravyi, I. Kim, A. Kliesch, and R. Koenig, Adaptive constant-depth circuits for manipulating non-Abelian anyons, ArXiv:2205.01933.
  8. N. Tantivasadakarn, A. Vishwanath, and R. Verresen, Hierarchy of topological order from finite-depth unitaries, measurement, and feedforward, PRX Quantum 4, 020339 (2023).
  9. G. Boyd, Low-overhead parallelisation of LCU via commuting operators, ArXiv:2312.00696.
  10. C. Gidney and N. C. Jones, A CCCZ gate performed with 6 T gates, ArXiv:2106.11513.
  11. T. Kim, K. Baek, Y. Hwang, and J. Bang, Resource-compact time-optimal quantum computation, ArXiv:2405.00191.
  12. K. C. Smith, E. Crane, N. Wiebe, and S. M. Girvin, Deterministic constant-depth preparation of the AKLT state on a quantum processor using fusion measurements, PRX Quantum 4, 020315 (2023).
  13. L. Piroli, G. Styliaris, and J. I. Cirac, Approximating many-body quantum states with quantum circuits and measurements, Phys. Rev. Lett. 133, 230401 (2024).
  14. D. Gottesman and I. L. Chuang, Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations, Nature 402, 390 (1999).
  15. R. Jozsa, An introduction to measurement based quantum computation, NATO Science Series, III: Computer and Systems Sciences. Quantum Information Processing-From Theory to Experiment 199, 137 (2006).
  16. G. H. Low, V. Kliuchnikov, and L. Schaeffer, Trading T gates for dirty qubits in state preparation and unitary synthesis, Quantum 8, 1375 (2024).
  17. H. Buhrman, M. Folkertsma, B. Loff, and N. M. P. Neumann, State preparation by shallow circuits using feed forward, Quantum 8, 1552 (2024).
  18. P. Høyer and R. Špalek, Quantum fan-out is powerful, Theory Comput. 1, 81 (2005).
  19. Y. Takahashi and S. Tani, Collapse of the hierarchy of constant-depth exact quantum circuits, Comput. Complex. 25, 849 (2016).
  20. A. Y. Kitaev, Quantum measurements and the Abelian stabilizer problem, ArXiv:quant-ph/9511026.
  21. D. S. Abrams and S. Lloyd, Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors, Phys. Rev. Lett. 83, 5162 (1999).
  22. Y. Dong, L. Lin, and Y. Tong, Ground-state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices, PRX Quantum 3, 040305 (2022).
  23. G. Wang, D. S. França, R. Zhang, S. Zhu, and P. D. Johnson, Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision, Quantum 7, 1167 (2023).
  24. J. Romero, R. Babbush, J. R. McClean, C. Hempel, P. J. Love, and A. Aspuru-Guzik, Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz, Quantum Sci. Technol. 4, 014008 (2018).
  25. S. Fomichev, K. Hejazi, M. S. Zini, M. Kiser, J. Fraxanet, P. A. M. Casares, A. Delgado, J. Huh, A.-C. Voigt, J. E. Mueller, and J. M. Arrazola, Initial state preparation for quantum chemistry on quantum computers, PRX Quantum 5, 040339 (2024).
  26. T. Albash and D. A. Lidar, Adiabatic quantum computation, Rev. Mod. Phys. 90, 015002 (2018).
  27. S. Ebadi, T. T. Wang, H. Levine, A. Keesling, G. Semeghini, A. Omran, D. Bluvstein, R. Samajdar, H. Pichler, W. W. Ho, et al., Quantum phases of matter on a 256-atom programmable quantum simulator, Nature 595, 227 (2021).
  28. I. Čepaitė, A. Polkovnikov, A. J. Daley, and C. W. Duncan, Counterdiabatic optimized local driving, PRX Quantum 4, 010312 (2023).
  29. D. van Vreumingen and K. Schoutens, Adiabatic ground-state preparation of fermionic many-body systems from a two-body perspective, Phys. Rev. A 108, 062603 (2023).
  30. C. Mc Keever and M. Lubasch, Towards adiabatic quantum computing using compressed quantum circuits, PRX Quantum 5, 020362 (2024).
  31. X.-M. Zhang, T. Li, and X. Yuan, Quantum state preparation with optimal circuit depth: Implementations and applications, Phys. Rev. Lett. 129, 230504 (2022).
  32. X.-M. Zhang and X. Yuan, Circuit complexity of quantum access models for encoding classical data, npj Quantum Inf. 10, 42 (2024).
  33. S. Sahu and G. Vidal, Fractal decompositions and tensor network representations of Bethe wavefunctions, ArXiv:2412.00923.
  34. H. Bethe, Zur theorie der metalle: I. Eigenwerte und eigenfunktionen der linearen atomkette, Z. Phys. 71, 205 (1931).
  35. T. Giamarchi, Quantum Physics in One Dimension (Clarendon Press, Oxford, 2003), Vol. 121.
  36. S. J. van Tongeren, Introduction to the thermodynamic Bethe ansatz, J. Phys. A: Math. Theor. 49, 323005 (2016).
  37. N. A. Slavnov, Algebraic Bethe ansatz, ArXiv:1804.07350.
  38. B. T. Gard, L. Zhu, G. S. Barron, N. J. Mayhall, S. E. Economou, and E. Barnes, Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm, npj Quantum Inf. 6, 10 (2020).
  39. J. S. Van Dyke, G. S. Barron, N. J. Mayhall, E. Barnes, and S. E. Economou, Preparing Bethe ansatz eigenstates on a quantum computer, PRX Quantum 2, 040329 (2021).
  40. W. Li, M. Okyay, and R. I. Nepomechie, Bethe states on a quantum computer: Success probability and correlation functions, J. Phys. A: Math. Theor. 55, 355305 (2022).
  41. D. Raveh and R. I. Nepomechie, Deterministic Bethe state preparation, Quantum 8, 1510 (2024).
  42. R. M. Farias, T. O. Maciel, G. Camilo, R. Lin, S. Ramos-Calderer, and L. Aolita, Quantum encoder for fixed-Hamming-weight subspaces, Phys. Rev. Appl. 23, 044014 (2025).
  43. A. Sopena, M. H. Gordon, D. García-Martín, G. Sierra, and E. López, Algebraic Bethe circuits, Quantum 6, 796 (2022).
  44. R. Ruiz, A. Sopena, M. H. Gordon, G. Sierra, and E. López, The Bethe ansatz as a quantum circuit, Quantum 8, 1356 (2024).
  45. R. Ruiz, A. Sopena, E. López, G. Sierra, and B. Pozsgay, Bethe ansatz, quantum circuits, and the F-basis, ArXiv:2411.02519.
  46. R. Ruiz, A. Sopena, B. Pozsgay, and E. López, Efficient eigenstate preparation in an integrable model with Hilbert space fragmentation, ArXiv:2411.15132.
  47. J. Luo and L. Li, Circuit complexity of sparse quantum state preparation, ArXiv:2406.16142.
  48. W. Zi, J. Nie, and X. Sun, Constant-depth quantum circuits for arbitrary quantum state preparation via measurement and feedback, ArXiv:2503.16208.
  49. D. W. Berry, M. Kieferová, A. Scherer, Y. R. Sanders, G. H. Low, N. Wiebe, C. Gidney, and R. Babbush, Improved techniques for preparing eigenstates of fermionic Hamiltonians, npj Quantum Inf. 4, 22 (2018).
  50. E. Bäumer and S. Woerner, Measurement-based long-range entangling gates in constant depth, Phys. Rev. Res. 7, 023120 (2025).
  51. M. Weigold, J. Barzen, F. Leymann, and M. Salm, in Proceedings of the 27th Conference on Pattern Languages of Programs (Association for Computing Machinery, New York, 2020), p. 1.
  52. S. Ramos-Calderer, A. Pérez-Salinas, D. García-Martín, C. Bravo-Prieto, J. Cortada, J. Planagumà, and J. I. Latorre, Quantum unary approach to option pricing, Phys. Rev. A 103, 032414 (2021).
  53. S. Johri, S. Debnath, A. Mocherla, A. SINGK, A. Prakash, J. Kim, and I. Kerenidis, Nearest centroid classification on a trapped ion quantum computer, npj Quantum Inf. 7, 122 (2021).
  54. I. Kerenidis, J. Landman, and N. Mathur, Classical and quantum algorithms for orthogonal neural networks, ArXiv:2106.07198.
  55. I. Kerenidis and A. Prakash, Quantum machine learning with subspace states, ArXiv:2202.00054.
  56. H. Zhang, L. Wan, S. Ramos-Calderer, Y. Zhan, W.-K. Mok, H. Cai, F. Gao, X. Luo, G.-Q. Lo, L. C. Kwek, et al., Efficient option pricing with a unary-based photonic computing chip and generative adversarial learning, Photonics Res. 11, 1703 (2023).
  57. R. Mao, G. Tian, and X. Sun, Toward optimal circuit size for sparse quantum state preparation, Phys. Rev. A 110, 032439 (2024).
  58. D. Ramacciotti, A. I. Lefterovici, and A. F. Rotundo, Simple quantum algorithm to efficiently prepare sparse states, Phys. Rev. A 110, 032609 (2024).
  59. R. Vale, T. M. D. Azevedo, I. C. S. Araújo, I. F. Araujo, and A. J. da Silva, Decomposition of multi-controlled special unitary single-qubit gates, ArXiv:2302.06377.
  60. P. Jordan and E. Wigner, Über das Paulische Äquivalenzverbot, Z. Phys. 47, 631 (1928).
  61. S. B. Bravyi and A. Y. Kitaev, Fermionic quantum computation, Ann. Phys. 298, 210 (2002).
  62. P. Coleman, Introduction to Many-Body Physics (Cambridge University Press, Cambridge, 2015).
  63. A. Macridin, A. C. Y. Li, S. Mrenna, and P. Spentzouris, Bosonic field digitization for quantum computers, Phys. Rev. A 105, 052405 (2022).
  64. G. Ortiz, J. E. Gubernatis, E. Knill, and R. Laflamme, Quantum algorithms for fermionic simulations, Phys. Rev. A 64, 022319 (2001).
  65. D. Wecker, M. B. Hastings, N. Wiebe, B. K. Clark, C. Nayak, and M. Troyer, Solving strongly correlated electron models on a quantum computer, Phys. Rev. A 92, 062318 (2015).
  66. I. D. Kivlichan, J. McClean, N. Wiebe, C. Gidney, A. Aspuru-Guzik, G. K.-L. Chan, and R. Babbush, Quantum simulation of electronic structure with linear depth and connectivity, Phys. Rev. Lett. 120, 110501 (2018).
  67. Z. Jiang, K. J. Sung, K. Kechedzhi, V. N. Smelyanskiy, and S. Boixo, Quantum algorithms to simulate many-body physics of correlated fermions, Phys. Rev. Appl. 9, 044036 (2018).
  68. C. H. Chee, D. Leykam, A. M. Mak, and D. G. Angelakis, Shallow quantum circuits for efficient preparation of Slater determinants and correlated states on a quantum computer, Phys. Rev. A 108, 022416 (2023).
  69. D. S. Abrams and S. Lloyd, Simulation of many-body Fermi systems on a universal quantum computer, Phys. Rev. Lett. 79, 2586 (1997).
  70. Y. Su, D. W. Berry, N. Wiebe, N. Rubin, and R. Babbush, Fault-tolerant quantum simulations of chemistry in first quantization, PRX Quantum 2, 040332 (2021).
  71. R. Babbush, W. J. Huggins, D. W. Berry, S. F. Ung, A. Zhao, D. R. Reichman, H. Neven, A. D. Baczewski, and J. Lee, Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods, Nat. Commun. 14, 4058 (2023).
  72. W. J. Huggins, O. Leimkuhler, T. F. Stetina, and K. B. Whaley, Efficient state preparation for the quantum simulation of molecules in first quantization, PRX Quantum 6, 020319 (2025).
  73. L. Veis and J. Pittner, Quantum computing applied to calculations of molecular energies: CH2 benchmark, J. Chem. Phys. 133, 194106 (2010).
  74. N. M. Tubman, C. Mejuto-Zaera, J. M. Epstein, D. Hait, D. S. Levine, W. Huggins, Z. Jiang, J. R. McClean, R. Babbush, M. Head-Gordon, et al., Postponing the orthogonality catastrophe: Efficient state preparation for electronic structure simulations on quantum devices, ArXiv:1809.05523.
  75. H. Wang, S. Ashhab, and F. Nori, Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer, Phys. Rev. A 79, 042335 (2009).
  76. T. Helgaker, P. Jorgensen, and J. Olsen, Molecular Electronic-Structure Theory (John Wiley & Sons, Hoboken, 2013).
  77. T. N. Georges, M. Bothe, C. Sünderhauf, B. K. Berntson, R. Izsák, and A. V. Ivanov, Quantum simulations of chemistry in first quantization with any basis set, npj Quantum Inf. 11, 55 (2025).
  78. R. Babbush, N. Wiebe, J. McClean, J. McClain, H. Neven, and G. K.-L. Chan, Low-depth quantum simulation of materials, Phys. Rev. X 8, 011044 (2018).
  79. R. Babbush, D. W. Berry, J. R. McClean, and H. Neven, Quantum simulation of chemistry with sublinear scaling in basis size, npj Quantum Inf. 5, 92 (2019).
  80. C. N. Yang and C. P. Yang, One-dimensional chain of anisotropic spin-spin interactions. I. Proof of Bethe’s hypothesis for ground state in a finite system, Phys. Rev. 150, 327 (1966).
  81. E. H. Lieb and W. Liniger, Exact analysis of an interacting Bose gas. I. The general solution and the ground state, Phys. Rev. 130, 1605 (1963).
  82. N. Andrei, K. Furuya, and J. H. Lowenstein, Solution of the Kondo problem, Rev. Mod. Phys. 55, 331 (1983).
  83. E. H. Lieb and F. Y. Wu, Absence of Mott transition in an exact solution of the short-range, one-band model in one dimension, Phys. Rev. Lett. 20, 1445 (1968).
  84. M. Karbach and G. Müller, Introduction to the Bethe ansatz I, ArXiv:cond-mat/9809162.
  85. L. D. Faddeev, Algebraic aspects of the Bethe ansatz, Int. J. Mod. Phys. A 10, 1845 (1995).
  86. M. Takahashi, Thermodynamics of One-Dimensional Solvable Models (Cambridge University Press, Cambridge, 1999).
  87. F. Levkovich-Maslyuk, The Bethe ansatz, J. Phys. A: Math. Theor. 49, 323004 (2016).
  88. R. I. Nepomechie, Bethe ansatz on a quantum computer? ArXiv:2010.01609.
  89. J. S. Van Dyke, E. Barnes, S. E. Economou, and R. I. Nepomechie, Preparing exact eigenstates of the open XXZ chain on a quantum computer, J. Phys. A: Math. Theor. 55, 055301 (2022).
  90. D. Raveh and R. I. Nepomechie, Estimating Bethe roots with VQE, J. Phys. A: Math. Theor. 57, 355303 (2024).
  91. M. Lutz, L. Piroli, G. Styliaris, and J. I. Cirac, Adiabatic quantum state preparation in integrable models, ArXiv:2503.21741.
  92. A. Bärtschi and S. Eidenbenz, in Fundamentals of Computation Theory (Springer, Berlin, Heidelberg, 2019), p. 126.
  93. IBM Quantum: Ibm quantum resources, https://quantum.ibm.com/services/resources (accessed: April 15, 2025).
  94. T. N. Kaldenbach and M. Heller, Mapping quantum circuits to shallow-depth measurement patterns based on graph states, Quantum Sci. Technol. 10, 015010 (2024).
  95. X. Sun, G. Tian, S. Yang, P. Yuan, and S. Zhang, Asymptotically optimal circuit depth for quantum state preparation and general unitary synthesis, IEEE Trans. Comput.-Aided Des. Integrated Circuits Syst. 42, 3301 (2023).

Outline

Information

Phys. Rev. Applied 23, 054066– Published 27 May, 2025
  • Received 6 January 2025
  • Revised 15 April 2025
  • Accepted 25 April 2025
Crossmark - Check for updates button

© 2025 American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation