Classical Ising model test for quantum circuits
نویسندگان
چکیده
منابع مشابه
Classical Ising model test for quantum circuits
We exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The proof uses an expression for the Ising model partition function in terms of quadratically signed weight enumerators (QWGTs), which are polynomials that arise naturally in an expansion of quantum circuit...
متن کاملClassical Dynamic Ising Model
We discuss the dynamics of the Ising model as a computational mesoscopic system. The simplicity of the Ising model allows a Hamiltonian dynamics to be developed from renormalization group theory considerations for the model which is not overly complicated and preserves a close connection with thermodynamics. At the same time, the additional structure gives the potential for application to neura...
متن کاملClassical Homomorphic Encryption for Quantum Circuits
We present a computationally secure classical homomorphic encryption scheme for quantum circuits. The scheme allows a classical server to blindly delegate a quantum computation to a quantum server; the server is able to run the computation without learning about the computation itself. This result relies on postquantum classical cryptographic tools, including sub-exponentially secure indistingu...
متن کاملAutomated Test Pattern Generation for Quantum Circuits
This work extends a general method used to test classical circuits to quantum circuits. Gate internal errors are address using a discrete fault model. Fault models to represent unwanted nearest neighbor entanglement as well as unwanted qubit rotation are presented. When witnessed, the faults we model are probabilistic, but there is a set of tests with the highest probability of detecting a disc...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2010
ISSN: 1367-2630
DOI: 10.1088/1367-2630/12/7/075026