2008/06/18 by A. D. K. Plato, A. Douglas K. Plato, Oscar Dahlsten +2 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Combinatorics #Computer science #Electronic circuit #Graph #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Random graph #State (computer science) #Theoretical computer science #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physreva.78.042332
published as Phys. Rev. A 78, 042332 (2008) · 8 pages, 5 figures
arxiv created 2008/06/18 · openalex publication_date 2008/10/28 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Random quantum circuits take an input quantum state and randomize it. This is a task with a growing number of identified uses in quantum-information processing. We suggest a scheme to implement random circuits in a weighted graph state. The input state is entangled with the weighted graph state and a random circuit is implemented when the experimenter performs local measurements in one fixed basis only. The scheme uses no classical random numbers and is a new and natural application of weighted graph states.