How to efficiently encode classical data is a fundamental task in quantum computing. While
many existing works treat classical data encoding as a black box in oracle-based quantum …

Efficient synthesis of arbitrary quantum states and unitaries from a universal fault-tolerant
gate-set eg Clifford+ T is a key subroutine in quantum computation. As large quantum …

Efficient suppression of errors without full error correction is crucial for applications with
noisy intermediate-scale quantum devices. Error mitigation allows us to suppress errors in …

We present a polynomial-time quantum algorithm making a single query (in superposition)
to a classical oracle, such that for every state| ψ〉 there exists a choice of oracle that makes …

Though there has been substantial progress in developing quantum algorithms to study
classical datasets, the cost of simply loading classical data is an obstacle to quantum …

We construct the primitive gate set for the digital quantum simulation of the 108-element Σ
(36× 3) group. This is the first time a non-Abelian crystal-like subgroup of SU (3) has been …

Graph Neural Networks (GNNs) are powerful machine learning models that excel at
analyzing structured data represented as graphs, demonstrating remarkable performance in …

The quantum object optimizer (< qo| op>) is a Python library that offers a framework for
optimizing quantum circuits to represent quantum objects such as quantum states and …

Many natural problems in quantum computing involve constructing a quantum state or
implementing a unitary transformation. However, relatively little is known about the …

We investigate the quantum Zeno effect as a framework for designing and analyzing
quantum algorithms for Hamiltonian simulation. We show that frequent projective …