How to simulate a universal quantum computer using negative probabilities
From MaRDI portal
Publication:5192075
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.
Recommendations
- An Operational Interpretation of Negative Probabilities and No-Signalling Models
- Negative quasi-probability as a resource for quantum computation
- Quantum simulation from the bottom up: the case of rebits
- Computations on quantum computers based on non-classic probability theory
- Counterfactual computation
Cited in
(8)- Design of positive, negative, and alternating sign generalized logistic maps
- Rhapsody in fractional
- Negative quasi-probability as a resource for quantum computation
- Fractional derivatives and negative probabilities
- Complex joint probabilities as expressions of reversible transformations in quantum mechanics
- Entropy analysis of systems exhibiting negative probabilities
- Fractional coins and fractional derivatives
- Entanglement, quantum discord, and non-locality in Bell-diagonal states
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)
