Layer by layer generation of cluster states
arXiv:1111.1774 · doi:10.1103/PhysRevA.85.052305
Abstract
Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and measurements are needed to perform universal quantum computation. In this paper, we explore techniques for quickly and deterministically building a cluster state. In particular we consider generating cluster states on a qubus quantum computer, a computational architecture which uses a continuous variable ancilla to generate interactions between qubits. We explore several techniques for building the cluster, with the number of operations required depending on whether we allow the ability to destroy previously created controlled-phase links between qubits. In the case where we can not destroy these links, we show how to create an n x m cluster using just 3nm -2n -3m/2 + 3 operations. This gives more than a factor of 2 saving over a naive method. Further savings can be obtained if we include the ability to destroy links, in which case we only need (8nm-4n-4m-8)/3 operations. Unfortunately the latter scheme is more complicated so choosing the correct order to interact the qubits is considerably more difficult. A half way scheme, that keeps a modular generation but saves additional operations over never destroying links requires only 3nm-2n-2m+4 operations. The first scheme and the last scheme are the most practical for building a cluster state because they split up the generation into the repetition of simple sections.
arXiv comment16 pages, 11 figures
References in corpus (28)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Review article: Linear optical quantum computing
- Quantum state transfer and entanglement distribution among distant nodes in a quantum network
- Measurement-based quantum computation with cluster states
- Resource-efficient linear optical quantum computation
- Controlled Collisions for Multiparticle Entanglement of Optically Trapped Atoms
- A near deterministic linear optical CNOT gate
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- Optical quantum computation using cluster states
- Most quantum states are too entangled to be useful as computational resources
- Repeat-Until-Success Quantum Computing
- A high-efficiency quantum non-demolition single photon number resolving detector
- Quantum Computation by Communication
- Efficient quantum computation with probabilistic quantum gates
- Affleck-Kennedy-Lieb-Tasaki State on a Honeycomb Lattice is a Universal Quantum Computational Resource
- Using Quantum Computers for Quantum Simulation
- Hybrid Quantum Computation in Quantum Optics
- Engineering an interaction and entanglement between distant atoms
- The efficiencies of generating cluster states with weak non-linearities
- Cluster States From Heisenberg Interaction
- Potential and limits to cluster state quantum computing using probabilistic gates
- Ultrashort dead time of photon-counting InGaAs avalanche photodiodes
- Efficient Construction of Photonic Quantum Computational Clusters
- Reduce, reuse, recycle, for robust cluster state generation
- Probabilistic growth of large entangled states with low error accumulation
- Adaptive strategies for graph state growth in the presence of monitored errors
- Cluster state preparation using gates operating at arbitrary success probabilities
- Ancilla-based quantum simulation