Related papers: Quantum Oracles in Constant Depth with Measurement…
Projective measurements with high quantum efficiency is often assumed to be required for efficient circuit based quantum computing. We argue that this is not the case and show that this fact has actually be known previously though not…
The concept of intrinsic and operational observables in quantum mechanics is introduced. In any realistic description of a quantum measurement that includes a macroscopic detecting device, it is possible to construct from the statistics of…
Programming a quantum computer, i.e., implementing quantum algorithms on a quantum processor-based copmputer architecture, is a task that can be addressed (just as for classical computers) at different levels of abstraction. This paper…
Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a…
Quantum reservoir computing (QRC) is a hardware-implementation-friendly quantum neural network scheme with minimal physical system requirements and a proven advantage over classical counterparts. We use an extension of the positive-P phase…
Recently Bravyi, Gosset and K\"onig (Science 2018) proved an unconditional separation between the computational powers of small-depth quantum and classical circuits for a relation. In this paper we show a similar separation in the…
Bennett's notion of depth is usually considered to describe the usefulness and internal organization of the information encoded into an object such as an infinite binary sequence. We consider a natural way to relativize the notion of depth…
Measurement-based quantum computing (MBQC) is a model of quantum computing that proceeds by sequential measurements of individual spins in an entangled resource state. However, it remains a challenge to produce efficiently such resource…
The paper presents the first nontrivial upper and lower bounds for (non-oblivious) quantum read-once branching programs. It is shown that the computational power of quantum and classical read-once branching programs is incomparable in the…
This paper demonstrates how to add a measurement operator to quantum lambda-calculi. A proof of the consistency of the semantics is given through a proof of confluence presented in a sufficiently general way to allow this technique to be…
Quantum reservoir computing uses the dynamics of quantum systems to process temporal data, making it particularly well-suited for machine learning with noisy intermediate-scale quantum devices. Recent developments have introduced…
We revisit the so-called compressed oracle technique, introduced by Zhandry for analyzing quantum algorithms in the quantum random oracle model (QROM). To start off with, we offer a concise exposition of the technique, which easily extends…
In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via single-qubit measurements on a resource state. Flow conditions ensure that the overall computation is deterministic in a suitable sense, and are…
We show that quantum oracles provide an advantage over classical oracles for answering classical counterfactual questions in causal models, or equivalently, for identifying unknown causal parameters such as distributions over functional…
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and…
We provide a necessary condition that a quantum measurement can be implemented by the class of protocols known as Local Operations and Classical Communication, or LOCC, including when an error is allowed but must vanish in the limit of an…
In recent work, Benjamin Schumacher and Michael~D. Westmoreland investigate a version of quantum mechanics which they call "modal quantum theory" but which we prefer to call "discrete quantum theory". This theory is obtained by…
We show a relation, based on parallel repetition of the Magic Square game, that can be solved, with probability exponentially close to $1$ (worst-case input), by $1D$ (uniform) depth $2$, geometrically-local, noisy (noise below a…
Despite the rapid development of quantum computing these years, state-of-the-art quantum devices still contain only a very limited number of qubits. One possible way to execute more realistic algorithms in near-term quantum devices is to…
A typical oracle problem is finding which software program is installed on a computer, by running the computer and testing its input-output behaviour. The program is randomly chosen from a set of programs known to the problem solver. As…