Valid HTML 4.0! Valid CSS!
%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.00",
%%%     date            = "10 March 2021",
%%%     time            = "06:49:13 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        = "00443 387 1773 16928",
%%%     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.00, the COMPLETE journal
%%%                        coverage looked like this:
%%%
%%%                             2020 (   6)    2021 (   3)
%%%
%%%                             Article:          9
%%%
%%%                             Total entries:    9
%%%
%%%                        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 =         "????",
  ISSN-L =       "????",
  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 =         "????",
  ISSN-L =       "????",
  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 =         "????",
  ISSN-L =       "????",
  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 =         "????",
  ISSN-L =       "????",
  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 =         "????",
  ISSN-L =       "????",
  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 =         "????",
  ISSN-L =       "????",
  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 =         "????",
  ISSN-L =       "????",
  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 =         "????",
  ISSN-L =       "????",
  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 =         "????",
  ISSN-L =       "????",
  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",
}

%%% [10-Mar-2021] v2n1 is not yet complete