%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.20", %%% date = "14 January 2026", %%% time = "07:13:09 MDT", %%% filename = "tqc.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% URL = "https://www.math.utah.edu/~beebe", %%% checksum = "39562 4383 19929 190343", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "ACM Transactions on Quantum Computing (TQC); %%% bibliography; BibTeX", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is a COMPLETE BibTeX bibliography for %%% ACM Transactions on Quantum Computing (TQC) %%% (CODEN ????, ISSN 2469-7818 (print), %%% 2469-7826 (electronic)). The journal appears %%% quarterly, and publication began with volume %%% 1, number 1, in February 2018. %%% %%% At version 1.20, the COMPLETE journal %%% coverage looked like this: %%% %%% 2020 ( 6) 2023 ( 27) 2026 ( 7) %%% 2021 ( 19) 2024 ( 25) %%% 2022 ( 24) 2025 ( 32) %%% %%% Article: 140 %%% %%% Total entries: 140 %%% %%% The journal Web page can be found at: %%% %%% http://tqc.acm.org/ %%% %%% The journal table of contents page is at: %%% %%% https://dl.acm.org/citation.cfm?id=J1620 %%% %%% Qualified subscribers can retrieve the full %%% text of recent articles in PDF form. %%% %%% The initial draft was extracted from the ACM %%% Web pages. %%% %%% ACM copyrights explicitly permit abstracting %%% with credit, so article abstracts, keywords, %%% and subject classifications have been %%% included in this bibliography wherever %%% available. Article reviews have been %%% omitted, until their copyright status has %%% been clarified. %%% %%% URL keys in the bibliography point to %%% World Wide Web locations of additional %%% information about the entry. %%% %%% BibTeX citation tags are uniformly chosen %%% as name:year:abbrev, where name is the %%% family name of the first author or editor, %%% year is a 4-digit number, and abbrev is a %%% 3-letter condensation of important title %%% words. Citation tags were automatically %%% generated by software developed for the %%% BibNet Project. %%% %%% In this bibliography, entries are sorted in %%% publication order, using ``bibsort -byvolume.'' %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ==================================================================== @Preamble{"\input bibnames.sty" # "\ifx \undefined \booktitle \def \booktitle #1{{{\em #1}}} \fi" # "\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi" } %%% ==================================================================== %%% Acknowledgement abbreviations: @String{ack-nhfb = "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|https://www.math.utah.edu/~beebe/|"} %%% ==================================================================== %%% Journal abbreviations: @String{j-TQC = "ACM Transactions on Quantum Computing (TQC)"} %%% ==================================================================== %%% Bibliography entries: @Article{Humble:2020:IIE, author = "Travis S. Humble and Mingsheng Ying", title = "Inaugural Issue Editorial for {{\booktitle{ACM Transactions on Quantum Computing}}}", journal = j-TQC, volume = "1", number = "1", pages = "1:1--1:2", month = dec, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3411487", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 10 06:45:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3411487", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "1", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Baker:2020:IQC, author = "Jonathan M. Baker and Casey Duckering and Pranav Gokhale and Natalie C. Brown and Kenneth R. Brown and Frederic T. Chong", title = "Improved Quantum Circuits via Intermediate Qutrits", journal = j-TQC, volume = "1", number = "1", pages = "2:1--2:25", month = dec, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3406309", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 10 06:45:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3406309", abstract = "Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu trits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log$_2$ (3) binary-to-ternary \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "2", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Flammia:2020:EEP, author = "Steven T. Flammia and Joel J. Wallman", title = "Efficient Estimation of {Pauli} Channels", journal = j-TQC, volume = "1", number = "1", pages = "3:1--3:32", month = dec, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3408039", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 10 06:45:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3408039", abstract = "Pauli channels are ubiquitous in quantum information, both as a dominant noise source in many computing architectures and as a practical model for analyzing error correction and fault tolerance. Here, we prove several results on efficiently learning \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "3", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Das:2020:NEM, author = "Soumya Das and Goutam Paul", title = "A New Error-Modeling of {Hardy's Paradox} for Superconducting Qubits and Its Experimental Verification", journal = j-TQC, volume = "1", number = "1", pages = "4:1--4:24", month = dec, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3396239", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 10 06:45:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3396239", abstract = "Hardy's paradox (equivalently, Hardy's non-locality or Hardy's test) [Phys. Rev. Lett. 68, 2981 (1992)] is used to show non-locality without inequalities, and it has been tested several times using optical circuits. We, for the first time, \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "4", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Kerenidis:2020:QIP, author = "Iordanis Kerenidis and Anupam Prakash", title = "A Quantum Interior Point Method for {LPs} and {SDPs}", journal = j-TQC, volume = "1", number = "1", pages = "5:1--5:32", month = dec, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3406306", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 10 06:45:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3406306", abstract = "We present a quantum interior point method (IPM) for semi-definite programs that has a worst-case running time of {\~O}( n$^{2.5}$ / \xi $^2$ \mu \kappa $^3$ log(1/ \epsilon )). The algorithm outputs a pair of matrices ( S,Y ) that have objective value within \epsilon of the optimal and satisfy \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "5", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Allcock:2020:QAF, author = "Jonathan Allcock and Chang-Yu Hsieh and Iordanis Kerenidis and Shengyu Zhang", title = "Quantum Algorithms for Feedforward Neural Networks", journal = j-TQC, volume = "1", number = "1", pages = "6:1--6:24", month = dec, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3411466", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 10 06:45:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3411466", abstract = "Quantum machine learning has the potential for broad industrial applications, and the development of quantum algorithms for improving the performance of neural networks is of particular interest given the central role they play in machine learning \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "6", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Ushijima-Mwesigwa:2021:MCO, author = "Hayato Ushijima-Mwesigwa and Ruslan Shaydulin and Christian F. A. Negre and Susan M. Mniszewski and Yuri Alexeev and Ilya Safro", title = "Multilevel Combinatorial Optimization across Quantum Architectures", journal = j-TQC, volume = "2", number = "1", pages = "1:1--1:29", month = feb, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3425607", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 10 06:45:34 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3425607", abstract = "Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore's law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "1", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Suau:2021:PQC, author = "Adrien Suau and Gabriel Staffelbach and Henri Calandra", title = "Practical Quantum Computing: Solving the Wave Equation Using a Quantum Approach", journal = j-TQC, volume = "2", number = "1", pages = "2:1--2:35", month = feb, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3430030", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 10 06:45:34 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3430030", abstract = "In the last few years, several quantum algorithms that try to address the problem of partial differential equation solving have been devised: on the one hand, ``direct'' quantum algorithms that aim at encoding the solution of the PDE by executing one large quantum circuit; on the other hand, variational algorithms that approximate the solution of the PDE by executing several small quantum circuits and making profit of classical optimisers. In this work, we propose an experimental study of the costs (in terms of gate number and execution time on a idealised hardware created from realistic gate data) associated with one of the ``direct'' quantum algorithm: the wave equation solver devised in [32]. We show that our implementation of the quantum wave equation solver agrees with the theoretical big-O complexity of the algorithm. We also explain in great detail the implementation steps and discuss some possibilities of improvements. Finally, our implementation proves experimentally that some PDE can be solved on a quantum computer, even if the direct quantum algorithm chosen will require error-corrected quantum chips, which are not believed to be available in the short-term.", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "2", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Lin:2021:USG, author = "Joseph X. Lin and Eric R. Anschuetz and Aram W. Harrow", title = "Using Spectral Graph Theory to Map Qubits onto Connectivity-limited Devices", journal = j-TQC, volume = "2", number = "1", pages = "3:1--3:30", month = feb, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3436752", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 10 06:45:34 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3436752", abstract = "We propose an efficient heuristic for mapping the logical qubits of quantum algorithms to the physical qubits of connectivity-limited devices, adding a minimal number of connectivity-compliant SWAP gates. In particular, given a quantum circuit, we \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "3", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Arapinis:2021:DSQ, author = "Myrto Arapinis and Nikolaos Lamprou and Elham Kashefi and Anna Pappa", title = "Definitions and Security of Quantum Electronic Voting", journal = j-TQC, volume = "2", number = "1", pages = "4:1--4:33", month = apr, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3450144", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Thu Apr 15 14:54:27 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3450144", abstract = "Recent advances indicate that quantum computers will soon be reality. Motivated by this ever more realistic threat for existing classical cryptographic protocols, researchers have developed several schemes to resist ``quantum attacks.'' In particular, for electronic voting (e-voting), several schemes relying on properties of quantum mechanics have been proposed. However, each of these proposals comes with a different and often not well-articulated corruption model, has different objectives, and is accompanied by security claims that are never formalized and are at best justified only against specific attacks. To address this, we propose the first formal security definitions for quantum e-voting protocols. With these at hand, we systematize and evaluate the security of previously proposed quantum e-voting protocols; we examine the claims of these works concerning privacy, correctness, and verifiability, and if they are correctly attributed to the proposed protocols. In all non-trivial cases, we identify specific quantum attacks that violate these properties. We argue that the cause of these failures lies in the absence of formal security models and references to the existing cryptographic literature.", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "4", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Bera:2021:QRA, author = "Debajyoti Bera and Sapv Tharrmashastha", title = "Quantum and Randomised Algorithms for Non-linearity Estimation", journal = j-TQC, volume = "2", number = "2", pages = "5:1--5:27", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3456509", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Aug 10 12:37:00 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3456509", abstract = "Non-linearity of a Boolean function indicates how far it is from any linear function. Despite there being several strong results about identifying a linear function and distinguishing one from a sufficiently non-linear function, we found a surprising \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "5", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Mccaskey:2021:ECH, author = "Alexander Mccaskey and Thien Nguyen and Anthony Santana and Daniel Claudino and Tyler Kharazi and Hal Finkel", title = "Extending {C++} for Heterogeneous Quantum--Classical Computing", journal = j-TQC, volume = "2", number = "2", pages = "6:1--6:36", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3462670", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Aug 10 12:37:00 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3462670", abstract = "We present qcor --- a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language agnostic manner, as well as a hardware-agnostic, retargetable compiler workflow targeting a number of physical and virtual quantum computing backends. qcor leverages novel Clang plugin interfaces and builds upon the XACC system-level quantum programming framework to provide a state-of-the-art integration mechanism for quantum-classical compilation that leverages the best from the community at-large. qcor translates quantum kernels ultimately to the XACC intermediate representation, and provides user-extensible hooks for quantum compilation routines like circuit optimization, analysis, and placement. This work details the overall architecture and compiler workflow for qcor, and provides a number of illuminating programming examples demonstrating its utility for near-term variational tasks, quantum algorithm expression, and feed-forward error correction schemes.", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "6", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Izquierdo:2021:TQA, author = "Zoe Gonzalez Izquierdo and Itay Hen and Tameem Albash", title = "Testing a Quantum Annealer as a Quantum Thermal Sampler", journal = j-TQC, volume = "2", number = "2", pages = "7:1--7:20", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3464456", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Aug 10 12:37:00 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3464456", abstract = "Motivated by recent experiments in which specific thermal properties of complex many-body systems were successfully reproduced on a commercially available quantum annealer, we examine the extent to which quantum annealing hardware can reliably sample \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "7", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Chen:2021:EOQ, author = "Chih-Chieh Chen and Masaya Watabe and Kodai Shiba and Masaru Sogabe and Katsuyoshi Sakamoto and Tomah Sogabe", title = "On the Expressibility and Overfitting of Quantum Circuit Learning", journal = j-TQC, volume = "2", number = "2", pages = "8:1--8:24", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3466797", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Aug 10 12:37:00 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3466797", abstract = "Applying quantum processors to model a high-dimensional function approximator is a typical method in quantum machine learning with potential advantage. It is conjectured that the unitarity of quantum circuits provides possible regularization to avoid \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "8", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Kong:2021:IAL, author = "Martin Kong", title = "On the Impact of Affine Loop Transformations in Qubit Allocation", journal = j-TQC, volume = "2", number = "3", pages = "9:1--9:40", month = sep, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3465409", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Oct 1 08:18:59 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3465409", abstract = "Most quantum compiler transformations and qubit allocation techniques to date are either peep-hole focused or rely on sliding windows that depend on a number of external parameters including the topology of the quantum processor. Thus, global optimization \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "9", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Ma:2021:QML, author = "Yunpu Ma and Volker Tresp", title = "Quantum Machine Learning Algorithm for Knowledge Graphs", journal = j-TQC, volume = "2", number = "3", pages = "10:1--10:28", month = sep, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3467982", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Oct 1 08:18:59 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3467982", abstract = "Semantic knowledge graphs are large-scale triple-oriented databases for knowledge representation and reasoning. Implicit knowledge can be inferred by modeling the tensor representations generated from knowledge graphs. However, as the sizes of knowledge \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "10", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{GoubaultDeBrugiere:2021:GEV, author = "Timoth{\'e}e {Goubault De Brugi{\`e}re} and Marc Baboulin and Beno{\^\i}t Valiron and Simon Martiel and Cyril Allouche", title = "{Gaussian} Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits", journal = j-TQC, volume = "2", number = "3", pages = "11:1--11:26", month = sep, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3474226", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Oct 1 08:18:59 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3474226", abstract = "Linear reversible circuits represent a subclass of reversible circuits with many applications in quantum computing. These circuits can be efficiently simulated by classical computers and their size is polynomially bounded by the number of qubits, making \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "11", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Doosti:2021:CSI, author = "Mina Doosti and Niraj Kumar and Mahshid Delavar and Elham Kashefi", title = "Client--server Identification Protocols with Quantum {PUF}", journal = j-TQC, volume = "2", number = "3", pages = "12:1--12:40", month = sep, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3484197", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Oct 1 08:18:59 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3484197", abstract = "Recently, major progress has been made towards the realisation of quantum internet to enable a broad range of classically intractable applications. These applications such as delegated quantum computation require running a secure identification protocol \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "12", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Humble:2021:ECQ, author = "Travis S. Humble and Mingsheng Ying", title = "Editorial on Celebrating Quantum Computing with {ACM}", journal = j-TQC, volume = "2", number = "4", pages = "13:1--13:2", month = dec, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3488391", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Dec 24 06:40:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3488391", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "13", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Aaronson:2021:OPR, author = "Scott Aaronson", title = "Open Problems Related to Quantum Query Complexity", journal = j-TQC, volume = "2", number = "4", pages = "14:1--14:9", month = dec, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3488559", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Dec 24 06:40:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3488559", abstract = "I offer a case that quantum query complexity still has loads of enticing and fundamental open problems-from relativized QMA versus QCMA and BQP versus IP, to time/space tradeoffs for collision and element distinctness, to polynomial degree versus quantum \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "14", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Wu:2021:ISI, author = "Xiaodi Wu", title = "Introduction to the Special issue on the Techniques of Programming Languages, Logic, and Formal Methods in Quantum Computing", journal = j-TQC, volume = "2", number = "4", pages = "15:1--15:3", month = dec, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3488389", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Dec 24 06:40:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3488389", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "15", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Feng:2021:QHL, author = "Yuan Feng and Mingsheng Ying", title = "Quantum {Hoare} Logic with Classical Variables", journal = j-TQC, volume = "2", number = "4", pages = "16:1--16:43", month = dec, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3456877", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Dec 24 06:40:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3456877", abstract = "Hoare logic provides a syntax-oriented method to reason about program correctness and has been proven effective in the verification of classical and probabilistic programs. Existing proposals for quantum Hoare logic either lack completeness or support \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "16", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Carette:2021:CGL, author = "Titouan Carette and Emmanuel Jeandel and Simon Perdrix and Renaud Vilmart", title = "Completeness of Graphical Languages for Mixed State Quantum Mechanics", journal = j-TQC, volume = "2", number = "4", pages = "17:1--17:28", month = dec, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3464693", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Dec 24 06:40:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3464693", abstract = "There exist several graphical languages for quantum information processing, like quantum circuits, ZX-calculus, ZW-calculus, and so on. Each of these languages forms a +-symmetric monoidal category (+-SMC) and comes with an interpretation functor to the +-. \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "17", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Hadfield:2021:RBR, author = "Stuart Hadfield", title = "On the Representation of {Boolean} and Real Functions as {Hamiltonians} for Quantum Computing", journal = j-TQC, volume = "2", number = "4", pages = "18:1--18:21", month = dec, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3478519", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Dec 24 06:40:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3478519", abstract = "Mapping functions on bits to Hamiltonians acting on qubits has many applications in quantum computing. In particular, Hamiltonians representing Boolean functions are required for applications of quantum annealing or the quantum approximate optimization \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "18", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Fu:2021:QPF, author = "X. Fu and Jintao Yu and Xing Su and Hanru Jiang and Hua Wu and Fucheng Cheng and Xi Deng and Jinrong Zhang and Lei Jin and Yihang Yang and Le Xu and Chunchao Hu and Anqi Huang and Guangyao Huang and Xiaogang Qiang and Mingtang Deng and Ping Xu and Weixia Xu and Wanwei Liu and Yu Zhang and Yuxin Deng and Junjie Wu and Yuan Feng", title = "{Quingo}: a Programming Framework for Heterogeneous Quantum-Classical Computing with {NISQ} Features", journal = j-TQC, volume = "2", number = "4", pages = "19:1--19:37", month = dec, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3483528", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Dec 24 06:40:33 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3483528", abstract = "The increasing control complexity of Noisy Intermediate-Scale Quantum (NISQ) systems underlines the necessity of integrating quantum hardware with quantum software. While mapping heterogeneous quantum-classical computing (HQCC) algorithms to NISQ hardware \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "19", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Harwood:2022:IVQ, author = "Stuart M. Harwood and Dimitar Trenev and Spencer T. Stober and Panagiotis Barkoutsos and Tanvi P. Gujarati and Sarah Mostame and Donny Greenberg", title = "Improving the Variational Quantum Eigensolver Using Variational Adiabatic Quantum Computing", journal = j-TQC, volume = "3", number = "1", pages = "1:1--1:20", month = mar, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3479197", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Jan 28 07:10:45 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3479197", abstract = "The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameterized quantum circuit. Since the resulting optimization problem is in general \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "1", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Vazquez:2022:EQL, author = "Almudena Carrera Vazquez and Ralf Hiptmair and Stefan Woerner", title = "Enhancing the Quantum Linear Systems Algorithm Using {Richardson} Extrapolation", journal = j-TQC, volume = "3", number = "1", pages = "2:1--2:37", month = mar, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3490631", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Jan 28 07:10:45 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3490631", abstract = "We present a quantum algorithm to solve systems of linear equations of the form $ A x = b $, where $A$ is a tridiagonal Toeplitz matrix and $b$ results from discretizing an analytic function, with a circuit complexity of $ O(1 / \sqrt {\epsilon }, \poly (\log \kappa, \log N))$, where $N$ denotes the number of equations, $ \epsilon $ is the accuracy, and $ \kappa $ the condition number. The repeat-until-success algorithm has to be run $ O(\kappa / (1 - \epsilon))$ times to succeed, leveraging amplitude amplification, and needs to be sampled $ O(1 / \epsilon^2)$ times. Thus, the algorithm achieves an exponential improvement with respect to $N$ over classical methods. In particular, we present efficient oracles for state preparation, Hamiltonian simulation, and a set of observables together with the corresponding error and complexity analyses. As the main result of this work, we show how to use Richardson extrapolation to enhance Hamiltonian simulation, resulting in an implementation of Quantum Phase Estimation (QPE) within the algorithm with $ 1 / \sqrt {\epsilon }$ circuits that can be run in parallel each with circuit complexity $ 1 / \sqrt {\epsilon }$ instead of $ 1 / \epsilon $. Furthermore, we analyze necessary conditions for the overall algorithm to achieve an exponential speedup compared to classical methods. Our approach is not limited to the considered setting and can be applied to more general problems where Hamiltonian simulation is approximated via product formulae, although our theoretical results would need to be extended accordingly. All the procedures presented are implemented with Qiskit and tested for small systems using classical simulation as well as using real quantum devices available through the IBM Quantum Experience.", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "2", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Paler:2022:ECQ, author = "Alexandru Paler and Robert Basmadjian", title = "Energy Cost of Quantum Circuit Optimisation: Predicting That Optimising {Shor}'s Algorithm Circuit Uses {1 GWh}", journal = j-TQC, volume = "3", number = "1", pages = "3:1--3:14", month = mar, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3490172", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Jan 28 07:10:45 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3490172", abstract = "Quantum circuits are difficult to simulate, and their automated optimisation is complex as well. Significant optimisations have been achieved manually (pen and paper) and not by software. This is the first in-depth study on the cost of compiling and \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "3", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Iten:2022:EPP, author = "Raban Iten and Romain Moyard and Tony Metger and David Sutter and Stefan Woerner", title = "Exact and Practical Pattern Matching for Quantum Circuit Optimization", journal = j-TQC, volume = "3", number = "1", pages = "4:1--4:41", month = mar, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3498325", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Jan 28 07:10:45 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3498325", abstract = "Quantum computations are typically performed as a sequence of basic operations, called quantum gates. Different gate sequences, called quantum circuits, can implement the same overall quantum computation. Since every additional quantum gate takes time and introduces noise into the system, it is important to find the smallest possible quantum circuit that implements a given computation, especially for near-term quantum devices that can execute only a limited number of quantum gates before noise renders the computation useless. An important building block for many quantum circuit optimization techniques is pattern matching: given a large and small quantum circuit, we would like to find all maximal matches of the small circuit, called a pattern, in the large circuit, considering pairwise commutation of quantum gates. In this work, we present the first classical algorithm for pattern matching that provably finds all maximal matches and is efficient enough to be practical for circuit sizes typical for near-term devices. We demonstrate numerically1 that combining our algorithm with known pattern-matching-based circuit optimization techniques reduces the gate count of a random quantum circuit by $ \approx $ 30\% and can further improve practically relevant quantum circuits that were already optimized with state-of-the-art techniques.", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "4", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{An:2022:QLS, author = "Dong An and Lin Lin", title = "Quantum Linear System Solver Based on Time-optimal Adiabatic Quantum Computing and Quantum Approximate Optimization Algorithm", journal = j-TQC, volume = "3", number = "2", pages = "5:1--5:28", month = jun, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3498331", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed May 25 08:23:35 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3498331", abstract = "We demonstrate that with an optimally tuned scheduling function, adiabatic quantum computing (AQC) can readily solve a quantum linear system problem (QLSP) with O ( \kappa poly(log ( \kappa \epsilon ))) runtime, where \kappa is the condition number, and \epsilon is the target accuracy. \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "5", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Haner:2022:LDQ, author = "Thomas H{\"a}ner and Mathias Soeken", title = "Lowering the {T}-depth of Quantum Circuits via Logic Network Optimization", journal = j-TQC, volume = "3", number = "2", pages = "6:1--6:15", month = jun, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3501334", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed May 25 08:23:35 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3501334", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "6", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Madden:2022:BAQ, author = "Liam Madden and Andrea Simonetto", title = "Best Approximate Quantum Compiling Problems", journal = j-TQC, volume = "3", number = "2", pages = "7:1--7:29", month = jun, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3505181", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed May 25 08:23:35 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3505181", abstract = "We study the problem of finding the best approximate circuit that is the closest (in some pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like gate alphabet and connectivity. We look at the problem in the CNOT+. \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "7", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Golden:2022:FSE, author = "John Golden and Andreas B{\"a}rtschi and Daniel O'Malley and Stephan Eidenbenz", title = "Fair Sampling Error Analysis on {NISQ} Devices", journal = j-TQC, volume = "3", number = "2", pages = "8:1--8:23", month = jun, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3510857", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed May 25 08:23:35 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3510857", abstract = "We study the status of fair sampling on Noisy Intermediate Scale Quantum (NISQ) devices, in particular the IBM Q family of backends. Using the recently introduced Grover Mixer-QAOA algorithm for discrete optimization, we generate fair sampling circuits to \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "8", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Barbeau:2022:AIR, author = "Michel Barbeau and Evangelos Kranakis and Nicolas Perez", title = "Authenticity, Integrity, and Replay Protection in Quantum Data Communications and Networking", journal = j-TQC, volume = "3", number = "2", pages = "9:1--9:22", month = jun, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3517341", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed May 25 08:23:35 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3517341", abstract = "Quantum data communications and networking involve classical hardware and software. Quantum storage is sensitive to environmental disturbances that may have malicious origins. Teleportation and entanglement swapping, two building blocks for the future \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "9", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Pozzi:2022:URL, author = "Matteo G. Pozzi and Steven J. Herbert and Akash Sengupta and Robert D. Mullins", title = "Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers", journal = j-TQC, volume = "3", number = "2", pages = "10:1--10:25", month = jun, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3520434", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed May 25 08:23:35 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3520434", abstract = "``Qubit routing'' refers to the task of modifying quantum circuits so that they satisfy the connectivity constraints of a target quantum computer. This involves inserting SWAP gates into the circuit so that the logical gates only ever occur between \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "10", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Alexeev:2022:ISI, author = "Yuri Alexeev and Alex McCaskey and Wibe {De Jong}", title = "Introduction to the Special Issue on Software Tools for Quantum Computing: {Part 1}", journal = j-TQC, volume = "3", number = "3", pages = "11:1--11:3", month = sep, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3532179", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:25 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3532179", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "11", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Cross:2022:OBD, author = "Andrew Cross and Ali Javadi-Abhari and Thomas Alexander and Niel {De Beaudrap} and Lev S. Bishop and Steven Heidel and Colm A. Ryan and Prasahnt Sivarajah and John Smolin and Jay M. Gambetta and Blake R. Johnson", title = "{OpenQASM 3}: a Broader and Deeper Quantum Assembly Language", journal = j-TQC, volume = "3", number = "3", pages = "12:1--12:50", month = sep, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3505636", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:25 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3505636", abstract = "Quantum assembly languages are machine-independent languages that traditionally describe quantum computation in the circuit model. Open quantum assembly language (OpenQASM 2) was proposed as an imperative programming language for quantum circuits based on \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "12", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Wille:2022:TQC, author = "Robert Wille and Stefan Hillmich and Lukas Burgholzer", title = "Tools for Quantum Computing Based on Decision Diagrams", journal = j-TQC, volume = "3", number = "3", pages = "13:1--13:17", month = sep, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3491246", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:25 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3491246", abstract = "With quantum computers promising advantages even in the near-term NISQ era, there is a lively community that develops software and toolkits for the design of corresponding quantum circuits. Although the underlying problems are different, expertise from \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "13", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Ittah:2022:QSS, author = "David Ittah and Thomas H{\"a}ner and Vadym Kliuchnikov and Torsten Hoefler", title = "{QIRO}: a Static Single Assignment-based Quantum Program Representation for Optimization", journal = j-TQC, volume = "3", number = "3", pages = "14:1--14:32", month = sep, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3491247", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:25 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3491247", abstract = "We propose an IR for quantum computing that directly exposes quantum and classical data dependencies for the purpose of optimization. The Quantum Intermediate Representation for Optimization (QIRO) consists of two dialects, one input dialect and one that \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "14", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Jaques:2022:LSS, author = "Samuel Jaques and Thomas H{\"a}ner", title = "Leveraging State Sparsity for More Efficient Quantum Simulations", journal = j-TQC, volume = "3", number = "3", pages = "15:1--15:17", month = sep, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3491248", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:25 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3491248", abstract = "High-performance techniques to simulate quantum programs on classical hardware rely on exponentially large vectors to represent quantum states. When simulating quantum algorithms, the quantum states that occur are often sparse due to special structure in \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "15", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Higgott:2022:PPP, author = "Oscar Higgott", title = "{PyMatching}: a {Python} Package for Decoding Quantum Codes with Minimum-Weight Perfect Matching", journal = j-TQC, volume = "3", number = "3", pages = "16:1--16:16", month = sep, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3505637", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:25 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/python.bib; https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3505637", abstract = "This article introduces PyMatching, a fast open-source Python package for decoding quantum error-correcting codes with the minimum-weight perfect matching (MWPM) algorithm. PyMatching includes the standard MWPM decoder as well as a variant, which we call \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "16", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Bassman:2022:AFS, author = "Lindsay Bassman and Connor Powers and Wibe A. {De Jong}", title = "{ArQTiC}: a Full-stack Software Package for Simulating Materials on Quantum Computers", journal = j-TQC, volume = "3", number = "3", pages = "17:1--17:17", month = sep, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3511715", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:25 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3511715", abstract = "ArQTiC is an open-source, full-stack software package built for the simulations of materials on quantum computers. It currently can simulate materials that can be modeled by any Hamiltonian derived from a generic, one-dimensional, time-dependent \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "17", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{J:2022:QAI, author = "Abhijith J. and Adetokunbo Adedoyin and John Ambrosiano and Petr Anisimov and William Casper and Gopinath Chennupati and Carleton Coffrin and Hristo Djidjev and David Gunter and Satish Karra and Nathan Lemons and Shizeng Lin and Alexander Malyzhenkov and David Mascarenas and Susan Mniszewski and Balu Nadiga and Daniel O'Malley and Diane Oyen and Scott Pakin and Lakshman Prasad and Randy Roberts and Phillip Romero and Nandakishore Santhi and Nikolai Sinitsyn and Pieter J. Swart and James G. Wendelberger and Boram Yoon and Richard Zamora and Wei Zhu and Stephan Eidenbenz and Andreas B{\"a}rtschi and Patrick J. Coles and Marc Vuffray and Andrey Y. Lokhov", title = "Quantum Algorithm Implementations for Beginners", journal = j-TQC, volume = "3", number = "4", pages = "18:1--18:92", month = dec, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3517340", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:26 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3517340", abstract = "As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "18", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Beigi:2022:TQO, author = "Salman Beigi and Leila Taghavi and Artin Tajdini", title = "Time- and Query-optimal Quantum Algorithms Based on Decision Trees", journal = j-TQC, volume = "3", number = "4", pages = "19:1--19:31", month = dec, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3519269", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:26 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3519269", abstract = "It has recently been shown that starting with a classical query algorithm (decision tree) and a guessing algorithm that tries to predict the query answers, we can design a quantum algorithm with query complexity $ O(\sqrt {GT}) $ where $T$ is the query complexity of \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "19", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Shao:2022:FQI, author = "Changpeng Shao and Ashley Montanaro", title = "Faster Quantum-inspired Algorithms for Solving Linear Systems", journal = j-TQC, volume = "3", number = "4", pages = "20:1--20:23", month = dec, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3520141", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:26 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3520141", abstract = "We establish an improved classical algorithm for solving linear systems in a model analogous to the QRAM that is used by quantum linear solvers. Precisely, for the linear system \( A{\bf x}= {\bf b} \), we show that there is a classical algorithm that \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "20", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Shao:2022:CED, author = "Changpeng Shao", title = "Computing Eigenvalues of Diagonalizable Matrices on a Quantum Computer", journal = j-TQC, volume = "3", number = "4", pages = "21:1--21:20", month = dec, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3527845", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:26 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3527845", abstract = "Computing eigenvalues of matrices is ubiquitous in numerical linear algebra problems. Currently, fast quantum algorithms for estimating eigenvalues of Hermitian and unitary matrices are known. However, the general case is far from fully understood in the \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "21", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Hillmich:2022:ADD, author = "Stefan Hillmich and Alwin Zulehner and Richard Kueng and Igor L. Markov and Robert Wille", title = "Approximating Decision Diagrams for Quantum Circuit Simulation", journal = j-TQC, volume = "3", number = "4", pages = "22:1--22:21", month = dec, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3530776", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:26 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3530776", abstract = "Quantum computers promise to solve important problems faster than conventional computers ever could. Underneath is a fundamentally different computational primitive that introduces new challenges for the development of software tools that aid designers of \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "22", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Basu:2022:QIA, author = "Saikat Basu and Amit Saha and Amlan Chakrabarti and Susmita Sur-Kolay", title = "{i-QER}: an Intelligent Approach Towards Quantum Error Reduction", journal = j-TQC, volume = "3", number = "4", pages = "23:1--23:18", month = dec, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3539613", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:26 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3539613", abstract = "Quantum computing has become a promising computing approach because of its capability to solve certain problems, exponentially faster than classical computers. A n -qubit quantum system is capable of providing 2$^n$ computational space to a quantum algorithm. \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "23", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Nguyen:2022:EPQ, author = "Thien Nguyen and Alexander J. McCaskey", title = "Extending {Python} for Quantum-classical Computing via Quantum Just-in-time Compilation", journal = j-TQC, volume = "3", number = "4", pages = "24:1--24:25", month = dec, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3544496", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Sep 20 09:37:26 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/python.bib; https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3544496", abstract = "Python is a popular programming language known for its flexibility, usability, readability, and focus on developer productivity. The quantum software community has adopted Python on a number of large-scale efforts due to these characteristics, as well as \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "24", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Alexeev:2023:ISI, author = "Yuri Alexeev and Alex McCaskey and Wibe de Jong", title = "Introduction to the Special Issue on Software Tools for Quantum Computing: {Part 2}", journal = j-TQC, volume = "4", number = "1", pages = "1:1--1:??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3574160", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Mar 11 09:17:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3574160", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "1", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Claudino:2023:BAQ, author = "Daniel Claudino and Alexander J. McCaskey and Dmitry I. Lyakh", title = "A Backend-agnostic, Quantum-classical Framework for Simulations of Chemistry in {C++}", journal = j-TQC, volume = "4", number = "1", pages = "2:1--2:??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3523285", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Mar 11 09:17:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3523285", abstract = "As quantum computing hardware systems continue to advance, the research and development of performant, scalable, and extensible software architectures, languages, models, and compilers is equally as important to bring this novel coprocessing capability to \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "2", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Xu:2023:AQC, author = "Yilun Xu and Gang Huang and Jan Balewski and Alexis Morvan and Kasra Nowrouzi and David I. Santiago and Ravi K. Naik and Brad Mitchell and Irfan Siddiqi", title = "Automatic Qubit Characterization and Gate Optimization with {QubiC}", journal = j-TQC, volume = "4", number = "1", pages = "3:1--3:??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3529397", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Mar 11 09:17:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3529397", abstract = "As the size and complexity of a quantum computer increases, quantum bit (qubit) characterization and gate optimization become complex and time-consuming tasks. Current calibration techniques require complicated and verbose measurements to tune up qubits \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "3", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Suau:2023:QGI, author = "Adrien Suau and Gabriel Staffelbach and Aida Todri-Sanial", title = "\pkg{qprof}: a \pkg{gprof}-Inspired Quantum Profiler", journal = j-TQC, volume = "4", number = "1", pages = "4:1--4:??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3529398", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Mar 11 09:17:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3529398", abstract = "We introduce qprof, a new and extensible quantum program profiler able to generate profiling reports of quantum circuits written using various quantum computing frameworks. We describe the internal structure and working of qprof and provide practical \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "4", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Smith:2023:LSN, author = "Ethan Smith and Marc Grau Davis and Jeffrey Larson and Ed Younis and Lindsay Bassman Oftelie and Wim Lavrijsen and Costin Iancu", title = "{LEAP}: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach", journal = j-TQC, volume = "4", number = "1", pages = "5:1--5:??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3548693", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Mar 11 09:17:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3548693", abstract = "While showing great promise, circuit synthesis techniques that combine numerical optimization with search over circuit structures face scalability challenges due to a large number of parameters, exponential search spaces, and complex objective functions. \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "5", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Nguyen:2023:TNQ, author = "Thien Nguyen and Dmitry Lyakh and Eugene Dumitrescu and David Clark and Jeff Larkin and Alexander McCaskey", title = "Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale", journal = j-TQC, volume = "4", number = "1", pages = "6:1--6:??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3547334", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Mar 11 09:17:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3547334", abstract = "The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "6", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Nannicini:2023:OQA, author = "Giacomo Nannicini and Lev S. Bishop and Oktay G{\"u}nl{\"u}k and Petar Jurcevic", title = "Optimal Qubit Assignment and Routing via Integer Programming", journal = j-TQC, volume = "4", number = "1", pages = "7:1--7:??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3544563", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Mar 11 09:17:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3544563", abstract = "We consider the problem of mapping a logical quantum circuit onto a given hardware with limited 2-qubit connectivity. We model this problem as an integer linear program, using a network flow formulation with binary variables that includes the initial \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "7", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Smith:2023:TES, author = "Kaitlin N. Smith and Gokul Subramanian Ravi and Prakash Murali and Jonathan M. Baker and Nathan Earnest and Ali Javadi-Cabhari and Frederic T. Chong", title = "{TimeStitch}: Exploiting Slack to Mitigate Decoherence in Quantum Circuits", journal = j-TQC, volume = "4", number = "1", pages = "8:1--8:??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3548778", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Mar 11 09:17:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3548778", abstract = "Quantum systems have the potential to demonstrate significant computational advantage, but current quantum devices suffer from the rapid accumulation of error that prevents the storage of quantum information over extended periods. The unintentional \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "8", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Tate:2023:BCQ, author = "Reuben Tate and Majid Farhadi and Creston Herold and Greg Mohler and Swati Gupta", title = "Bridging Classical and Quantum with {SDP} initialized warm-starts for {QAOA}", journal = j-TQC, volume = "4", number = "2", pages = "9:1--9:??", month = jun, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3549554", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Mar 21 06:27:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3549554", abstract = "We study the Quantum Approximate Optimization Algorithm (QAOA) in the context of the Max-Cut problem. Noisy quantum devices are only able to accurately execute QAOA at low circuit depths, while classically-challenging problem instances may call for a \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "9", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Li:2023:QLL, author = "Ang Li and Samuel Stein and Sriram Krishnamoorthy and James Ang", title = "{QASMBench}: a Low-Level Quantum Benchmark Suite for {NISQ} Evaluation and Simulation", journal = j-TQC, volume = "4", number = "2", pages = "10:1--10:??", month = jun, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3550488", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Mar 21 06:27:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3550488", abstract = "The rapid development of quantum computing (QC) in the NISQ era urgently demands a low-level benchmark suite and insightful evaluation metrics for characterizing the properties of prototype NISQ devices, the efficiency of QC programming compilers, \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "10", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Zheng:2023:BAC, author = "Muqing Zheng and Ang Li and Tam{\'a}s Terlaky and Xiu Yang", title = "A {Bayesian} Approach for Characterizing and Mitigating Gate and Measurement Errors", journal = j-TQC, volume = "4", number = "2", pages = "11:1--11:??", month = jun, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3563397", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Mar 21 06:27:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3563397", abstract = "Various noise models have been developed in quantum computing study to describe the propagation and effect of the noise that is caused by imperfect implementation of hardware. Identifying parameters such as gate and readout error rates is critical to \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "11", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Paler:2023:MLO, author = "Alexandru Paler and Lucian Sasu and Adrian-Catalin Florea and Razvan Andonie", title = "Machine Learning Optimization of Quantum Circuit Layouts", journal = j-TQC, volume = "4", number = "2", pages = "12:1--12:??", month = jun, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3565271", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Mar 21 06:27:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3565271", abstract = "The quantum circuit layout (QCL) problem involves mapping out a quantum circuit such that the constraints of the device are satisfied. We introduce a quantum circuit mapping heuristic, QXX, and its machine learning version, QXX-MLP. The latter \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "12", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Mariella:2023:QAS, author = "Nicola Mariella and Andrea Simonetto", title = "A Quantum Algorithm for the Sub-graph Isomorphism Problem", journal = j-TQC, volume = "4", number = "2", pages = "13:1--13:??", month = jun, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3569095", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Mar 21 06:27:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3569095", abstract = "We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number of qubits that \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "13", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Roch:2023:EPF, author = "Christoph Roch and Daniel Ratke and Jonas N{\"u}{\ss}lein and Thomas Gabor and Sebastian Feld", title = "The Effect of Penalty Factors of Constrained {Hamiltonians} on the Eigenspectrum in Quantum Annealing", journal = j-TQC, volume = "4", number = "2", pages = "14:1--14:??", month = jun, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3577202", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Mar 21 06:27:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3577202", abstract = "Constrained optimization problems are usually translated to (naturally unconstrained) Ising formulations by introducing soft penalty terms for the previously hard constraints. In this work, we empirically demonstrate that assigning the appropriate weight \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "14", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Cuomo:2023:OCD, author = "Daniele Cuomo and Marcello Caleffi and Kevin Krsulich and Filippo Tramonto and Gabriele Agliardi and Enrico Prati and Angela Sara Cacciapuoti", title = "Optimized Compiler for Distributed Quantum Computing", journal = j-TQC, volume = "4", number = "2", pages = "15:1--15:??", month = jun, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3579367", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Mar 21 06:27:44 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3579367", abstract = "Practical distributed quantum computing requires the development of efficient compilers, able to make quantum circuits compatible with some given hardware constraints. This problem is known to be tough, even for local computing. Here, we address it on \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "15", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Deng:2023:ANA, author = "Haowei Deng and Yuxiang Peng and Michael Hicks and Xiaodi Wu", title = "Automating {NISQ} Application Design with {Meta Quantum Circuits with Constraints (MQCC)}", journal = j-TQC, volume = "4", number = "3", pages = "16:1--16:??", month = sep, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3579369", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jul 5 07:22:12 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3579369", abstract = "Near-term intermediate scale quantum (NISQ) computers are likely to have very restricted hardware resources, where precisely controllable qubits are expensive, error-prone, and scarce. Programmers of such computers must therefore balance trade-offs among \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "16", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Raymond:2023:HQA, author = "Jack Raymond and Radomir Stevanovic and William Bernoudy and Kelly Boothby and Catherine C. McGeoch and Andrew J. Berkley and Pau Farr{\'e} and Joel Pasvolsky and Andrew D. King", title = "Hybrid Quantum Annealing for Larger-than-{QPU} Lattice-structured Problems", journal = j-TQC, volume = "4", number = "3", pages = "17:1--17:??", month = sep, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3579368", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jul 5 07:22:12 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3579368", abstract = "Quantum processing units (QPUs) executing annealing algorithms have shown promise in optimization and simulation applications. Hybrid algorithms are a natural bridge to larger applications. We present a simple greedy method for solving larger-than-QPU \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "17", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Arrighi:2023:AQG, author = "Pablo Arrighi and Christopher Cedzich and Marin Costes and Ulysse R{\'e}mond and Beno{\^\i}t Valiron", title = "Addressable Quantum Gates", journal = j-TQC, volume = "4", number = "3", pages = "18:1--18:??", month = sep, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3581760", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jul 5 07:22:12 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3581760", abstract = "We extend the circuit model of quantum computation so that the wiring between gates is soft-coded within registers inside the gates. The addresses in these registers can be manipulated and put into superpositions. This aims at capturing indefinite causal \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "18", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Shaydulin:2023:PTQ, author = "Ruslan Shaydulin and Phillip C. Lotshaw and Jeffrey Larson and James Ostrowski and Travis S. Humble", title = "Parameter Transfer for Quantum Approximate Optimization of Weighted {MaxCut}", journal = j-TQC, volume = "4", number = "3", pages = "19:1--19:??", month = sep, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3584706", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jul 5 07:22:12 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3584706", abstract = "Finding high-quality parameters is a central obstacle to using the quantum approximate optimization algorithm (QAOA). Previous work partially addresses this issue for QAOA on unweighted MaxCut problems by leveraging similarities in the objective landscape \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "19", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Chakrabarti:2023:QAE, author = "Shouvanik Chakrabarti and Andrew M. Childs and Shih-Han Hung and Tongyang Li and Chunhao Wang and Xiaodi Wu", title = "Quantum Algorithm for Estimating Volumes of Convex Bodies", journal = j-TQC, volume = "4", number = "3", pages = "20:1--20:??", month = sep, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3588579", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jul 5 07:22:12 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3588579", abstract = "Estimating the volume of a convex body is a central problem in convex geometry and can be viewed as a continuous version of counting. We present a quantum algorithm that estimates the volume of an n-dimensional convex body within multiplicative error \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "20", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Li:2023:QBI, author = "Hai-Sheng Li and Jinhui Quan and Shuxiang Song and Yuxing Wei and Li Qing", title = "Quantum Bilinear Interpolation Algorithms Based on Geometric Centers", journal = j-TQC, volume = "4", number = "3", pages = "21:1--21:??", month = sep, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3591364", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jul 5 07:22:12 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3591364", abstract = "Bilinear interpolation is widely used in classical signal and image processing. Quantum algorithms have been designed for efficiently realizing bilinear interpolation. However, these quantum algorithms have limitations in circuit width and garbage outputs,. \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "21", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Matteo:2023:QCD, author = "Olivia {Di Matteo} and Josh Izaac and Thomas R. Bromley and Anthony Hayes and Christina Lee and Maria Schuld and Antal Sz{\'a}va and Chase Roberts and Nathan Killoran", title = "Quantum Computing with Differentiable Quantum Transforms", journal = j-TQC, volume = "4", number = "3", pages = "22:1--22:??", month = sep, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3592622", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jul 5 07:22:12 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3592622", abstract = "We present a framework for differentiable quantum transforms. Such transforms are metaprograms capable of manipulating quantum programs in a way that preserves their differentiability. We highlight their potential with a set of relevant examples across \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "22", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Peham:2023:OSQ, author = "Tom Peham and Lukas Burgholzer and Robert Wille", title = "On Optimal Subarchitectures for Quantum Circuit Mapping", journal = j-TQC, volume = "4", number = "4", pages = "23:1--23:??", month = dec, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3593594", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:48 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3593594", abstract = "Compiling a high-level quantum circuit down to a low-level description that can be executed on state-of-the-art quantum computers is a crucial part of the software stack for quantum computing. One step in compiling a quantum circuit to some device is \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "23", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Yuen:2023:RSC, author = "Henry Yuen and Ashwin Nayak", title = "Rigidity of Superdense Coding", journal = j-TQC, volume = "4", number = "4", pages = "24:1--24:??", month = dec, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3593593", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:48 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3593593", abstract = "The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary protocol for \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "24", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Perriello:2023:IEQ, author = "Simone Perriello and Alessandro Barenghi and Gerardo Pelosi", title = "Improving the Efficiency of Quantum Circuits for Information Set Decoding", journal = j-TQC, volume = "4", number = "4", pages = "25:1--25:??", month = dec, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3607256", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:48 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3607256", abstract = "Code-based cryptosystems are a promising option for Post-Quantum Cryptography, as neither classical nor quantum algorithms provide polynomial time solvers for their underlying hard problem. Indeed, to provide sound alternatives to lattice-based \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "25", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Bowman:2023:HCO, author = "Max Aksel Bowman and Pranav Gokhale and Jeffrey Larson and Ji Liu and Martin Suchara", title = "Hardware-Conscious Optimization of the Quantum {Toffoli} Gate", journal = j-TQC, volume = "4", number = "4", pages = "26:1--26:??", month = dec, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3609229", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:48 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3609229", abstract = "While quantum computing holds great potential in combinatorial optimization, electronic structure calculation, and number theory, the current era of quantum computing is limited by noisy hardware. Many quantum compilation approaches can mitigate the \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "26", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Alvarez:2023:GEP, author = "Gonzalo Alvarez and Ryan Bennink and Stephan Irle and Jacek Jakowski", title = "Gene Expression Programming for Quantum Computing", journal = j-TQC, volume = "4", number = "4", pages = "27:1--27:??", month = dec, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3617691", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:48 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3617691", abstract = "We introduce QuantumGEP, a scientific computer program that uses gene expression programming (GEP) to find a quantum circuit that either (1) maps a given set of input states to a given set of output states or (2) transforms a fixed initial state to \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "27", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Lewis:2024:FVQ, author = "Marco Lewis and Sadegh Soudjani and Paolo Zuliani", title = "Formal Verification of Quantum Programs: Theory, Tools, and Challenges", journal = j-TQC, volume = "5", number = "1", pages = "1:1--1:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3624483", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:49 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3624483", abstract = "Over the past 27 years, quantum computing has seen a huge rise in interest from both academia and industry. At the current rate, quantum computers are growing in size rapidly backed up by the increase of research in the field. Significant efforts are \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "1", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{McGeoch:2024:MQU, author = "Catherine C. McGeoch and Pau Farr{\'e}", title = "Milestones on the Quantum Utility Highway: Quantum Annealing Case Study", journal = j-TQC, volume = "5", number = "1", pages = "2:1--2:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3625307", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:49 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3625307", abstract = "We introduce quantum utility, a new approach to evaluating quantum performance that aims to capture the user experience by considering the overhead costs associated with a quantum computation. A demonstration of quantum utility by the quantum processing \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "2", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Zhang:2024:CAD, author = "Fang Zhang and Xing Zhu and Rui Chao and Cupjin Huang and Linghang Kong and Guoyang Chen and Dawei Ding and Haishan Feng and Yihuai Gao and Xiaotong Ni and Liwei Qiu and Zhe Wei and Yueming Yang and Yang Zhao and Yaoyun Shi and Weifeng Zhang and Peng Zhou and Jianxin Chen", title = "A Classical Architecture for Digital Quantum Computers", journal = j-TQC, volume = "5", number = "1", pages = "3:1--3:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3626199", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:49 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3626199", abstract = "Scaling bottlenecks the making of digital quantum computers, posing challenges from both the quantum and the classical components. We present a classical architecture to cope with a comprehensive list of the latter challenges all at once, and implement it \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "3", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Paraskevopoulos:2024:SCS, author = "Nikiforos Paraskevopoulos and Fabio Sebastiano and Carmen G. Almudever and Sebastian Feld", title = "{SpinQ}: Compilation Strategies for Scalable Spin-Qubit Architectures", journal = j-TQC, volume = "5", number = "1", pages = "4:1--4:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3624484", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:49 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3624484", abstract = "Despite Noisy Intermediate-Scale Quantum devices being severely constrained, hardware- and algorithm-aware quantum circuit mapping techniques have been developed to enable successful algorithm executions. Not so much attention has been paid to mapping and \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "4", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Bhoumik:2024:ESD, author = "Debasmita Bhoumik and Ritajit Majumdar and Dhiraj Madan and Dhinakaran Vinayagamurthy and Shesha Raghunathan and Susmita Sur-Kolay", title = "Efficient Syndrome Decoder for Heavy Hexagonal {QECC} via Machine Learning", journal = j-TQC, volume = "5", number = "1", pages = "5:1--5:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3636516", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:49 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3636516", abstract = "Error syndromes for heavy hexagonal code and other topological codes such as surface code have typically been decoded by using Minimum Weight Perfect Matching- (MWPM) based methods. Recent advances have shown that topological codes can be efficiently \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "5", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Vandaele:2024:OHG, author = "Vivien Vandaele and Simon Martiel and Simon Perdrix and Christophe Vuillot", title = "Optimal {Hadamard} Gate Count for {Clifford + $T$} Synthesis of {Pauli} Rotations Sequences", journal = j-TQC, volume = "5", number = "1", pages = "6:1--6:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3639062", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Mar 20 07:13:49 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3639062", abstract = "The Clifford+ T gate set is commonly used to perform universal quantum computation. In such setup the T gate is typically much more expensive to implement in a fault-tolerant way than Clifford gates. To improve the feasibility of fault-tolerant quantum \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "6", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Utt:2024:QMC, author = "Zachery Utt and Daniel Volya and Prabhat Mishra", title = "Quantum Measurement Classification Using Statistical Learning", journal = j-TQC, volume = "5", number = "2", pages = "7:1--7:??", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3644823", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jun 19 06:06:32 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3644823", abstract = "Interpreting the results of a quantum computer can pose a significant challenge due to inherent noise in these mesoscopic quantum systems. Quantum measurement, a critical component of quantum computing, involves determining the probabilities linked with \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "7", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Rosmanis:2024:HQC, author = "Ansis Rosmanis", title = "Hybrid Quantum-classical Search Algorithms", journal = j-TQC, volume = "5", number = "2", pages = "8:1--8:??", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3648573", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jun 19 06:06:32 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3648573", abstract = "Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover's algorithm are optimal, and no faster quantum algorithms for Search exist. While it is known that at least some quantum \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "8", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Gribling:2024:OLC, author = "Sander Gribling and Iordanis Kerenidis and D{\'a}niel Szil{\'a}gyi", title = "An Optimal Linear-combination-of-unitaries-based Quantum Linear System Solver", journal = j-TQC, volume = "5", number = "2", pages = "9:1--9:??", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3649320", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jun 19 06:06:32 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3649320", abstract = "Solving systems of linear equations is one of the most important primitives in many different areas, including in optimization, simulation, and machine learning. Quantum algorithms for solving linear systems have the potential to provide a quantum \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "9", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Zhan:2024:OIS, author = "Caitao Zhan and Himanshu Gupta and Mark Hillery", title = "Optimizing Initial State of Detector Sensors in Quantum Sensor Networks", journal = j-TQC, volume = "5", number = "2", pages = "10:1--10:??", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3655028", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jun 19 06:06:32 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3655028", abstract = "In this article, we consider a network of quantum sensors, where each sensor is a qubit detector that ``fires,'' i.e., its state changes when an event occurs close by. The change in state due to the firing of a detector is given by a unitary operator, which \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "10", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Ekeraa:2024:SPQ, author = "Martin Eker{\aa}", title = "On the Success Probability of Quantum Order Finding", journal = j-TQC, volume = "5", number = "2", pages = "11:1--11:??", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3655026", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jun 19 06:06:32 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3655026", abstract = "We prove a lower bound on the probability of Shor's order-finding algorithm successfully recovering the order r in a single run. The bound implies that by performing two limited searches in the classical post-processing part of the algorithm, a high \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "11", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Riofrio:2024:CQG, author = "Carlos A. Riofrio and Oliver Mitevski and Caitlin Jones and Florian Krellner and Aleksandar Vuckovic and Joseph Doetsch and Johannes Klepsch and Thomas Ehmer and Andre Luckow", title = "A Characterization of Quantum Generative Models", journal = j-TQC, volume = "5", number = "2", pages = "12:1--12:??", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3655027", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jun 19 06:06:32 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3655027", abstract = "Quantum generative modeling is a growing area of interest for industry-relevant applications. This work systematically compares a broad range of techniques to guide quantum computing practitioners when deciding which models and methods to use in their \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "12", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Chen:2024:QCC, author = "Daniel Tzu Shiuan Chen and Zain Hamid Saleem and Michael Alexandrovich Perlin", title = "Quantum Circuit Cutting for Classical Shadows", journal = j-TQC, volume = "5", number = "2", pages = "13:1--13:??", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3665335", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jun 19 06:06:32 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3665335", abstract = "Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be executed more \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "13", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Caro:2024:LQP, author = "Matthias C. Caro", title = "Learning Quantum Processes and {Hamiltonians} via the {Pauli} Transfer Matrix", journal = j-TQC, volume = "5", number = "2", pages = "14:1--14:??", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3670418", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jun 19 06:06:32 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3670418", abstract = "Learning about physical systems from quantum-enhanced experiments can outperform learning from experiments in which only classical memory and processing are available. Whereas quantum advantages have been established for state learning, quantum process \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "14", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Lee:2024:ARL, author = "Hochang Lee and Kyung Chul Jeong and Daewan Han and Panjin Kim", title = "An Algorithm for Reversible Logic Circuit Synthesis Based on Tensor Decomposition", journal = j-TQC, volume = "5", number = "3", pages = "15:1--15:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3673242", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Sep 4 06:38:15 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3673242", abstract = "An algorithm for reversible logic synthesis is proposed. The task is, for a given n -bit substitution map, to find a sequence of reversible logic gates that implements the map. The gate library adopted in this work consists of multiple-controlled Toffoli \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "15", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Biswal:2024:STF, author = "Laxmidhar Biswal and Debjyoti Bhattacharjee and Amlan Chakrabarti and Anupam Chattopadhyay", title = "Synthesis Techniques for Fault-tolerant Quantum Circuit Implementation using {Clifford} $ + {Z_N}$-group", journal = j-TQC, volume = "5", number = "3", pages = "16:1--16:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3673240", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Sep 4 06:38:15 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3673240", abstract = "Decoherence jeopardizes the entanglement of fragile quantum states, and is among the foremost challenges towards engineering scalable quantum computers. Realizing quantum circuit implementation with small qubit count and shallow circuit depth is necessary \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "16", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Akibue:2024:PUS, author = "Seiseki Akibue and Go Kato and Seiichiro Tani", title = "Probabilistic Unitary Synthesis with Optimal Accuracy", journal = j-TQC, volume = "5", number = "3", pages = "17:1--17:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3663576", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Sep 4 06:38:15 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3663576", abstract = "The purpose of unitary synthesis is to find a gate sequence that optimally approximates a target unitary transformation. A new synthesis approach, called probabilistic synthesis, has been introduced, and its superiority has been demonstrated over \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "17", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Lubinski:2024:OAQ, author = "Thomas Lubinski and Carleton Coffrin and Catherine McGeoch and Pratik Sathe and Joshua Apanavicius and David Bernal Neira and Quantum Economic Development Consortium(QED-C) Collaboration", title = "Optimization Applications as Quantum Performance Benchmarks", journal = j-TQC, volume = "5", number = "3", pages = "18:1--18:??", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3678184", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Sep 4 06:38:15 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3678184", abstract = "Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm and Quantum Annealing can potentially demonstrate significant run-time performance \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "18", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Dasgupta:2024:IUD, author = "Samudra Dasgupta and Travis Humble", title = "Impact of Unreliable Devices on Stability of Quantum Computations", journal = j-TQC, volume = "5", number = "4", pages = "22:1--22:??", month = dec, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3682071", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Dec 24 07:10:12 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3682071", abstract = "Noisy intermediate-scale quantum (NISQ) devices are valuable platforms for testing the tenets of quantum computing, but these devices are susceptible to errors arising from de-coherence, leakage, cross-talk, and other sources of noise. This raises \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "22", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Gemeinhardt:2024:MDF, author = "Felix Gemeinhardt and Antonio Garmendia and Manuel Wimmer and Robert Wille", title = "A Model-Driven Framework for Composition-Based Quantum Circuit Design", journal = j-TQC, volume = "5", number = "4", pages = "23:1--23:??", month = dec, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3688856", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Dec 24 07:10:12 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3688856", abstract = "Quantum programming languages support the design of quantum applications. However, to create such programs, one needs to understand the fundamental characteristics of quantum computing and quantum information theory. Furthermore, quantum algorithms \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "23", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Nowak:2024:OGT, author = "Wolfgang Nowak and Tim Bruennette and Merel Annelise Schalkers and Matthias M{\"o}ller", title = "Overdispersion in Gate Tomography: Experiments and Continuous, Two-Scale Random Walk Model on the {Bloch} Sphere", journal = j-TQC, volume = "5", number = "4", pages = "24:1--24:??", month = dec, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3688857", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Dec 24 07:10:12 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3688857", abstract = "Noisy intermediate-scale quantum computers (NISQ) are computing hardware in their childhood, but they are showing high promise and growing quickly. They are based on so-called qubits, which are the quantum equivalents of bits. Any given qubit state \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "24", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Leblond:2024:RCE, author = "Tyler Leblond and Christopher Dean and George Watkins and Ryan Bennink", title = "Realistic Cost to Execute Practical Quantum Circuits using Direct {Clifford+T} Lattice Surgery Compilation", journal = j-TQC, volume = "5", number = "4", pages = "25:1--25:??", month = dec, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3689826", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Dec 24 07:10:12 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3689826", abstract = "We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "25", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Pan:2024:EQC, author = "Feng Pan and Hanfeng Gu and Lvlin Kuang and Bing Liu and Pan Zhang", title = "Efficient Quantum Circuit Simulation by Tensor Network Methods on Modern {GPUs}", journal = j-TQC, volume = "5", number = "4", pages = "26:1--26:??", month = dec, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3696465", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Dec 24 07:10:12 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3696465", abstract = "Efficient simulation of quantum circuits has become indispensable with the rapid development of quantum hardware. The primary simulation methods are based on state vectors and tensor networks. As the number of qubits and quantum gates grows larger in \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "26", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Aktar:2024:SEB, author = "Shamminuj Aktar and Andreas B{\"a}rtschi and Abdel-Hameed A. Badawy and Stephan Eidenbenz", title = "Scalable Experimental Bounds for Entangled Quantum State Fidelities", journal = j-TQC, volume = "5", number = "4", pages = "27:1--27:??", month = dec, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3700885", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Dec 24 07:10:12 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3700885", abstract = "Estimating the state preparation fidelity of highly entangled states on noisy intermediate-scale quantum (NISQ) devices is important for benchmarking and application considerations. Unfortunately, exact fidelity measurements quickly become prohibitively \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "27", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Lugao:2024:MSS, author = "Pedro Lug{\~a}o and Renato Portugal and Mohamed Sabri and Hajime Tanaka", title = "Multimarked Spatial Search by Continuous-Time Quantum Walk", journal = j-TQC, volume = "5", number = "4", pages = "28:1--28:??", month = dec, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3706064", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Dec 24 07:10:12 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3706064", abstract = "The quantum-walk-based spatial search problem aims to find a marked vertex using a quantum walk on a graph with marked vertices. We describe a framework for determining the computational complexity of spatial search by continuous-time quantum walk on \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "28", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Matsuura:2025:WQC, author = "Anne Y. Matsuura and Timothy Mattson", title = "What Quantum Can Learn from Classical Computer Engineering", journal = j-TQC, volume = "6", number = "1", pages = "1:1--1:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3705007", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jan 18 06:15:21 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3705007", abstract = "Quantum computing represents a paradigm shift requiring reconceptualization of algorithms, architectures, and software. Although much is new, there is much that quantum computing can learn from traditional classical computer engineering. In this Special \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "1", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Fei:2025:STO, author = "Xinyu Fei and Lucas Brady and Jeffrey Larson and Sven Leyffer and Siqian Shen", title = "Switching Time Optimization for Binary Quantum Optimal Control", journal = j-TQC, volume = "6", number = "1", pages = "2:1--2:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3670416", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jan 18 06:15:21 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3670416", abstract = "Quantum optimal control is a technique for controlling the evolution of a quantum system and has been applied to a wide range of problems in quantum physics. We study a binary quantum control optimization problem, where control decisions are binary-valued \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "2", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Dobbs:2025:EQC, author = "Evan Dobbs and Joseph Friedman and Alexandru Paler", title = "Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers", journal = j-TQC, volume = "6", number = "1", pages = "3:1--3:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3670417", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jan 18 06:15:21 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3670417", abstract = "We design quantum circuits by using the standard cell approach borrowed from classical circuit design, which can speed up the layout of circuits with a regular structure. Our standard cells are general and can be used for all types of quantum circuits: \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "3", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Escofet:2025:RMQ, author = "Pau Escofet and Anabel Ovide and Medina Bandic and Luise Prielinger and Hans van Someren and Sebastian Feld and Eduard Alarcon and Sergi Abadal and Carmen Almudever", title = "Revisiting the Mapping of Quantum Circuits: Entering the Multi-core Era", journal = j-TQC, volume = "6", number = "1", pages = "4:1--4:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3655029", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jan 18 06:15:21 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3655029", abstract = "Quantum computing represents a paradigm shift in computation, offering the potential to solve complex problems intractable for classical computers. Although current quantum processors already consist of a few hundred qubits, their scalability remains a \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "4", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Yan:2025:LTY, author = "Fei Yan and Salvador E. Venegas-Andraca", title = "Lessons from Twenty Years of Quantum Image Processing", journal = j-TQC, volume = "6", number = "1", pages = "5:1--5:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3663577", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jan 18 06:15:21 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3663577", abstract = "Quantum image processing (QIMP) was first introduced in 2003 by Venegas-Andraca and Bose at the University of Oxford. This field attempts to overcome the limitations of classical computers and the potentially overwhelming complexity of classical \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "5", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Don:2025:QSQ, author = "Asitha Kottahachchi Kankanamge Don and Ibrahim Khalil", title = "{Q-SupCon}: Quantum-Enhanced Supervised Contrastive Learning Architecture within the Representation Learning Framework", journal = j-TQC, volume = "6", number = "1", pages = "6:1--6:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3660647", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jan 18 06:15:21 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3660647", abstract = "In the evolving landscape of data privacy regulations, the challenge of providing extensive data for robust deep classification models arises. The accuracy of these models relies on the amount of training data, due to the multitude of parameters that \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "6", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Volpe:2025:IES, author = "Deborah Volpe and Giovanni Amedeo Cirillo and Maurizio Zamboni and Mariagrazia Graziano and Giovanna Turvani", title = "Improving the exploitability of Simulated Adiabatic Bifurcation through a flexible and open-source digital architecture", journal = j-TQC, volume = "6", number = "1", pages = "7:1--7:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3665281", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jan 18 06:15:21 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3665281", abstract = "Combinatorial Optimization (CO) problems exhibit exponential complexity, constraining classical computers from providing fast and satisfactory outcomes. Quantum Computers (QCs) can effectively find optimal or near-optimal solutions by exploring the \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "7", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Mohammadisiahroudi:2025:IQI, author = "Mohammadhossein Mohammadisiahroudi and Zeguan Wu and Brandon Augustino and Arielle Carr and Tam{\'a}s Terlaky", title = "Improvements to Quantum Interior Point Method for Linear Optimization", journal = j-TQC, volume = "6", number = "1", pages = "8:1--8:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3702244", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jan 18 06:15:21 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3702244", abstract = "Quantum linear system algorithms (QLSAs) have the potential to speed up Interior Point Methods (IPMs). However, a major bottleneck is the inexactness of quantum tomography to extract classical solutions from quantum states. In addition, QLSAs are \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "8", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Shinde:2025:UCP, author = "Tejas Shinde and Ljubomir Budinski and Ossi Niemim{\"a}ki and Valtteri Lahtinen and Helena Liebelt and Rui Li", title = "Utilizing classical programming principles in the {Intel Quantum SDK}: implementation of quantum lattice {Boltzmann} method", journal = j-TQC, volume = "6", number = "1", pages = "9:1--9:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3678185", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jan 18 06:15:21 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3678185", abstract = "We explore the use of classical programming techniques in implementing the quantum lattice Boltzmann method in the Intel Quantum SDK-a software tool for quantum circuit creation and execution on Intel quantum hardware. As hardware access is limited, we \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "9", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Quetschlich:2025:MPA, author = "Nils Quetschlich and Lukas Burgholzer and Robert Wille", title = "{MQT Predictor}: Automatic Device Selection with Device-Specific Circuit Compilation for Quantum Computing", journal = j-TQC, volume = "6", number = "1", pages = "10:1--10:??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3673241", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jan 18 06:15:21 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", URL = "https://dl.acm.org/doi/10.1145/3673241", abstract = "Fueled by recent accomplishments in quantum computing hardware and software, an increasing number of problems from various application domains are being explored as potential use cases for this new technology. Similarly to classical computing, realizing \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "10", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{deBrugiere:2025:SCC, author = "Timoth{\'e}e Goubault de Brugi{\`e}re and Simon Martiel", title = "Shallower {CNOT} Circuits on Realistic Quantum Hardware", journal = j-TQC, volume = "6", number = "2", pages = "11:1--11:??", month = jun, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3700884", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Apr 18 06:16:18 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "We focus on the depth optimization of CNOT circuits on hardware with limited connectivity. We adapt the algorithm from Kutin et al. that implements any n -qubit CNOT circuit in depth at most 5n on a Linear Nearest Neighbor architecture. Our proposal is a \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "11", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Wagner:2025:EQA, author = "Friedrich Wagner and Jonas N{\"u}{\ss}lein and Frauke Liers", title = "Enhancing Quantum Algorithms for Quadratic Unconstrained Binary Optimization via Integer Programming", journal = j-TQC, volume = "6", number = "2", pages = "12:1--12:??", month = jun, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3711935", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Apr 18 06:16:18 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "To date, research in quantum computation promises potential for outperforming classical heuristics in combinatorial optimization. However, when aiming at provable optimality, one has to rely on classical exact methods like integer programming. State-of-. \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "12", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Burgholzer:2025:FBC, author = "Lukas Burgholzer and Antonio Jimenez-Pastor and Kim Guldstrand Larsen and Mirco Tribastone and Max Tschaikowski and Robert Wille", title = "Forward and Backward Constrained Bisimulations for Quantum Circuits Using Decision Diagrams", journal = j-TQC, volume = "6", number = "2", pages = "13:1--13:??", month = jun, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3712711", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Apr 18 06:16:18 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "Efficient methods for the simulation of quantum circuits on classical computers are crucial for their analysis due to the exponential growth of the problem size with the number of qubits. Here we study lumping methods based on bisimulation, an established \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "13", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Aizpurua:2025:HCP, author = "Borja Aizpurua and Pablo Bermejo and Josu Etxezarreta Mart{\'\i}nez and Rom{\'a}n Or{\'u}s", title = "Hacking Cryptographic Protocols with Advanced Variational Quantum Attacks", journal = j-TQC, volume = "6", number = "2", pages = "14:1--14:??", month = jun, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3718349", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Apr 18 06:16:18 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "Here we introduce an improved approach to Variational Quantum Attack Algorithms (VQAA) on cryptographic protocols. Our methods provide robust quantum attacks to well-known cryptographic algorithms, more efficiently and with remarkably fewer qubits than \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "14", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Zylberman:2025:EQC, author = "Julien Zylberman and Ugo Nzongani and Andrea Simonetto and Fabrice Debbasch", title = "Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy Trade-Offs", journal = j-TQC, volume = "6", number = "2", pages = "15:1--15:??", month = jun, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3718348", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Apr 18 06:16:18 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms with applications in the resolution of partial differential equations, Hamiltonian simulations, the loading of classical data on quantum computers (quantum \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "15", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Colisson:2025:NIN, author = "L{\'e}o Colisson and Fr{\'e}d{\'e}ric Grosshans and Elham Kashefi", title = "Non-Interactive and Non-Destructive Zero-Knowledge Proofs on Quantum States and Multi-Party Generation of Authorized Hidden {GHZ} States", journal = j-TQC, volume = "6", number = "2", pages = "16:1--16:??", month = jun, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3721487", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Apr 18 06:16:18 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "We propose the first generalization of the famous Non-Interactive Zero-Knowledge (NIZK) proofs to quantum languages (NIZKoQS) and we provide a protocol to prove advanced properties on a received quantum state non-destructively and non-interactively (a \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "16", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Childs:2025:QDC, author = "Andrew Childs and Robin Kothari and Matt Kovacs-Deak and Aarthi Sundaram and Daochen Wang", title = "Quantum Divide and Conquer", journal = j-TQC, volume = "6", number = "2", pages = "17:1--17:??", month = jun, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3723884", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Fri Apr 18 06:16:18 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "The divide-and-conquer framework, used extensively in classical algorithm design, recursively breaks a problem of size n into smaller subproblems (say, a copies of size $ n / b $ each), along with some auxiliary work of cost $ C^{\mathrm {aux}}(n) $, to \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "17", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Preskill:2025:BNM, author = "John Preskill", title = "Beyond {NISQ}: The Megaquop Machine", journal = j-TQC, volume = "6", number = "3", pages = "18:1--18:??", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3723153", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jul 26 08:22:49 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "Today's Noisy Intermediate-Scale Quantum (NISQ) computers have scientific value, but quantum machines with broad practical value must be protected against noise using quantum error correction and fault-tolerant protocols. Recent studies of quantum error \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "18", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Ito:2025:ATQ, author = "Takehiro Ito and Naonori Kakimura and Naoyuki Kamiyama and Yusuke Kobayashi and Yoshio Okamoto", title = "Algorithmic Theory of Qubit Routing in the Linear Nearest Neighbor Architectures", journal = j-TQC, volume = "6", number = "3", pages = "19:1--19:??", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3722119", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jul 26 08:22:49 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "The qubit routing problem, also known as the swap minimization problem, is a (classical) combinatorial optimization problem that arises in the design of compilers of quantum programs. We study the qubit routing problem from the viewpoint of theoretical \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "19", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Robertson:2025:AQC, author = "Niall Robertson and Albert Akhriev and Jiri Vala and Sergiy Zhuk", title = "Approximate Quantum Compiling for Quantum Simulation: a Tensor Network Based Approach", journal = j-TQC, volume = "6", number = "3", pages = "20:1--20:??", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3731251", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jul 26 08:22:49 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "We introduce AQCtensor, a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS). Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum many-body \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "20", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Cai:2025:QAD, author = "Jin-Yi Cai and Ben Young", title = "Quantum Algorithms for Discrete Log Require Precise Rotations", journal = j-TQC, volume = "6", number = "3", pages = "21:1--21:??", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3736421", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jul 26 08:22:49 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "Recently, Cai [ 3 ] showed that Shor's quantum factoring algorithm fails to factor large integers when algorithm's quantum Fourier transform (QFT) is corrupted by a vanishing level of random noise on the QFT's precise controlled rotation gates. We show that \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "21", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Kattemolle:2025:LGQ, author = "Joris Kattem{\"o}lle and Seenivasan Hariharan", title = "Line-Graph Qubit Routing", journal = j-TQC, volume = "6", number = "3", pages = "22:1--22:??", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3733842", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jul 26 08:22:49 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "One limitation of current quantum hardware is the restricted connectivity between qubits, as described by the hardware's coupling graph. To overcome this limitation, efficient qubit routing strategies are necessary. We introduce line-graph qubit routing, \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "22", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Difranco:2025:QPL, author = "Giuliano Difranco and Lindsay Bassman Oftelie", title = "{QuL}: Programming Library for Computational Cooling of Qubits", journal = j-TQC, volume = "6", number = "3", pages = "23:1--23:??", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3737887", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jul 26 08:22:49 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "A key hurdle to the success of quantum computers is the ability to initialize qubits into a pure state, which can be achieved by cooling qubits down to very low temperatures. Computational cooling of qubits, whereby a subset of the qubits is cooled at the \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "23", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Elsharkawy:2025:IQA, author = "Amr Elsharkawy and Xiao-Ting Michelle To and Philipp Seitz and Yanbin Chen and Yannick Stade and Manuel Geiger and Qunsheng Huang and Xiaorang Guo and Muhammad Arslan Ansari and Christian B. Mendl and Dieter Kranzlm{\"u}ller and Martin Schulz", title = "Integration of Quantum Accelerators with High Performance Computing --- a Review of Quantum Programming Tools", journal = j-TQC, volume = "6", number = "3", pages = "24:1--24:??", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3743149", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jul 26 08:22:49 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "Quantum computing (QC) introduces a novel mode of computation with the possibility of greater computational power that remains to be exploited, presenting exciting opportunities for high-performance computing (HPC) applications. However, recent advancements \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "24", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Wang:2025:OTD, author = "Siyi Wang and Ankit Mondal and Anupam Chattopadhyay", title = "Optimal {Toffoli}-Depth Quantum Adder", journal = j-TQC, volume = "6", number = "3", pages = "25:1--25:??", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3743691", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Jul 26 08:22:49 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "Efficient quantum arithmetic circuits are commonly found in numerous quantum algorithms of practical significance. To date, the logarithmic-depth quantum adders include a constant coefficient k {$>$}= 2 while achieving the Toffoli-Depth of k log n + O(1). In \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "25", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{deCarvalho:2025:QMS, author = "Jos{\'e} Alex de Carvalho and Carlos Batista and Tiago de Veras and Israel Araujo and Adenilton Jos{\'e} da Silva", title = "Quantum Multiplexer Simplification for State Preparation", journal = j-TQC, volume = "6", number = "4", pages = "26:1--26:12", month = dec, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3748260", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Nov 4 10:55:55 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build the quantum \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "26", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Teranishi:2025:LQR, author = "Yusuke Teranishi and Shoma Hiraoka and Wataru Mizukami and Masao Okita and Fumihiko Ino", title = "Lazy Qubit Reordering for Accelerating Parallel State-Vector-based Quantum Circuit Simulation", journal = j-TQC, volume = "6", number = "4", pages = "27:1--27:33", month = dec, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3748261", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Nov 4 10:55:55 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "This article proposes two quantum operation scheduling methods for accelerating parallel state-vector-based quantum circuit simulation using multiple graphics processing units (GPUs). The proposed methods reduce all-to-all communication caused by qubit \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "27", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Huang:2025:ASQ, author = "Yuxin Huang and Benjamin Grossman-Ponemon and David Hyde", title = "Automated Synthesis of Quantum Algorithms via Classical Numerical Techniques", journal = j-TQC, volume = "6", number = "4", pages = "28:1--28:24", month = dec, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3757068", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Nov 4 10:55:55 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these classical domains and \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "28", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Vu:2025:LDA, author = "Dinh-Long Vu and Bin Cheng and Patrick Rebentrost", title = "Low-depth Amplitude Estimation without Really Trying", journal = j-TQC, volume = "6", number = "4", pages = "29:1--29:23", month = dec, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3748666", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Nov 4 10:55:55 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "Standard quantum amplitude estimation algorithms provide quadratic speedup to Monte-Carlo simulations but require a circuit depth that scales as inverse of the estimation error. In view of the shallow depth in near-term devices, the precision achieved by \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "29", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Sundaram:2025:DQD, author = "Ranjani Sundaram and Himanshu Gupta and CR Ramakrishnan", title = "{DQC-QR}: Distributing and Routing Quantum Circuits with Minimum Execution Time", journal = j-TQC, volume = "6", number = "4", pages = "30:1--30:26", month = dec, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3757069", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Nov 4 10:55:55 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is a promising way \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "30", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Bremner:2025:PCW, author = "Michael Bremner and Zhengfeng Ji and Xingjian Li and Luke Mathieson and Mauro Morales", title = "Parameterized Complexity of Weighted Local {Hamiltonian} Problems and the Quantum Exponential Time Hypothesis", journal = j-TQC, volume = "6", number = "4", pages = "31:1--31:36", month = dec, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3759156", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Nov 4 10:55:55 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computational basis states of Hamming weight k. The Hamming weight constraint can \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "31", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Ikenmeyer:2025:KCB, author = "Christian Ikenmeyer and Sathyawageeswar Subramanian", title = "{Kronecker} Coefficients in {{\#BQP}}", journal = j-TQC, volume = "6", number = "4", pages = "32:1--32:13", month = dec, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3762673", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Tue Nov 4 10:55:55 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "We prove that the computation of the Kronecker coefficients of the symmetric group is contained in the complexity class \#BQP. This improves a recent result of Bravyi, Chowdhury, Gosset, Havlicek, and Zhu. We use the same quantum algorithmic tools that are \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "32", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Surana:2026:VQF, author = "Amit Surana and Abeynaya Gnanasekaran", title = "Variational Quantum Framework for Partial Differential Equation Constrained Optimization", journal = j-TQC, volume = "7", number = "1", pages = "1:1--1:36", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3762671", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jan 14 07:12:12 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "1", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Ngo:2026:CCB, author = "Hoang Ngo and Nguyen Do and Minh Vu and Tre Jeter and Tamer Kahveci and My Thai", title = "{CHARME}: a Chain-based Reinforcement Learning Approach for the Minor Embedding Problem", journal = j-TQC, volume = "7", number = "1", pages = "2:1--2:28", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3763244", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jan 14 07:12:12 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "2", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Cicero:2026:SQC, author = "Alessio Cicero and Mohammad Ali Maleki and Muhammad Waqar Azhar and Anton Frisk Kockum and Pedro Trancoso", title = "Simulation of Quantum Computers: Review and Acceleration Opportunities", journal = j-TQC, volume = "7", number = "1", pages = "3:1--3:35", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3762672", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jan 14 07:12:12 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", abstract = "Quantum computing has the potential to revolutionise multiple fields by solving complex problems that cannot be solved in reasonable time with current classical computers. Nevertheless, the development of quantum computers is still in its early stages and \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "3", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Hainry:2026:PQP, author = "Emmanuel Hainry and Romain P{\'e}choux and M{\'a}rio Silva", title = "A Polytime Quantum Programming Language", journal = j-TQC, volume = "7", number = "1", pages = "4:1--4:32", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3769851", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jan 14 07:12:12 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "4", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Wang:2026:NHL, author = "Frank Zhigang Wang", title = "Near-{Heisenberg}-limit Quantum Computing", journal = j-TQC, volume = "7", number = "1", pages = "5:1--5:15", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3769850", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jan 14 07:12:12 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "5", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Chia:2026:CPV, author = "Nai-Hui Chia and Honghao Fu and Fang Song and Penghui Yao", title = "A Cryptographic Perspective on the Verifiability of Quantum Advantage", journal = j-TQC, volume = "7", number = "1", pages = "6:1--6:20", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3773903", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jan 14 07:12:12 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "6", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Ngo:2026:FRL, author = "Hoang M. Ngo and Tamer Kahveci and My T. Thai", title = "{FIDDLE}: Reinforcement Learning for Quantum Fidelity Enhancement", journal = j-TQC, volume = "7", number = "1", pages = "7:1--7:28", month = mar, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3773909", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Wed Jan 14 07:12:12 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Quantum Comput.", articleno = "7", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", }