Generation of time-domain-multiplexed two-dimensional cluster state
By W. Asavanant, Y. Shiozawa, S. Yokoyama, B. Charoensombutamon, H. Emura, Rafael N. Alexander, S. Takeda, J. Yoshikawa, Nicolas C. Menicucci, H. Yonezawa and 1 more. Science, 2019
433 citations recorded by the source corpus.
Generating large-scale cluster states The development of a practical quantum computer requires universality, scalability, and fault tolerance. Although much progress is being made in circuit platforms in which arrays of qubits are addressed and manipulated individually, scale-up of such systems is experimentally challenging. Asavanant et al. and Larsen et al. explore an alternative route: measurement-based quantum computation, which is a platform based on the generation of large-scale cluster states. As these are optically prepared and easier to handle (one simply performs local measurements on each individual component of the cluster state), such a platform is readily scalable and fault tolerant. The topology of the cluster state ensures that the approach meets the requirements for quantum computation. Science, this issue p. 373, p. 369 Two-dimensional cluster states are generated, a necessary requirement for universal quantum computing. Entanglement is the key resource for measurement-based quantum computing. It is stored in quantum states known as cluster states, which are prepared offline and enable quantum computing by means of purely local measurements. Universal quantum computing requires cluster states that are both large and possess (at least) a two-dimensional topology. Continuous-variable cluster states—based on bosonic modes rather than qubits—have previously been generated on a scale exceeding one million modes, but only in one dimension. Here, we report generation of a large-scale two-dimensional continuous-variable cluster state. Its structure consists of a 5- by 1240-site square lattice that was tailored to our highly scalable time-multiplexed experimental platform. It is compatible with Bosonic error-correcting codes that, with higher squeezing, enable fault-tolerant quantum computation.
Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics
View Paper: https://www.semanticscholar.org/paper/077536f3643d981c7165bbbd9bb1915fbe8186a4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Josh A. Izaac
- Maria Schuld
- Nathan Killoran
- Suguru Endo
- Simon C. Benjamin
- Jarrod R. McClean
- Ryan Babbush
- Thomas R. Bromley
In Atomic and Molecular Physics, and Optics
- Josh A. Izaac
- Maria Schuld
- Suguru Endo
- Simon C. Benjamin
- Nathan Killoran
- Ying Li
- Jarrod R. McClean
- Ryan Babbush
Citations in the corpus
- Quantum error mitigation (2022, background): “In recent years, it has become routine to see reports of experiments demonstrating high-quality control over multiple qubits [see e.g. Asavanant et al. (2019); Ebadi et al. (2021); Jurcevic et al. (2021); Madjarov et al. (2020); and Xue et al. (2022)], some even reaching beyond 50 qubits [see e.g.…”
- Quantum circuits with many photons on a programmable nanophotonic chip (2021, methodology): “Large photonic cluster state demonstrations [21, 22] were limited to all-Gaussian states, gates, and measurements, rendering them efficiently simulable at any scale by classical computers.”
- Quantum computational advantage with a programmable photonic processor (2022, methodology): “Using time-domain multiplexing, large one-and two-dimensional cluster states have been deterministically generated 21–23 with programmable linear operations implemented by projective measurements 24,25 , whereas similar operations have been implemented in ref.”
- Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer (2020, result): “This is in contrast to existing schemes for CV computation, where increasing the numbers of qubits requires either longer time delays [13, 16], longer measurement integration times, or more precise spectral resolution [17, 18].”