منابع مشابه
Classical simulation of quantum contextuality
Recently, several inequalities involving sequences of measurements have been proposed which hold for non-contextual models but which are violated in quantum mechanics. They also have been found to be violated in experiments and the violation is independent of the prepared quantum state. A typical contextual model explaining this violation uses a classical memory. We investigate the required mem...
متن کاملMatchgates and classical simulation of quantum circuits
Let G(A,B) denote the 2-qubit gate which acts as the 1-qubit SU(2) gates A and B in the even and odd parity subspaces respectively, of two qubits. Using a Clifford algebra formalism we show that arbitrary uniform families of circuits of these gates, restricted to act only on nearest neighbour (n.n.) qubit lines, can be classically efficiently simulated. This reproduces a result originally prove...
متن کاملTrotter-based simulation of quantum-classical dynamics.
Quantum rate processes in condensed phase systems are often computed by combining quantum and classical descriptions of the dynamics. An algorithm for simulating the quantum-classical Liouville equation, which describes the dynamics of a quantum subsystem coupled to a classical bath, is presented in this paper. The algorithm is based on a Trotter decomposition of the quantum-classical propagato...
متن کاملClassical Simulation Complexity of Quantum Branching Programs
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function with error δ we present a classical deterministic branching program of the same length and width at most (1 + 2/(1− 2δ)) that computes the same function. Second technique is a classical stochastic simulation technique f...
متن کاملPolynomial-time classical simulation of quantum ferromagnets
We consider a family of quantum spin systems which includes, as special cases, the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any model in this family can be efficiently approximated to a given relative error ε using a classical randomized algorithm with runtime polynomial in ε^{-1}, sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics
سال: 2016
ISSN: 1943-2879
DOI: 10.1103/physics.9.66