Valid HTML 4.0! Valid CSS!
%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.05",
%%%     date            = "28 January 2022",
%%%     time            = "07:24:00 MST",
%%%     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",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "46328 1054 4963 47807",
%%%     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.05, the COMPLETE journal
%%%                        coverage looked like this:
%%%
%%%                             2020 (   6)    2021 (  19)    2022 (   4)
%%%
%%%                             Article:         29
%%%
%%%                             Total entries:   29
%%%
%%%                        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,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://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 =    "http://www.math.utah.edu/pub/tex/bib/tqc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3411487",
  acknowledgement = ack-nhfb,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://www.math.utah.edu/pub/tex/bib/tqc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3488391",
  acknowledgement = ack-nhfb,
  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 =    "http://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,
  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 =    "http://www.math.utah.edu/pub/tex/bib/tqc.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3488389",
  acknowledgement = ack-nhfb,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://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,
  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 =    "http://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 http://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,
  articleno =    "4",
  fjournal =     "ACM Transactions on Quantum Computing (TQC)",
  journal-URL =  "https://dl.acm.org/loi/tqc",
}