Related papers: Quantum Iterative Deepening with an application to…
We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which enables a classical verifier to use a quantum…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {\em need not} be a Turing machine and,…
Quantifying the resources available to a quantum computer appears to be necessary to separate quantum from classical computation. Among them, entanglement, nonstabilizerness and coherence are arguably of great significance. We introduce…
A key issue of current quantum advantage experiments is that their verification requires a full classical simulation of the ideal computation. This limits the regime in which the experiments can be verified to precisely the regime in which…
Measuring the state of quantum computers is a highly non-trivial task, with implications for virtually all quantum algorithms. We propose a novel scheme where identical copies of a quantum state are measured jointly so that all Pauli…
A filtering problem for a class of quantum systems disturbed by a classical stochastic process is investigated in this paper. The classical disturbance process, which is assumed to be described by a linear stochastic differential equation,…
In this article, we propose a distributed quantum algorithm for solving counting problem using Grover operator and a classical post-processing procedure. We apply the proposed algorithm to estimate inner products and Hamming distances.…
Nielsen [quant-ph/0108020] introduced a model of quantum computation by measurement-based simulation of unitary computations. In this model, a consequence of the non-determinism of quantum measurement is the probabilistic termination of…
Using the tensor product representation in the density matrix renormalization group, we show that a quantum circuit of Grover's algorithm, which has one-qubit unitary gates, generalized Toffoli gates, and projective measurements, can be…
We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…
We present a hybrid model of the unitary-evolution-based quantum computation model and the measurement-based quantum computation model. In the hybrid model part of a quantum circuit is simulated by unitary evolution and the rest by…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
We demonstrate that a tensor product structure and optical analogy of quantum entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical analogy, we discuss…
In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the…
We propose an improved scheme of perturbation theory based on our exact solution [An Min Wang, quant-ph/0611216] in general quantum systems independent of time. Our elementary start-point is to introduce the perturbing parameter as late as…
Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size…
Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two…
We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…