How to simulate a universal quantum computer using negative probabilities

From MaRDI portal
Publication:5192075

DOI10.1088/1751-8113/42/27/275304zbMATH Open1167.81345arXiv0805.0029OpenAlexW1968062608MaRDI QIDQ5192075FDOQ5192075


Authors: Holger F. Hofmann Edit this on Wikidata


Publication date: 4 August 2009

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: The concept of negative probabilities can be used to decompose the interaction of two qubits mediated by a quantum controlled-NOT into three operations that require only classical interactions (that is, local operations and classical communication) between the qubits. For a single gate, the probabilities of the three operations are 1, 1, and -1. This decomposition can be applied in a probabilistic simulation of quantum computation by randomly choosing one of the three operations for each gate and assigning a negative statistical weight to the outcomes of sequences with an odd number of negative probability operations. The exponential speed-up of a quantum computer can then be evaluated in terms of the increase in the number of sequences needed to simulate a single operation of the quantum circuit.


Full work available at URL: https://arxiv.org/abs/0805.0029




Recommendations




Cited In (8)





This page was built for publication: How to simulate a universal quantum computer using negative probabilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5192075)