Query and Depth Upper Bounds for Quantum Unitaries via Grover Search

Depth hierarchy theorem proves increasing depth strictly increases power in constant-depth quantum circuits

Circuit depth is a central resource in complexity theory. While bounded-depth classical circuits admit well-understood hierarchy theorems, t

New bounds dramatically reduce measurement requirements for quantum simulations

Previously, simulating open quantum systems with the Wave Matrix Lindbladization algorithm required computational effort scaling with the sy

Verification of Quantum Computations: Hardware-Efficient Security Proofs

How can a user with limited quantum resources verify the output of an untrusted, fully quantum server? This manuscript provides a conceptual

Alternative adiabatic quantum dynamics for gate-based quantum computing with applications to quantum linear systems

In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the n

ACM Transactions on Quantum Computing (tqc) Vol 7, Issue 2

ACM Transactions on Quantum Computing (tqc) Vol 7, Issue 3