Related papers: Classical simulation of universal measurement-base…
In this work, we present a quantum secret sharing scheme based on Bell state entanglement and sequential projection measurements. The protocol verifies the $n$ out of $n$ scheme and supports the aborting of the protocol in case all the…
We demonstrate how to universally simulate ensemble statistics of projective local measurements on any $n$-qubit state shared among $n$ observers with classical communication and shared randomness. Our technique originates from protocols…
We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The…
Quantum computers have long been expected to efficiently solve complex classical differential equations. Most digital, fault-tolerant approaches use Carleman linearization to map nonlinear systems to linear ones and then apply quantum…
Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic…
We consider an ideal experiment in which unlimited nonprojective quantum measurements are sequentially performed on a system that is initially entangled with a distant one. At each step of the sequence, the measurements are randomly chosen…
We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits wherein the final quantum observable | after the Heisenberg evolution associated with the…
A classical state-preparation device cannot generate states in relative superposition. We introduce classical models in which devices that are individually unable to generate states with relative superposition can be stochastically…
Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a…
We present a classical probability model appropriate to the description of quantum randomness. This tool, that we have called stochastic gauge system, constitutes a contextual scheme in which the Kolmogorov probability space depends upon…
The quantum teleportation process is composed of a joint measurement performed upon two subsystems A and B (uncorrelated), followed by a unitary transformation (parameters of which depend on the outcome of the measurement) performed upon a…
Quantum simulators have made a remarkable progress towards exploring the dynamics of many-body systems, many of which offer a formidable challenge to both theoretical and numerical methods. While state-of-the-art quantum simulators are in…
Improving the simulation of quantum circuits on classical computers is important for understanding quantum advantage and increasing development speed. In this paper, we explore a new way to express stabilizer states and further improve the…
The principle of teleportation can be used to perform a quantum computation even before its quantum input is defined. The basic idea is to perform the quantum computation at some earlier time with qubits which are part of an entangled…
In this paper, we develop a new classical simulation of quantum bit (qubit) by use of analog components in order to be able to simulate the quantum properties such as the superposition of states. As part of this new approach, we have also…
Computing nonlinear functions over multilinear forms is a general problem with applications in risk analysis. For instance in the domain of energy economics, accurate and timely risk management demands for efficient simulation of millions…
The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can only be applied to small systems. By contrast, we demonstrate that quantum…
Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements…
Bell state measurements, which project bipartite qubit systems onto the maximally entangled Bell basis, are central to a wide range of quantum information processing tasks, including quantum teleportation, entanglement swapping, and…
We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…