{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T00:28:08Z","timestamp":1724891288544},"reference-count":79,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:00:00Z","timestamp":1724803200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"Quadratic programming over orthogonal matrices encompasses a broad class of hard optimization problems that do not have an efficient quantum representation. Such problems are instances of the little noncommutative Grothendieck problem (LNCG), a generalization of binary quadratic programs to continuous, noncommutative variables. In this work, we establish a natural embedding for this class of LNCG problems onto a fermionic Hamiltonian, thereby enabling the study of this classical problem with the tools of quantum information. This embedding is accomplished by a new representation of orthogonal matrices as fermionic quantum states, which we achieve through the well-known double covering of the orthogonal group. Correspondingly, the embedded LNCG Hamiltonian is a two-body fermion model. Determining extremal states of this Hamiltonian provides an outer approximation to the original problem, a quantum analogue to classical semidefinite relaxations. In particular, when optimizing over the s<\/mml:mi>p<\/mml:mi>e<\/mml:mi>c<\/mml:mi>i<\/mml:mi>a<\/mml:mi>l<\/mml:mi><\/mml:math> orthogonal group our quantum relaxation obeys additional, powerful constraints based on the convex hull of rotation matrices. The classical size of this convex-hull representation is exponential in matrix dimension, whereas our quantum representation requires only a linear number of qubits. Finally, to project the relaxed solution back into the feasible space, we propose rounding procedures which return orthogonal matrices from appropriate measurements of the quantum state. Through numerical experiments we provide evidence that this rounded quantum relaxation can produce high-quality approximations.<\/jats:p>","DOI":"10.22331\/q-2024-08-28-1451","type":"journal-article","created":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T10:28:31Z","timestamp":1724840911000},"page":"1451","update-policy":"http:\/\/dx.doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":0,"title":["Expanding the reach of quantum optimization with fermionic embeddings"],"prefix":"10.22331","volume":"8","author":[{"given":"Andrew","family":"Zhao","sequence":"first","affiliation":[{"name":"Google Quantum AI, San Francisco, CA 94105, USA"},{"name":"Center for Quantum Information and Control, Department of Physics and Astronomy, University of New Mexico, Albuquerque, NM 87106, USA"}]},{"given":"Nicholas C.","family":"Rubin","sequence":"additional","affiliation":[{"name":"Google Quantum AI, San Francisco, CA 94105, USA"}]}],"member":"9598","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Richard P. Feynman ``Simulating physics with computers'' International Journal of Theoretical Physics 21, 467-488 (1982).","DOI":"10.1007\/BF02650179"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Seth Lloyd ``Universal quantum simulators'' Science 273, 1073\u20131078 (1996).","DOI":"10.1126\/science.273.5278.1073"},{"key":"2","doi-asserted-by":"publisher","unstructured":"P.W. Shor ``Algorithms for quantum computation: discrete logarithms and factoring'' Proceedings 35th Annual Symposium on Foundations of Computer Science 124\u2013134 (1994).","DOI":"10.1109\/SFCS.1994.365700"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Lov K. Grover ``A Fast Quantum Mechanical Algorithm for Database Search'' Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing 212\u2013219 (1996).","DOI":"10.1145\/237814.237866"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Ryan Babbush, Jarrod R. McClean, Michael Newman, Craig Gidney, Sergio Boixo, and Hartmut Neven, ``Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage'' PRX Quantum 2, 010103 (2021).","DOI":"10.1103\/PRXQuantum.2.010103"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Jarrod R. McClean, Matthew P. Harrigan, Masoud Mohseni, Nicholas C. Rubin, Zhang Jiang, Sergio Boixo, Vadim N. Smelyanskiy, Ryan Babbush, and Hartmut Neven, ``Low-Depth Mechanisms for Quantum Optimization'' PRX Quantum 2, 030312 (2021).","DOI":"10.1103\/PRXQuantum.2.030312"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Yoel Shkolniskyand Amit Singer ``Viewing direction estimation in cryo-EM using synchronization'' SIAM Journal on Imaging Sciences 5, 1088\u20131110 (2012).","DOI":"10.1137\/120863642"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Amit Singer ``Mathematics for cryo-electron microscopy'' Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018 3995\u20134014 (2018).","DOI":"10.1142\/9789813272880_0209"},{"key":"8","doi-asserted-by":"publisher","unstructured":"Mihai Cucuringu, Amit Singer, and David Cowburn, ``Eigenvector synchronization, graph rigidity and the molecule problem'' Information and Inference: A Journal of the IMA 1, 21\u201367 (2012).","DOI":"10.1093\/imaiai\/ias002"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Mica Arie-Nachimson, Shahar Z Kovalsky, Ira Kemelmacher-Shlizerman, Amit Singer, and Ronen Basri, ``Global motion estimation from point matches'' 2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission 81\u201388 (2012).","DOI":"10.1109\/3DIMPVT.2012.46"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Onur \u00d6zye\u015fil, Vladislav Voroninski, Ronen Basri, and Amit Singer, ``A survey of structure from motion'' Acta Numerica 26, 305\u2013364 (2017).","DOI":"10.1017\/S096249291700006X"},{"key":"11","doi-asserted-by":"publisher","unstructured":"David M Rosen, Luca Carlone, Afonso S Bandeira, and John J Leonard, ``SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group'' The International Journal of Robotics Research 38, 95\u2013125 (2019).","DOI":"10.1177\/027836491878436"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Pierre-Yves Lajoie, Siyi Hu, Giovanni Beltrame, and Luca Carlone, ``Modeling perceptual aliasing in SLAM via discrete\u2013continuous graphical models'' IEEE Robotics and Automation Letters 4, 1232\u20131239 (2019).","DOI":"10.1109\/LRA.2019.2894852"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Mihai Cucuringu, Yaron Lipman, and Amit Singer, ``Sensor network localization by eigenvector synchronization over the Euclidean group'' ACM Transactions on Sensor Networks (TOSN) 8, 1\u201342 (2012).","DOI":"10.1145\/2240092.2240093"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Arkadi Nemirovski ``Sums of random symmetric matrices and quadratic optimization under orthogonality constraints'' Mathematical Programming 109, 283\u2013317 (2007).","DOI":"10.1007\/s10107-006-0033-0"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Afonso S Bandeira, Christopher Kennedy, and Amit Singer, ``Approximating the little Grothendieck problem over the orthogonal and unitary groups'' Mathematical Programming 160, 433\u2013475 (2016).","DOI":"10.1007\/s10107-016-0993-7"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Jop Bri\u00ebt, Oded Regev, and Rishi Saket, ``Tight Hardness of the Non-Commutative Grothendieck Problem'' Theory of Computing 13, 1\u201324 (2017).","DOI":"10.4086\/toc.2017.v013a015"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Janez Povh ``Semidefinite approximations for quadratic programs over orthogonal matrices'' Journal of Global Optimization 48, 447\u2013463 (2010).","DOI":"10.1007\/s10898-009-9499-7"},{"key":"18","doi-asserted-by":"publisher","unstructured":"Lanhui Wangand Amit Singer ``Exact and stable recovery of rotations for robust synchronization'' Information and Inference: A Journal of the IMA 2, 145\u2013193 (2013).","DOI":"10.1093\/imaiai\/iat005"},{"key":"19","doi-asserted-by":"publisher","unstructured":"Assaf Naor, Oded Regev, and Thomas Vidick, ``Efficient Rounding for the Noncommutative Grothendieck Inequality'' Theory of Computing 10, 257\u2013295 (2014).","DOI":"10.4086\/toc.2014.v010a011"},{"key":"20","doi-asserted-by":"publisher","unstructured":"James Saunderson, Pablo A Parrilo, and Alan S Willsky, ``Semidefinite relaxations for optimization problems over rotation matrices'' 53rd IEEE Conference on Decision and Control 160\u2013166 (2014).","DOI":"10.1109\/CDC.2014.7039375"},{"key":"21","doi-asserted-by":"publisher","unstructured":"Afonso S Bandeira, Ben Blum-Smith, Joe Kileel, Jonathan Niles-Weed, Amelia Perry, and Alexander S Wein, ``Estimation under group actions: recovering orbits from invariants'' Applied and Computational Harmonic Analysis 66, 236\u2013319 (2023).","DOI":"10.1016\/j.acha.2023.06.001"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Thomas Pumir, Amit Singer, and Nicolas Boumal, ``The generalized orthogonal Procrustes problem in the high noise regime'' Information and Inference: A Journal of the IMA 10, 921\u2013954 (2021).","DOI":"10.1093\/imaiai\/iaaa035"},{"key":"23","doi-asserted-by":"publisher","unstructured":"James Saunderson, Pablo A Parrilo, and Alan S Willsky, ``Semidefinite descriptions of the convex hull of rotation matrices'' SIAM Journal on Optimization 25, 1314\u20131343 (2015).","DOI":"10.1137\/14096339X"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Nikolai Matniand Matanya B Horowitz ``A convex approach to consensus on $SO(n)$'' 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) 959\u2013966 (2014).","DOI":"10.1109\/ALLERTON.2014.7028558"},{"key":"25","doi-asserted-by":"publisher","unstructured":"David M Rosen, Charles DuHadway, and John J Leonard, ``A convex relaxation for approximate global optimization in simultaneous localization and mapping'' 2015 IEEE International Conference on Robotics and Automation (ICRA) 5822\u20135829 (2015).","DOI":"10.1109\/ICRA.2015.7140014"},{"key":"26","doi-asserted-by":"publisher","unstructured":"James Saunderson, Pablo A Parrilo, and Alan S Willsky, ``Convex solution to a joint attitude and spin-rate estimation problem'' Journal of Guidance, Control, and Dynamics 39, 118\u2013127 (2016).","DOI":"10.2514\/1.G001107"},{"key":"27","doi-asserted-by":"publisher","unstructured":"Bryce Fuller, Charles Hadfield, Jennifer R Glick, Takashi Imamichi, Toshinari Itoko, Richard J Thompson, Yang Jiao, Marna M Kagele, Adriana W Blom-Schieber, and Rudy Raymond, ``Approximate solutions of combinatorial problems via quantum relaxations'' IEEE Transactions on Quantum Engineering (2024).","DOI":"10.1109\/TQE.2024.3421294"},{"key":"28","doi-asserted-by":"publisher","unstructured":"Fernando GSL Brandaoand Aram W Harrow ``Product-state approximations to quantum ground states'' Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing 871\u2013880 (2013).","DOI":"10.1145\/2488608.2488719"},{"key":"29","doi-asserted-by":"publisher","unstructured":"Sergey Bravyi, David Gosset, Robert K\u00f6nig, and Kristan Temme, ``Approximation algorithms for quantum many-body problems'' Journal of Mathematical Physics 60, 032203 (2019).","DOI":"10.1063\/1.5085428"},{"key":"30","doi-asserted-by":"publisher","unstructured":"Sevag Gharibianand Ojas Parekh ``Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut'' Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2019) 145, 31:1\u201331:17 (2019).","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2019.31"},{"key":"31","doi-asserted-by":"publisher","unstructured":"Anurag Anshu, David Gosset, and Karen Morenz, ``Beyond Product State Approximations for a Quantum Analogue of Max Cut'' 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020) 158, 7:1\u20137:15 (2020).","DOI":"10.4230\/LIPIcs.TQC.2020.7"},{"key":"32","doi-asserted-by":"publisher","unstructured":"Ojas Parekhand Kevin Thompson ``Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems'' 29th Annual European Symposium on Algorithms (ESA 2021) 204, 74:1\u201374:18 (2021).","DOI":"10.4230\/LIPIcs.ESA.2021.74"},{"key":"33","doi-asserted-by":"publisher","unstructured":"Ojas Parekhand Kevin Thompson ``Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms'' 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) 198, 102:1\u2013102:20 (2021).","DOI":"10.4230\/LIPIcs.ICALP.2021.102"},{"key":"34","doi-asserted-by":"publisher","unstructured":"Matthew B Hastingsand Ryan O'Donnell ``Optimizing strongly interacting fermionic Hamiltonians'' Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing 776\u2013789 (2022).","DOI":"10.1145\/3519935.3519960"},{"key":"35","unstructured":"Ojas Parekhand Kevin Thompson ``An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms'' arXiv:2206.08342 (2022)."},{"key":"36","unstructured":"Matthew B Hastings ``Perturbation Theory and the Sum of Squares'' arXiv:2205.12325 (2022)."},{"key":"37","doi-asserted-by":"publisher","unstructured":"Robbie King ``An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs'' Quantum 7, 1180 (2023).","DOI":"10.22331\/q-2023-11-09-1180"},{"key":"38","doi-asserted-by":"publisher","unstructured":"R. D. Somma, S. Boixo, H. Barnum, and E. Knill, ``Quantum Simulations of Classical Annealing Processes'' Physical Review Letters 101, 130504 (2008).","DOI":"10.1103\/PhysRevLett.101.130504"},{"key":"39","unstructured":"Edward Farhi, Jeffrey Goldstone, and Sam Gutmann, ``A quantum approximate optimization algorithm'' arXiv:1411.4028 (2014)."},{"key":"40","doi-asserted-by":"publisher","unstructured":"Zhihui Wang, Nicholas C. Rubin, Jason M. Dominy, and Eleanor G. Rieffel, ``$XY$ mixers: Analytical and numerical results for the quantum alternating operator ansatz'' Physical Review A 101, 012320 (2020).","DOI":"10.1103\/PhysRevA.101.012320"},{"key":"41","doi-asserted-by":"publisher","unstructured":"Philipp Hauke, Helmut G Katzgraber, Wolfgang Lechner, Hidetoshi Nishimori, and William D Oliver, ``Perspectives of quantum annealing: Methods and implementations'' Reports on Progress in Physics 83, 054401 (2020).","DOI":"10.1088\/1361-6633\/ab85b8"},{"key":"42","doi-asserted-by":"publisher","unstructured":"Boris S Tsirel'son ``Quantum analogues of the Bell inequalities. The case of two spatially separated domains'' Journal of Soviet Mathematics 36, 557\u2013570 (1987).","DOI":"10.1007\/BF01663472"},{"key":"43","doi-asserted-by":"publisher","unstructured":"Oded Regevand Thomas Vidick ``Quantum XOR games'' ACM Transactions on Computation Theory (ToCT) 7, 1\u201343 (2015).","DOI":"10.1145\/2799560"},{"key":"44","unstructured":"Uffe Haagerupand Takashi Itoh ``Grothendieck type norms for bilinear forms on $C^*$-algebras'' Journal of Operator Theory 263\u2013283 (1995)."},{"key":"45","doi-asserted-by":"publisher","unstructured":"Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O\u2019Donnell, ``Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?'' SIAM Journal on Computing 37, 319\u2013357 (2007).","DOI":"10.1137\/S0097539705447372"},{"key":"46","doi-asserted-by":"publisher","unstructured":"Michel X Goemansand David P Williamson ``Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming'' Journal of the ACM 42, 1115\u20131145 (1995).","DOI":"10.1145\/227683.227684"},{"key":"47","doi-asserted-by":"publisher","unstructured":"Yu Nesterov ``Semidefinite relaxation and nonconvex quadratic optimization'' Optimization methods and software 9, 141\u2013160 (1998).","DOI":"10.1080\/10556789808805690"},{"key":"48","doi-asserted-by":"publisher","unstructured":"Noga Alonand Assaf Naor ``Approximating the cut-norm via Grothendieck's inequality'' Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing 72\u201380 (2004).","DOI":"10.1145\/1007352.1007371"},{"key":"49","doi-asserted-by":"publisher","unstructured":"Subhash Khotand Assaf Naor ``Approximate kernel clustering'' Mathematika 55, 129\u2013165 (2009).","DOI":"10.1112\/S002557930000098X"},{"key":"50","doi-asserted-by":"publisher","unstructured":"Nicolas Boumal, Amit Singer, and P-A Absil, ``Robust estimation of rotations from relative measurements by maximum likelihood'' 52nd IEEE Conference on Decision and Control 1156\u20131161 (2013).","DOI":"10.1109\/CDC.2013.6760038"},{"key":"51","doi-asserted-by":"crossref","unstructured":"John C Gowerand Garmt B Dijksterhuis ``Procrustes Problems'' Oxford University Press (2004).","DOI":"10.1093\/acprof:oso\/9780198510581.001.0001"},{"key":"52","doi-asserted-by":"publisher","unstructured":"Michael F Atiyah, Raoul Bott, and Arnold Shapiro, ``Clifford modules'' Topology 3, 3\u201338 (1964).","DOI":"10.1016\/0040-9383(64)90003-5"},{"key":"53","doi-asserted-by":"publisher","unstructured":"Peter H Sch\u00f6nemann ``A generalized solution of the orthogonal Procrustes problem'' Psychometrika 31, 1\u201310 (1966).","DOI":"10.1007\/BF02289451"},{"key":"54","doi-asserted-by":"publisher","unstructured":"Raman Sanyal, Frank Sottile, and Bernd Sturmfels, ``Orbitopes'' Mathematika 57, 275\u2013314 (2011).","DOI":"10.1112\/S002557931100132X"},{"key":"55","unstructured":"Emanuel Knill ``Fermionic linear optics and matchgates'' arXiv:quant-ph\/0108033 (2001)."},{"key":"56","doi-asserted-by":"publisher","unstructured":"Barbara M Terhaland David P DiVincenzo ``Classical simulation of noninteracting-fermion quantum circuits'' Physical Review A 65, 032325 (2002).","DOI":"10.1103\/PhysRevA.65.032325"},{"key":"57","doi-asserted-by":"publisher","unstructured":"Richard Jozsaand Akimasa Miyake ``Matchgates and classical simulation of quantum circuits'' Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 464, 3089\u20133106 (2008).","DOI":"10.1098\/rspa.2008.0189"},{"key":"58","doi-asserted-by":"publisher","unstructured":"Leonid Gurvits ``Classical complexity and quantum entanglement'' Journal of Computer and System Sciences 69, 448\u2013484 (2004).","DOI":"10.1016\/j.jcss.2004.06.003"},{"key":"59","doi-asserted-by":"publisher","unstructured":"Lawrence M Ioannou ``Computational complexity of the quantum separability problem'' Quantum Information & Computation 7, 335\u2013370 (2007).","DOI":"10.26421\/QIC7.4-5"},{"key":"60","doi-asserted-by":"publisher","unstructured":"Sevag Gharibian ``Strong NP-hardness of the quantum separability problem'' Quantum Information & Computation 10, 343\u2013360 (2010).","DOI":"10.26421\/QIC10.3-4-11"},{"key":"61","doi-asserted-by":"publisher","unstructured":"Julia Kempe, Alexei Kitaev, and Oded Regev, ``The complexity of the local Hamiltonian problem'' SIAM Journal on Computing 35, 1070\u20131097 (2006).","DOI":"10.1137\/S0097539704445226"},{"key":"62","doi-asserted-by":"publisher","unstructured":"Yi-Kai Liu, Matthias Christandl, and F. Verstraete, ``Quantum Computational Complexity of the $N$-Representability Problem: QMA Complete'' Physical Review Letters 98, 110503 (2007).","DOI":"10.1103\/PhysRevLett.98.110503"},{"key":"63","doi-asserted-by":"publisher","unstructured":"Toby Cubittand Ashley Montanaro ``Complexity classification of local Hamiltonian problems'' SIAM Journal on Computing 45, 268\u2013316 (2016).","DOI":"10.1137\/140998287"},{"key":"64","doi-asserted-by":"publisher","unstructured":"Xavier Bonet-Monroig, Ryan Babbush, and Thomas E O\u2019Brien, ``Nearly optimal measurement scheduling for partial tomography of quantum states'' Physical Review X 10, 031064 (2020).","DOI":"10.1103\/PhysRevX.10.031064"},{"key":"65","doi-asserted-by":"publisher","unstructured":"Andrew Zhao, Nicholas C Rubin, and Akimasa Miyake, ``Fermionic partial tomography via classical shadows'' Physical Review Letters 127, 110504 (2021).","DOI":"10.1103\/PhysRevLett.127.110504"},{"key":"66","doi-asserted-by":"publisher","unstructured":"William J. Huggins, Kianna Wan, Jarrod McClean, Thomas E. O'Brien, Nathan Wiebe, and Ryan Babbush, ``Nearly Optimal Quantum Algorithm for Estimating Multiple Expectation Values'' Physical Review Letters 129, 240501 (2022).","DOI":"10.1103\/PhysRevLett.129.240501"},{"key":"67","doi-asserted-by":"publisher","unstructured":"Shuyang Ling ``Solving orthogonal group synchronization via convex and low-rank optimization: Tightness and landscape analysis'' Mathematical Programming 200, 589\u2013628 (2023).","DOI":"10.1007\/s10107-022-01896-3"},{"key":"68","doi-asserted-by":"publisher","unstructured":"Tameem Albashand Daniel A. Lidar ``Adiabatic quantum computation'' Reviews of Modern Physics 90, 015002 (2018).","DOI":"10.1103\/RevModPhys.90.015002"},{"key":"69","doi-asserted-by":"publisher","unstructured":"Zhang Jiang, Kevin J. Sung, Kostyantyn Kechedzhi, Vadim N. Smelyanskiy, and Sergio Boixo, ``Quantum Algorithms to Simulate Many-Body Physics of Correlated Fermions'' Physical Review Applied 9, 044036 (2018).","DOI":"10.1103\/PhysRevApplied.9.044036"},{"key":"70","doi-asserted-by":"publisher","unstructured":"Andrew Zhaoand Akimasa Miyake ``Group-theoretic error mitigation enabled by classical shadows and symmetries'' npj Quantum Information 10, 57 (2024).","DOI":"10.1038\/s41534-024-00854-5"},{"key":"71","doi-asserted-by":"publisher","unstructured":"Jean Gallier ``Geometric Methods and Applications'' Springer Science & Business Media (2011).","DOI":"10.1007\/978-1-4419-9961-0"},{"key":"72","doi-asserted-by":"publisher","unstructured":"Antonio M Tulinoand Sergio Verd\u00fa ``Random matrix theory and wireless communications'' Communications and Information Theory 1, 1\u2013182 (2004).","DOI":"10.5555\/1166373.1166374"},{"key":"73","doi-asserted-by":"publisher","unstructured":"Beno\u00eet Collinsand Piotr \u015aniady ``Integration with respect to the Haar measure on unitary, orthogonal and symplectic group'' Communications in Mathematical Physics 264, 773\u2013795 (2006).","DOI":"10.1007\/s00220-006-1554-3"},{"key":"74","doi-asserted-by":"publisher","unstructured":"Giacomo Livanand Pierpaolo Vivo ``Moments of Wishart\u2013Laguerre and Jacobi Ensembles of Random Matrices: Application to the Quantum Transport Problem in Chaotic Cavities'' Acta Physica Polonica B 42, 1081 (2011).","DOI":"10.5506\/APhysPolB.42.1081"},{"key":"75","doi-asserted-by":"publisher","unstructured":"Alan Edelman ``Eigenvalues and condition numbers of random matrices'' SIAM Journal on Matrix Analysis and Applications 9, 543\u2013560 (1988).","DOI":"10.1137\/0609045"},{"key":"76","unstructured":"Iordanis Kerenidisand Anupam Prakash ``Quantum machine learning with subspace states'' arXiv:2202.00054 (2022)."},{"key":"77","doi-asserted-by":"publisher","unstructured":"Google AI Quantumand Collaborators ``Hartree-Fock on a superconducting qubit quantum computer'' Science 369, 1084\u20131089 (2020).","DOI":"10.1126\/science.abb9811"},{"key":"78","doi-asserted-by":"publisher","unstructured":"Andr\u00e1s Gily\u00e9n, Srinivasan Arunachalam, and Nathan Wiebe, ``Optimizing quantum optimization algorithms via faster quantum gradient computation'' Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms 1425\u20131444 (2019).","DOI":"10.1137\/1.9781611975482.87"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-08-28-1451\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T10:28:38Z","timestamp":1724840918000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-08-28-1451\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,28]]},"references-count":79,"URL":"https:\/\/doi.org\/10.22331\/q-2024-08-28-1451","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,28]]},"article-number":"1451"}}