Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2024JUST ACCEPTED
Overdispersion in gate tomography: Experiments and continuous, two-scale random walk model on the Bloch sphere
Noisy intermediate-scale quantum computers (NISQ) are computing hardware in their childhood, but they are showing high promise and growing quickly. They are based on so-called qubits, which are the quantum equivalents of bits. Any given qubit state ...
- research-articleJune 2024
- research-articleJuly 2023
On Optimal Subarchitectures for Quantum Circuit Mapping
ACM Transactions on Quantum Computing (TQC), Volume 4, Issue 4Article No.: 23, Pages 1–20https://doi.org/10.1145/3593594Compiling a high-level quantum circuit down to a low-level description that can be executed on state-of-the-art quantum computers is a crucial part of the software stack for quantum computing. One step in compiling a quantum circuit to some device is ...
- research-articleJuly 2023
Rigidity of Superdense Coding
ACM Transactions on Quantum Computing (TQC), Volume 4, Issue 4Article No.: 24, Pages 1–39https://doi.org/10.1145/3593593The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary protocol for ...
- research-articleMarch 2023
The Effect of Penalty Factors of Constrained Hamiltonians on the Eigenspectrum in Quantum Annealing
ACM Transactions on Quantum Computing (TQC), Volume 4, Issue 2Article No.: 14, Pages 1–18https://doi.org/10.1145/3577202Constrained 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 ...
- research-articleFebruary 2023
Optimized Compiler for Distributed Quantum Computing
- Daniele Cuomo,
- Marcello Caleffi,
- Kevin Krsulich,
- Filippo Tramonto,
- Gabriele Agliardi,
- Enrico Prati,
- Angela Sara Cacciapuoti
ACM Transactions on Quantum Computing (TQC), Volume 4, Issue 2Article No.: 15, Pages 1–29https://doi.org/10.1145/3579367Practical 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 ...
- research-articleFebruary 2023
A Quantum Algorithm for the Sub-graph Isomorphism Problem
ACM Transactions on Quantum Computing (TQC), Volume 4, Issue 2Article No.: 13, Pages 1–34https://doi.org/10.1145/3569095We 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 ...
- research-articleFebruary 2023
A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors
ACM Transactions on Quantum Computing (TQC), Volume 4, Issue 2Article No.: 11, Pages 1–21https://doi.org/10.1145/3563397Various 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 ...
- research-articleJuly 2022
Computing Eigenvalues of Diagonalizable Matrices on a Quantum Computer
ACM Transactions on Quantum Computing (TQC), Volume 3, Issue 4Article No.: 21, Pages 1–20https://doi.org/10.1145/3527845Computing 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 ...
- research-articleMarch 2022
Quantum Linear System Solver Based on Time-optimal Adiabatic Quantum Computing and Quantum Approximate Optimization Algorithm
ACM Transactions on Quantum Computing (TQC), Volume 3, Issue 2Article No.: 5, Pages 1–28https://doi.org/10.1145/3498331We demonstrate that with an optimally tuned scheduling function, adiabatic quantum computing (AQC) can readily solve a quantum linear system problem (QLSP) with O(κ poly(log (κ ε))) runtime, where κ is the condition number, and ε is the target accuracy. ...
- research-articleJanuary 2022
Improving the Variational Quantum Eigensolver Using Variational Adiabatic Quantum Computing
- Stuart M. Harwood,
- Dimitar Trenev,
- Spencer T. Stober,
- Panagiotis Barkoutsos,
- Tanvi P. Gujarati,
- Sarah Mostame,
- Donny Greenberg
ACM Transactions on Quantum Computing (TQC), Volume 3, Issue 1Article No.: 1, Pages 1–20https://doi.org/10.1145/3479197The 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 ...
- research-articleDecember 2021
On the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing
ACM Transactions on Quantum Computing (TQC), Volume 2, Issue 4Article No.: 18, Pages 1–21https://doi.org/10.1145/3478519Mapping 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 ...
- research-articleDecember 2021
Completeness of Graphical Languages for Mixed State Quantum Mechanics
ACM Transactions on Quantum Computing (TQC), Volume 2, Issue 4Article No.: 17, Pages 1–28https://doi.org/10.1145/3464693There 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 †-...
- research-articleFebruary 2021
Multilevel Combinatorial Optimization across Quantum Architectures
- Hayato Ushijima-Mwesigwa,
- Ruslan Shaydulin,
- Christian F. A. Negre,
- Susan M. Mniszewski,
- Yuri Alexeev,
- Ilya Safro
ACM Transactions on Quantum Computing (TQC), Volume 2, Issue 1Article No.: 1, Pages 1–29https://doi.org/10.1145/3425607Emerging 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 ...
- research-articleOctober 2020
A Quantum Interior Point Method for LPs and SDPs
ACM Transactions on Quantum Computing (TQC), Volume 1, Issue 1Article No.: 5, Pages 1–32https://doi.org/10.1145/3406306We present a quantum interior point method (IPM) for semi-definite programs that has a worst-case running time of Õ(n2.5 / ξ2 μ κ 3 log(1/ϵ)). The algorithm outputs a pair of matrices (S,Y) that have objective value within ϵ of the optimal and satisfy ...