Random circuits by measurements on weighted graph states
arXiv:0806.3058 · doi:10.1103/PhysRevA.78.042332
Abstract
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
8 pages, 5 figures
References in corpus (15)
- Black holes as mirrors: quantum information in random subsystems
- Strongly Interacting Polaritons in Coupled Arrays of Cavities
- Quantum phase transitions of light
- Photon blockade induced Mott transitions and XY spin models in coupled cavity arrays
- Aspects of generic entanglement
- Novel schemes for measurement-based quantum computation
- Robust creation of entanglement between ions in spatially separate cavities
- Superdense coding of quantum states
- Effective spin systems in coupled micro-cavities
- Emergence of typical entanglement in two-party random processes
- Ground state approximation for strongly interacting systems in arbitrary dimension
- Canonical and micro-canonical typical entanglement of continuous variable systems
- Quantum pseudo-randomness from cluster-state quantum computation
- Teleportation fidelities of squeezed states from thermodynamical state space measures
- Entanglement and decoherence in spin gases