Search for: All records

We present an algorithm to reliably generate various quantum states critical to quantum error correction and universal continuous-variable (CV) quantum computing, such as Schrödinger cat states and Gottesman-Kitaev-Preskill (GKP) grid states, out of Gaussian CV cluster states. Our algorithm is based on the Photon-counting-Assisted Node-Teleportation Method (PhANTM), which uses standard Gaussian information processing on the cluster state with the only addition of local photon-number-resolving measurements. We show that PhANTM can apply polynomial gates and embed cat states within the cluster. This method stabilizes cat states against Gaussian noise and perpetuates non-Gaussianity within the cluster. We show that existing protocols for breeding cat states can be embedded into cluster state processing using PhANTM. 

The study of low-dimensional quantum systems has proven to be a particularly fertile field for discovering novel types of quantum matter. When studied numerically, low-energy states of low-dimensional quantum systems are often approximated via a tensor-network description. The tensor network's utility in studying short range correlated states in 1D have been thoroughly investigated, with numerous examples where the treatment is essentially exact. Yet, despite the large number of works investigating these networks and their relations to physical models, examples of exact correspondence between the ground state of a quantum critical system and an appropriate scale-invariant tensor network have eluded us so far. Here we show that the features of the quantum-critical Motzkin model can be faithfully captured by an analytic tensor network that exactly represents the ground state of the physical Hamiltonian. In particular, our network offers a two-dimensional representation of this state by a correspondence between walks and a type of tiling of a square lattice. We discuss connections to renormalization and holography. 

What kinds of symmetry-protected topologically ordered (SPTO) ground states can be used for universal measurement-based quantum computation in a similar fashion to the 2D cluster state? 2D SPTO states are classified not only by global on-site symmetries but also by subsystem symmetries, which are fine-grained symmetries dependent on the lattice geometry. Recently, all states within so-called SPTO cluster phases on the square and hexagonal lattices have been shown to be universal, based on the presence of subsystem symmetries and associated structures of quantum cellular automata. Motivated by this observation, we analyze the computational capability of SPTO cluster phases on all vertex-translative 2D Archimedean lattices. There are four subsystem symmetries here called ribbon, cone, fractal, and 1-form symmetries, and the former three are fundamentally in one-to-one correspondence with three classes of Clifford quantum cellular automata. We conclude that nine out of the eleven Archimedean lattices support universal cluster phases protected by one of the former three symmetries, while the remaining lattices possess 1-form symmetries and have a different capability related to error correction. 

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.