The Unitary Synthesis Problem (Aaronson-Kuperberg 2007) asks whether any n-qubit
unitary U can be implemented by an efficient quantum algorithm A augmented with an …

There are two types of universality in measurement-based quantum computation (MBQC):
strict and computational. It is well known that the former is stronger than the latter. We …

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 …

Driven by exploring the power of quantum computation with a limited number of qubits, we
present a novel complete characterization for space-bounded quantum computation, which …

We provide a generic construction to turn any classical Zero-Knowledge (ZK) protocol into a
composable (quantum) oblivious transfer (OT) protocol, mostly lifting the round-complexity …

The generation and verification of quantum states are fundamental tasks for quantum
information processing that have recently been investigated by Irani, Natarajan, Nirkhe, Rao …

Complexity theory typically focuses on the difficulty of solving computational problems using
classical inputs and outputs, even with a quantum computer. In the quantum world, it is …

Every year, substantial theoretical and experimental progress is made towards the
realisation of a genuinely new computational paradigm in the construction of a quantum …

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

This work investigates the relationships between quantum state synthesis complexity
classes (a recent concept in computational complexity that focuses on the complexity of …