@Preamble{"\input bibnames.sty" #
"\ifx \undefined \booktitle \def \booktitle #1{{{\em #1}}} \fi" #
"\ifx \undefined \TM \def \TM {${}^{\sc TM}$} \fi"
}
@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/|"}
@String{j-TQC = "ACM Transactions on Quantum Computing (TQC)"}
@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",
}
@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 = "http://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,
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 = "http://www.math.utah.edu/pub/tex/bib/tqc.bib",
URL = "https://dl.acm.org/doi/10.1145/3501334",
acknowledgement = ack-nhfb,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://www.math.utah.edu/pub/tex/bib/tqc.bib",
URL = "https://dl.acm.org/doi/10.1145/3532179",
acknowledgement = ack-nhfb,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://www.math.utah.edu/pub/tex/bib/python.bib;
http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://www.math.utah.edu/pub/tex/bib/python.bib;
http://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,
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 = "http://www.math.utah.edu/pub/tex/bib/tqc.bib",
URL = "https://dl.acm.org/doi/10.1145/3574160",
acknowledgement = ack-nhfb,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
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 = "http://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,
articleno = "15",
fjournal = "ACM Transactions on Quantum Computing (TQC)",
journal-URL = "https://dl.acm.org/loi/tqc",
}
