Photonic resource state generation from a minimal number of quantum emitters
Top Cited Papers
Open Access
- 3 February 2022
- journal article
- research article
- Published by Springer Nature in npj Quantum Information
- Vol. 8 (1) , 1-7
Abstract
Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing. These states can in principle be created deterministically from quantum emitters such as optically active quantum dots or defects, atomic systems, or superconducting qubits. However, finding efficient schemes to produce such states has been a long-standing challenge. Here, we present an algorithm that, given a desired multi-photon graph state, determines the minimum number of quantum emitters and precise operation sequences that can produce it. The algorithm itself and the resulting operation sequence both scale polynomially in the size of the photonic graph state, allowing one to obtain efficient schemes to generate graph states containing hundreds or thousands of photons.Keywords
All Related Versions
This publication has 46 references indexed in Scilit:
- Efficient quantum state tomographyNature Communications, 2010
- Experimental demonstration of a hyper-entangled ten-qubit Schrödinger cat stateNature Physics, 2010
- Proposal for Pulsed On-Demand Sources of Photonic Cluster State StringsPhysical Review Letters, 2009
- Fundamentals of universality in one-way quantum computationNew Journal of Physics, 2007
- Sequential generation of matrix-product states in cavity QEDPhysical Review A, 2007
- Sequential Generation of Entangled Multiqubit StatesPhysical Review Letters, 2005
- Graphical description of the action of local Clifford transformations on graph statesPhysical Review A, 2004
- Fault-tolerant quantum computation by anyonsAnnals of Physics, 2003
- Quantum imagingJournal of Optics B: Quantum and Semiclassical Optics, 2002
- Quantum error-correcting codes associated with graphsPhysical Review A, 2001