Cluster-state Quantum Computation Research Articles

Efficient classical simulation of cluster state quantum circuits with alternative inputs

We provide new examples of pure entangled systems related to cluster state quantum computation that can be efficiently simulated classically. In cluster state quantum computation input qubits are initialised in the `equator' of the Bloch sphere, CZ gates are applied, and finally the qubits are measured adaptively using Z measurements or measurements of cos⁡(θ)X+sin⁡(θ)Y operators. We consider what happens when the initialisation step is modified, and show that for lattices of finite degree D, there is a constant λ≈2.06 such that if the qubits are prepared in a state that is within λ−D in trace distance of a state that is diagonal in the computational basis, then the system can be efficiently simulated classically in the sense of sampling from the output distribution within a desired total variation distance. In the square lattice with D=4 for instance, λ−D≈0.056. We develop a coarse grained version of the argument which increases the size of the classically efficient region. In the case of the square lattice of qubits, the size of the classically simulatable region increases in size to at least around ≈0.070, and in fact probably increases to around ≈0.1. The results generalise to a broader family of systems, including qudit systems where the interaction is diagonal in the computational basis and the measurements are either in the computational basis or unbiased to it. Potential readers who only want the short version can get much of the intuition from figures 1 to 3.

12.6 dB squeezed light at 1550 nm from a bow-tie cavity for long-term high duty cycle operation.

Squeezed states are an interesting class of quantum states that have numerous applications. This work presents the design, characterization, and operation of a bow-tie optical parametric amplifier (OPA) for squeezed vacuum generation. We report the high duty cycle operation and long-term stability of the system that makes it suitable for post-selection based continuous-variable quantum information protocols, cluster-state quantum computing, quantum metrology, and potentially gravitational wave detectors. Over a 50 hour continuous operation, the measured squeezing levels were greater than 10 dB with a duty cycle of 96.6%. Alternatively, in a different mode of operation, the squeezer can also operate 10 dB below the quantum noise limit over a 12 hour period with no relocks, with an average squeezing of 11.9 dB. We also measured a maximum squeezing level of 12.6 dB at 1550 nm. This represents one of the best reported squeezing results at 1550 nm to date for a bow-tie cavity. We discuss the design aspects of the experiment that contribute to the overall stability, reliability, and longevity of the OPA, along with the automated locking schemes and different modes of operation.

Subsystem analysis of continuous-variable resource states

Continuous-variable (CV) cluster states are a universal resource for fault-tolerant quantum computation when supplemented with the Gottesman-Kitaev-Preskill (GKP) bosonic code. We generalize the recently introduced subsystem decomposition of a bosonic code [Phys. Rev. Lett. 125, 040501 (2020)], and we use it to analyze CV cluster-state quantum computing with GKP states. Specifically, we decompose squeezed vacuum states and approximate GKP states to reveal their encoded logical information, and we decompose several gates crucial to CV cluster-state quantum computing. Then, we use the subsystem decomposition to quantify damage to the logical information in approximate GKP states teleported through noisy CV cluster states. Each of these studies uses the subsystem decomposition to circumvent complications arising from the full CV nature of the mode in order to focus on the encoded qubit information.

Frequency correlated photon generation at telecom band using silicon nitride ring cavities.

Frequency entangled photon sources are in high demand in a variety of optical quantum technologies, including quantum key distribution, cluster state quantum computation and quantum metrology. In the recent decade, chip-scale entangled photon sources have been developed using silicon platforms, offering robustness, large scalability and CMOS technology compatibility. Here, we report the generation of frequency correlated photon pairs using a 150-GHz silicon nitride ring cavity. First, the device is characterized for studying the phase matching condition during spontaneous four-wave mixing. Next, we evaluate the joint spectrum intensity of the generated photons and confirm the photon pair generation in a total of 42 correlated frequency mode pairs, corresponding to a bandwidth of 51.25 nm. Finally, the experimental results are analyzed and the joint spectral intensity is quantified in terms of the phase matching condition.

Robust fault tolerance for continuous-variable cluster states with excess antisqueezing

The immense scalability of continuous-variable cluster states motivates their study as a platform for quantum computing, with fault tolerance possible given sufficient squeezing and appropriately encoded qubits [Menicucci, PRL 112, 120504 (2014)]. Here, we expand the scope of that result by showing that additional anti-squeezing has no effect on the fault-tolerance threshold, removing the purity requirement for experimental continuous-variable cluster-state quantum computing. We emphasize that the appropriate experimental target for fault-tolerant applications is to directly measure 15-17 dB of squeezing in the cluster state rather than the more conservative upper bound of 20.5 dB.

A one-way quantum amplifier for long-distance quantum communication

In this paper, a model for single photon amplification based on cluster-state quantum computation is proposed. A rescaling of the probability amplitudes of a deteriorated qubit in favor of the one-photon component will define the amplifier's gain. Unlike the heralded quantum amplifiers, the probabilistic success of the whole process will not depend on the successful detection of a heralding signal. Instead, the whole procedure will rely upon a single-qubit measurement, which is simpler compared to any two-qubit interaction gate in the heralded quantum amplifiers. The proposed model can be used as a qubit protector against propagation losses in long-distance quantum communication networks.

Coherent-state optical qudit cluster state generation and teleportation via homodyne detection

Defining a computational basis of pseudo-number states, we interpret a coherent state of large amplitude, |α|⪢d/2π, as a qudit — a d-level quantum system — that is an even (meaning same size of amplitudes) superposition of d pseudo-number basis states. A pair of such coherent-state qudits can be maximally entangled by generalized Controlled-Z operation that is based on cross-Kerr nonlinearity, which can be weak for large d. Hence, a coherent-state optical qudit cluster state can be prepared by repetitive application of the generalized Controlled-Z operation to a set of coherent states. We thus propose an optical qudit teleportation as a simple demonstration of cluster state quantum computation.

Superoperator analysis of entanglement in a four-qubit cluster state

In this paper we utilize superoperator formalism to explore the entanglement evolution of four-qubit cluster states in a number of decohering environments. A four-qubit cluster state is a resource for the performance of an arbitrary single-logical-qubit rotation via measurement-based cluster-state quantum computation. We are specifically interested in the relationship between entanglement evolution and the fidelity with which the arbitrary single-logical-qubit rotation can be implemented in the presence of decoherence as this will have important experimental ramifications. We also note the exhibition of entanglement sudden death (ESD) and ask how severely its onset affects the utilization of the cluster state as a means of implementing an arbitrary single-logical-qubit rotation.

Many worlds, the cluster-state quantum computer, and the problem of the preferred basis

I argue that the many worlds explanation of quantum computation is not licensed by, and in fact is conceptually inferior to, the many worlds interpretation of quantum mechanics from which it is derived. I argue that the many worlds explanation of quantum computation is incompatible with the recently developed cluster state model of quantum computation. Based on these considerations I conclude that we should reject the many worlds explanation of quantum computation.

Photonic implementation for the topological cluster-state quantum computer

An implementation of the topological cluster-state quantum computer is suggested, in which the basic elements are linear optics, measurements, and a two-dimensional array of quantum dots. This overcomes the need for nonlinear devices to create a lattice of entangled photons. Whereas the thresholds found for computational errors are quite satisfactory (above ${10}^{\ensuremath{-}3}$), the estimates of the minimum efficiencies needed for the detectors and quantum dots are beyond current technology's reach. This is because we rely heavily on probabilistic entangling gates, which introduces loss into the scheme irrespective of detector and quantum-dot efficiencies.

Linear optical quantum computation with imperfect entangled photon-pair sources and inefficient non–photon-number-resolving detectors

We propose a scheme for efficient cluster state quantum computation by using imperfect polarization-entangled photon-pair sources, linear optical elements and inefficient non-photon-number-resolving detectors. The efficiency threshold for loss tolerance in our scheme requires the product of source and detector efficiencies should be >1/2 - the best known figure. This figure applies to uncorrelated loss. We further find that the loss threshold is unaffected by correlated loss in the photon pair source. Our approach sheds new light on efficient linear optical quantum computation with imperfect experimental conditions.

A Simple Procedure for Classical Signal-Processing in Cluster-State Quantum Computation

We exhibit a simple procedure to find how classical signals should be processed in cluster-state quantum computation. Using stabilizers characterizing a cluster state, we can easily find a precise classical signal-flow that is required in performing cluster-state computation.

Cluster State Computation with Quantum-Dot Charge Qubits

Quantum computers are expected to far surpass the capabilities of today's most powerful supercomputers, particularly in areas such as the theoretical simulation of quantum systems, cryptography, and information processing. The cluster state is a special, highly entangled quantum state that forms the universal resource on which measurement-based quantum computation can be performed. This paper provides a brief review of the theoretical foundations of cluster state quantum computation and how it evolved from the traditional model of digital computers. It then proposes a scheme for the generation of such entanglement in a solid-state medium through the suppression of resonant tunneling of a ballistic electron by a single-electron charge qubit. To investigate the viability of the scheme for the creation of cluster states, numerical calculations are performed in which the entanglement interaction is modeled in detail.

Cluster-State Quantum Computing Enhanced by High-Fidelity Generalized Measurements

We introduce and implement a technique to extend the quantum computational power of cluster states by replacing some projective measurements with generalized quantum measurements (POVMs). As an experimental demonstration we fully realize an arbitrary three-qubit cluster computation by implementing a tunable linear-optical POVM, as well as fast active feedforward, on a two-qubit photonic cluster state. Over 206 different computations, the average output fidelity is 0.9832+/-0.0002; furthermore the error contribution from our POVM device and feedforward is only of O(10(-3)), less than some recent thresholds for fault-tolerant cluster computing.

Photons as qubits

We review the physical principles behind measurement-based quantum information processing with optical fields. The original Knill–Laflamme–Milburn (KLM) scheme, based on single-photon states, is explained, as well as extensions of the scheme inspired by the idea of cluster state quantum computing, which dramatically reduce the resources required for implementation. A careful analysis of the intrinsic error sources in optical cluster state methods indicates that fault-tolerant quantum gates are feasible given developments in current technology. The main impediment to progress is the lack of single-photon sources and we briefly review what kinds of sources are needed. We conclude with a discussion of phase-shift coherent state codes and discuss a possible implementation in circuit quantum electrodynamics.

Architectural design for a topological cluster state quantum computer

The development of a large scale quantum computer is a highly sought after goal of fundamental research and consequently a highly non-trivial problem. Scalability in quantum information processing is not just a problem of qubit manufacturing and control but it crucially depends on the ability to adapt advanced techniques in quantum information theory, such as error correction, to the experimental restrictions of assembling qubit arrays into the millions. In this paper, we introduce a feasible architectural design for large scale quantum computation in optical systems. We combine the recent developments in topological cluster state computation with the photonic module, a simple chip-based device that can be used as a fundamental building block for a large-scale computer. The integration of the topological cluster model with this comparatively simple operational element addresses many significant issues in scalable computing and leads to a promising modular architecture with complete integration of active error correction, exhibiting high fault-tolerant thresholds.

Generalized parity measurements

Measurements play an important role in quantum computing (QC), by either providing the nonlinearity required for two-qubit gates (linear optics QC), or by implementing a quantum algorithm using single-qubit measurements on a highly entangled initial state (cluster state QC). Parity measurements can be used as building blocks for preparing arbitrary stabilizer states, and, together with 1-qubit gates are universal for quantum computing. Here we generalize parity gates by using a higher dimensional (qudit) ancilla. This enables us to go beyond the stabilizer/graph state formalism and prepare other types of multi-particle entangled states. The generalized parity module introduced here can prepare in one-shot, heralded by the outcome of the ancilla, a large class of entangled states, including GHZ_n, W_n, Dicke states D_{n,k}, and, more generally, certain sums of Dicke states, like G_n states used in secret sharing. For W_n states it provides an exponential gain compared to linear optics based methods.

Scheme for Implementing Quantum Search Algorithm in a Cluster State Quantum Computer

Using cluster state and single qubit measurement one can perform the one-way quantum computation. Here we give a detailed scheme for realizing a modified Grover search algorithm using measurements on cluster state. We give the measurement pattern for the cluster-state realization of the algorithm and estimated the number of measurement needed for its implementation. It is found that O(23n/2n2) number of single qubit measurements is required for its realization in a cluster-state quantum computer.

Quantum pseudorandomness from cluster-state quantum computation

We show how to efficiently generate pseudorandom states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudorandom algorithms in the cluster-state picture, we identify a strategy for optimizing pseudorandom circuits by properly choosing single-qubit rotations. A Markov chain analysis provides the tool for analyzing convergence rates to the Haar measure and finding the optimal single-qubit gate distribution. Our results may be viewed as an alternative construction of approximate unitary $2$-designs.

CLUSTER STATE QUANTUM COMPUTATION AND THE REPEAT-UNTIL-SUCCESS SCHEME

Cluster state computation or the one way quantum computation (1WQC) relies on an initially highly entangled state (called a cluster state) and an appropriate sequence of single qubit measurements along different directions, together with feed-forward based on the measurement results, to realize a quantum computation process. The final result of the computation is obtained by measuring the last remaining qubits in the computational basis. In this short tutorial on cluster state quantum computation, we will also describe the basic ideas of a cluster state and proceed to describe how a single qubit operation can be done on a cluster state. Recently, we proposed a repeat-until-success (RUS) scheme that could effectively be used to realize one-way quantum computer on a hybrid system of photons and atoms. We will briefly describe this RUS scheme and show how it can be used to entangled two distant stationary qubits.