Decoupling with random quantum circuits (Q748450): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The mother of all protocols: restructuring quantum information’s family tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum to Classical Randomness Extractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local random quantum circuits are approximate polynomial-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-shot decoupling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entanglement Sampling and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Random Unitary Operators for Quantum Information Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random quantum circuits are approximate 2-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of generic entanglement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum state merging and negative information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards the fast scrambling conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoupling with unitary approximate two-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Quantum Polar Codes Requiring No Preshared Entanglement / rank
 
Normal rank

Latest revision as of 23:13, 10 July 2024

scientific article
Language Label Description Also known as
English
Decoupling with random quantum circuits
scientific article

    Statements

    Decoupling with random quantum circuits (English)
    0 references
    0 references
    0 references
    29 October 2015
    0 references
    The absence of correlation between two systems indicates that the two systems are decoupled. Decoupling plays an important role in quantum information theory. In the paper it is proven that random quantum circuits with \(O(n \log^2 n)\) gates satisfy an essentially optimal decoupling theorem. Such random quantum circuits can be implemented in depth \(O(\log^3 n)\). A random quantum circuit is composed of random quantum gates that are applied to randomly chosen pairs of qubits. The proof is based on the formulation of the decoupling property by Markov chains.
    0 references
    quantum information
    0 references
    decoupling theorem
    0 references
    Markov chains
    0 references
    random quantum circuit
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references