Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Volume 5, Issue 2June 2024
Editor:
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
EISSN:2643-6817
Reflects downloads up to 09 Nov 2024Bibliometrics
Skip Table Of Content Section
research-article
Quantum Measurement Classification Using Statistical Learning
Article No.: 7, Pages 1–16https://doi.org/10.1145/3644823

Interpreting the results of a quantum computer can pose a significant challenge due to inherent noise in these mesoscopic quantum systems. Quantum measurement, a critical component of quantum computing, involves determining the probabilities linked with ...

research-article
Hybrid Quantum-classical Search Algorithms
Article No.: 8, Pages 1–18https://doi.org/10.1145/3648573

Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover’s algorithm are optimal, and no faster quantum algorithms for Search exist. While it is known that at least some quantum ...

research-article
An Optimal Linear-combination-of-unitaries-based Quantum Linear System Solver
Article No.: 9, Pages 1–23https://doi.org/10.1145/3649320

Solving systems of linear equations is one of the most important primitives in many different areas, including in optimization, simulation, and machine learning. Quantum algorithms for solving linear systems have the potential to provide a quantum ...

research-article
Open Access
Optimizing Initial State of Detector Sensors in Quantum Sensor Networks
Article No.: 10, Pages 1–25https://doi.org/10.1145/3655028

In this article, we consider a network of quantum sensors, where each sensor is a qubit detector that “fires,” i.e., its state changes when an event occurs close by. The change in state due to the firing of a detector is given by a unitary operator, which ...

research-article
Open Access
On the Success Probability of Quantum Order Finding
Article No.: 11, Pages 1–40https://doi.org/10.1145/3655026

We prove a lower bound on the probability of Shor’s order-finding algorithm successfully recovering the order r in a single run. The bound implies that by performing two limited searches in the classical post-processing part of the algorithm, a high ...

review-article
A Characterization of Quantum Generative Models
Article No.: 12, Pages 1–34https://doi.org/10.1145/3655027

Quantum generative modeling is a growing area of interest for industry-relevant applications. This work systematically compares a broad range of techniques to guide quantum computing practitioners when deciding which models and methods to use in their ...

research-article
Open Access
Quantum Circuit Cutting for Classical Shadows
Article No.: 13, Pages 1–21https://doi.org/10.1145/3665335

Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be executed more ...

research-article
Open Access
Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix
Article No.: 14, Pages 1–53https://doi.org/10.1145/3670418

Learning about physical systems from quantum-enhanced experiments can outperform learning from experiments in which only classical memory and processing are available. Whereas quantum advantages have been established for state learning, quantum process ...

Subjects

Comments