{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T22:43:09Z","timestamp":1772232189175,"version":"3.50.1"},"reference-count":33,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NASA Ames Research Center","award":["IAA 8839, Annex 128"],"award-info":[{"award-number":["IAA 8839, Annex 128"]}]},{"name":"NASA Ames Research Center","award":["W911NF-17-C-0050"],"award-info":[{"award-number":["W911NF-17-C-0050"]}]},{"name":"NASA Ames Research Center","award":["NNA16BD14C"],"award-info":[{"award-number":["NNA16BD14C"]}]},{"name":"DARPA","award":["IAA 8839, Annex 128"],"award-info":[{"award-number":["IAA 8839, Annex 128"]}]},{"name":"DARPA","award":["W911NF-17-C-0050"],"award-info":[{"award-number":["W911NF-17-C-0050"]}]},{"name":"DARPA","award":["NNA16BD14C"],"award-info":[{"award-number":["NNA16BD14C"]}]},{"name":"Office of the Director of National Intelligence (ODNI)","award":["IAA 8839, Annex 128"],"award-info":[{"award-number":["IAA 8839, Annex 128"]}]},{"name":"Office of the Director of National Intelligence (ODNI)","award":["W911NF-17-C-0050"],"award-info":[{"award-number":["W911NF-17-C-0050"]}]},{"name":"Office of the Director of National Intelligence (ODNI)","award":["NNA16BD14C"],"award-info":[{"award-number":["NNA16BD14C"]}]},{"name":"Intelligence Advanced Research Projects Activity (IARPA)","award":["IAA 8839, Annex 128"],"award-info":[{"award-number":["IAA 8839, Annex 128"]}]},{"name":"Intelligence Advanced Research Projects Activity (IARPA)","award":["W911NF-17-C-0050"],"award-info":[{"award-number":["W911NF-17-C-0050"]}]},{"name":"Intelligence Advanced Research Projects Activity (IARPA)","award":["NNA16BD14C"],"award-info":[{"award-number":["NNA16BD14C"]}]},{"name":"Defense Advanced Research Projects Agency (DARPA)","award":["IAA 8839, Annex 128"],"award-info":[{"award-number":["IAA 8839, Annex 128"]}]},{"name":"Defense Advanced Research Projects Agency (DARPA)","award":["W911NF-17-C-0050"],"award-info":[{"award-number":["W911NF-17-C-0050"]}]},{"name":"Defense Advanced Research Projects Agency (DARPA)","award":["NNA16BD14C"],"award-info":[{"award-number":["NNA16BD14C"]}]},{"name":"USRA Feynman Quantum Academy","award":["IAA 8839, Annex 128"],"award-info":[{"award-number":["IAA 8839, Annex 128"]}]},{"name":"USRA Feynman Quantum Academy","award":["W911NF-17-C-0050"],"award-info":[{"award-number":["W911NF-17-C-0050"]}]},{"name":"USRA Feynman Quantum Academy","award":["NNA16BD14C"],"award-info":[{"award-number":["NNA16BD14C"]}]},{"DOI":"10.13039\/100018624","name":"NAMS R&amp;D Student Program","doi-asserted-by":"publisher","award":["IAA 8839, Annex 128"],"award-info":[{"award-number":["IAA 8839, Annex 128"]}],"id":[{"id":"10.13039\/100018624","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018624","name":"NAMS R&amp;D Student Program","doi-asserted-by":"publisher","award":["W911NF-17-C-0050"],"award-info":[{"award-number":["W911NF-17-C-0050"]}],"id":[{"id":"10.13039\/100018624","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018624","name":"NAMS R&amp;D Student Program","doi-asserted-by":"publisher","award":["NNA16BD14C"],"award-info":[{"award-number":["NNA16BD14C"]}],"id":[{"id":"10.13039\/100018624","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The quantum alternating operator ansatz (QAOA) and constrained quantum annealing (CQA) restrict the evolution of a quantum system to remain in a constrained space, often with a dimension much smaller than the whole Hilbert space. A natural question when using quantum annealing or a QAOA protocol to solve an optimization problem is to select an initial state for the wavefunction and what operators to use to evolve it into a solution state. In this work, we construct several ansatzes tailored to solve the combinational circuit fault diagnostic (CCFD) problem in different subspaces related to the structure of the problem, including superpolynomially smaller subspaces than the whole Hilbert space. We introduce a family of dense and highly connected circuits that include small instances but can be scaled to larger sizes as a useful collection of circuits for comparing different quantum algorithms. We compare the different ans\u00e4tzes on instances randomly generated from this family under different parameter selection methods. The results support that ans\u00e4tzes more closely tailored to exploiting the structure of the underlying optimization problems can have better performance than more generic ans\u00e4tzes.<\/jats:p>","DOI":"10.3390\/a15100356","type":"journal-article","created":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T20:58:47Z","timestamp":1664398727000},"page":"356","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tailored Quantum Alternating Operator Ans\u00e4tzes for Circuit Fault Diagnostics"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7713-9073","authenticated-orcid":false,"given":"Hannes","family":"Leipold","sequence":"first","affiliation":[{"name":"Information Sciences Institute, University of Southern California, Marina del Rey, CA 90292, USA"},{"name":"Department of Computer Science, University of Southern California, Los Angeles, CA 90089, USA"},{"name":"Quantum Artificial Intelligence Laboratory (QuAIL), NASA Ames Research Center, Moffett Field, CA 94035, USA"},{"name":"USRA Research Institute for Advanced Computer Science (RIACS), Mountain View, CA 94043, USA"}]},{"given":"Federico M.","family":"Spedalieri","sequence":"additional","affiliation":[{"name":"Information Sciences Institute, University of Southern California, Marina del Rey, CA 90292, USA"},{"name":"Department of Electrical and Computer Engineering, University of Southern California, Los Angeles, CA 90089, USA"}]},{"given":"Eleanor","family":"Rieffel","sequence":"additional","affiliation":[{"name":"Quantum Artificial Intelligence Laboratory (QuAIL), NASA Ames Research Center, Moffett Field, CA 94035, USA"}]}],"member":"1968","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Hadfield, S., Wang, Z., O\u2019gorman, B., Rieffel, E.G., Venturelli, D., and Biswas, R. (2019). From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms, 12.","DOI":"10.3390\/a12020034"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"014004","DOI":"10.1103\/PhysRevApplied.12.014004","article-title":"Readiness of quantum optimization machines for industrial applications","volume":"12","author":"Feldman","year":"2019","journal-title":"Phys. Rev. Appl."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"11691","DOI":"10.1038\/s41598-022-14804-8","article-title":"Quantum Annealing with Special Drivers for Circuit Fault Diagnostics","volume":"12","author":"Leipold","year":"2022","journal-title":"Sci. Rep."},{"key":"ref_4","unstructured":"Farhi, E., Goldstone, J., and Gutmann, S. (2014). A quantum approximate optimization algorithm. arXiv."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"022304","DOI":"10.1103\/PhysRevA.97.022304","article-title":"Quantum approximate optimization algorithm for maxcut: A fermionic view","volume":"97","author":"Wang","year":"2018","journal-title":"Phys. Rev. A"},{"key":"ref_6","first-page":"021067","article-title":"Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices","volume":"10","author":"Zhou","year":"2020","journal-title":"Phys. Rev. X"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Hadfield, S., Hogg, T., and Rieffel, E.G. (2021). Analytical Framework for Quantum Alternating Operator Ansn\u201d atze. arXiv.","DOI":"10.1088\/2058-9565\/aca3ce"},{"key":"ref_8","unstructured":"Bravyi, S., Kliesch, A., Koenig, R., and Tang, E. (2020). Hybrid quantum-classical algorithms for approximate graph coloring. arXiv."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Hadfield, S., Wang, Z., Rieffel, E.G., O\u2019Gorman, B., Venturelli, D., and Biswas, R. (2017, January 12\u201317). Quantum approximate optimization with hard and soft constraints. Proceedings of the Second International Workshop on Post Moores Era Supercomputing, Denver, CO, USA.","DOI":"10.1145\/3149526.3149530"},{"key":"ref_10","unstructured":"Farhi, E., and Harrow, A.W. (2016). Quantum supremacy through the quantum approximate optimization algorithm. arXiv."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","article-title":"Quantum computing in the NISQ era and beyond","volume":"2","author":"Preskill","year":"2018","journal-title":"Quantum"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1038\/s41567-020-01105-y","article-title":"Quantum approximate optimization of non-planar graph problems on a planar superconducting processor","volume":"17","author":"Harrigan","year":"2021","journal-title":"Nat. Phys."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","article-title":"Variational quantum algorithms","volume":"3","author":"Cerezo","year":"2021","journal-title":"Nat. Rev. Phys."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"120502","DOI":"10.1103\/PhysRevLett.127.120502","article-title":"Training variational quantum algorithms is np-hard","volume":"127","author":"Bittel","year":"2021","journal-title":"Phys. Rev. Lett."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"558","DOI":"10.22331\/q-2021-10-05-558","article-title":"Effect of barren plateaus on gradient-free optimization","volume":"5","author":"Arrasmith","year":"2021","journal-title":"Quantum"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41467-021-21728-w","article-title":"Cost function dependent barren plateaus in shallow parametrized quantum circuits","volume":"12","author":"Cerezo","year":"2021","journal-title":"Nat. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"010313","DOI":"10.1103\/PRXQuantum.3.010313","article-title":"Connecting ansatz expressibility to gradient magnitudes and barren plateaus","volume":"3","author":"Holmes","year":"2022","journal-title":"PRX Quantum"},{"key":"ref_18","unstructured":"Crooks, G.E. (2018). Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"034007","DOI":"10.1103\/PhysRevApplied.5.034007","article-title":"Quantum annealing for constrained optimization","volume":"5","author":"Hen","year":"2016","journal-title":"Phys. Rev. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"062312","DOI":"10.1103\/PhysRevA.93.062312","article-title":"Driver Hamiltonians for constrained optimization in quantum annealing","volume":"93","author":"Hen","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Shaydulin, R., Hadfield, S., Hogg, T., and Safro, I. (2020). Classical symmetries and the Quantum Approximate Optimization Algorithm. arXiv.","DOI":"10.1007\/s11128-021-03298-4"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Leipold, H., and Spedalieri, F. (2021). Constructing driver Hamiltonians for optimization problems with linear constraints. Quantum Sci. Technol.","DOI":"10.1088\/2058-9565\/ac16b8"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"012320","DOI":"10.1103\/PhysRevA.101.012320","article-title":"X y mixers: Analytical and numerical results for the quantum alternating operator ansatz","volume":"101","author":"Wang","year":"2020","journal-title":"Phys. Rev. A"},{"key":"ref_24","unstructured":"Kremenetski, V., Hogg, T., Hadfield, S., Cotton, S.J., and Tubman, N.M. (2021). Quantum Alternating Operator Ansatz (QAOA) Phase Diagrams and Applications for Quantum Chemistry. arXiv."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Jha, N.K., and Gupta, S. (2002). Testing of Digital Systems, Cambridge University Press.","DOI":"10.1017\/CBO9780511816321"},{"key":"ref_26","unstructured":"Childs, A.M., Farhi, E., Goldstone, J., and Gutmann, S. (2000). Finding cliques by quantum adiabatic evolution. arXiv."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"022319","DOI":"10.1103\/PhysRevA.64.022319","article-title":"Quantum algorithms for fermionic simulations","volume":"64","author":"Ortiz","year":"2001","journal-title":"Phys. Rev. A"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"052330","DOI":"10.1103\/PhysRevA.71.052330","article-title":"Quantum circuits with uniformly controlled one-qubit gates","volume":"71","author":"Bergholm","year":"2005","journal-title":"Phys. Rev. A"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41534-019-0240-1","article-title":"Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm","volume":"6","author":"Gard","year":"2020","journal-title":"NPJ Quantum Inf."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"479","DOI":"10.22331\/q-2021-06-17-479","article-title":"Warm-starting quantum optimization","volume":"5","author":"Egger","year":"2021","journal-title":"Quantum"},{"key":"ref_31","unstructured":"Cain, M., Farhi, E., Gutmann, S., Ranard, D., and Tang, E. (2022). The QAOA gets stuck starting from a good classical string. arXiv."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Khairy, S., Shaydulin, R., Cincio, L., Alexeev, Y., and Balaprakash, P. (2020, January 7\u201312). Learning to optimize variational quantum circuits to solve combinatorial problems. Proceedings of the AAAI Conference on Artificial Intelligence, New York, NY, USA.","DOI":"10.1609\/aaai.v34i03.5616"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"044008","DOI":"10.1088\/2058-9565\/abb6d9","article-title":"Using models to improve optimizers for variational quantum algorithms","volume":"5","author":"Sung","year":"2020","journal-title":"Quantum Sci. Technol."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/10\/356\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:41:21Z","timestamp":1760143281000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/10\/356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,28]]},"references-count":33,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["a15100356"],"URL":"https:\/\/doi.org\/10.3390\/a15100356","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,28]]}}}