This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

One-hundred step measurement-based quantum computation multiplexed in the time domain with 25 MHz clock frequency

Warit Asavanant,1,†,†† Baramee Charoensombutamon,1,† Shota Yokoyama,2
Takeru Ebihara,1 Tomohiro Nakamura,1 Rafael N. Alexander,3
Mamoru Endo,1 Jun-ichi Yoshikawa,1 Nicolas C. Menicucci,4
Hidehiro Yonezawa,2 Akira Furusawa1,∗

1Department of Applied Physics, School of Engineering, The University of Tokyo,
7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan
2Centre for Quantum Computation and Communication Technology,
School of Engineering and Information Technology, University of New South Wales,
Canberra, ACT 2600, Australia
3 Center for Quantum Information and Control, Department of Physics and Astronomy,
University of New Mexico, Albuquerque, NM 87131, USA
4Centre for Quantum Computation and Communication Technology,
School of Science, RMIT University, Melbourne, Victoria 3001, Australia

These authors contributed equally to this work
To whom correspondence should be addressed; E-mail: [email protected].
†† E-mail: [email protected].

Quantum computers are known to provide algorithmic speed ups over their classical counterparts[1]. In recent years, approaches based on various physical systems—superconducting qubits[2], ion-trap systems[3], and photonic systems[4, 5]—have been extensively explored. However, constructing devices at scale required for real-world applications is no trivial task. Among the various approaches, measurement-based quantum computation[6, 7] (MBQC) multiplexed in time domain[8] is currently a promising method for addressing the need for scalability. MBQC requires two components: cluster states and programmable measurements. With time-domain multiplexing, the former has been realized on an ultra-large-scale[9, 10, 11, 12]. The latter, however, has remained unrealized, leaving the large-scale cluster states unused. In this work, we make such a measurement system and use it to demonstrate basic quantum operations multiplexed in the time-domain with 25 MHz clock frequency. This programmable measurement system is a key piece for MBQC in time domain. We directly verify transformations of the input states and their nonclassicalities for single-step quantum operations and also observe multi-step quantum operations up to one hundred steps—the largest number ever observed in CV systems. Furthermore, with sufficient squeezing and bosonic qubits, cluster state and programmable measurement system in this work serve as the central components of universal fault-tolerant MBQC[13, 14, 15, 16]. Our work establishes a prototype for scalable quantum computation based on CV optical systems and demonstrates a new and promising road toward full-fledged quantum computation.

The promise of quantum computing technology stems from a wide range of potential applications, and has spawned many alternative realizations based on different physical systems[2, 3, 4, 5]. Quantum supremacy using superconducting qubits[17] and Boson sampling[18] has recently been realized. While these achievements mark important milestones in the journey towards quantum computation, these experiments are still a far cry from useful quantum computations. A fault-tolerant quantum computer that can handle arbitrary large-scale multi-input and multi-step computation is essential. With matter-based qubits, achieving quantum computation on a useful scale involves preparing and interfacing a large number of qubits, a task that would require a technological leap to reach the scale necessary for real-world applications.

MBQC using optical modes multiplexed in the time domain[8] can overcome these obtacles. In MBQC, the requirements of qubit preparation and interfacing are replaced with a multi-qubit entangled resource, known as a cluster state[19]. After the cluster state is prepared, quantum operations are implemented via local (single) qubit measurements and feedforward operations based on the measurement results (Fig. 1a). These features make MBQC an appealing experimental candidate as state preparations and measurements tend to be simpler than direct implementations of quantum gates. Generation of cluster states[9, 10, 11, 12, 20, 21, 22, 23, 24, 25] and the demonstration of small-scale MBQC[21, 23, 25, 26, 27, 28] in various systems have both already been achieved. To move from small-scale MBQC to large-scale MBQC, large-scale cluster states are required. In most approaches, however, the number of the experimental components scales directly with the size of the cluster states, making scaling-up difficult. In CV optical systems, by multiplexing temporally localized optical wave packet modes (CV equivalence to qubits) on the same beam, large-scale cluster states—10,000-mode[9] and 1,000,000-mode[10] one-dimensional cluster states and universal resources for multi-input MBQC called two-dimensional cluster states[11, 12]—have been deterministically generated. These experimental results demonstrate the capability of time-domain-multiplexing (TDM) architecture in implementing a large-scale quantum computer.

With large-scale cluster states generated, a few additional ingredients are required to achieve a full-fledged quantum computer multiplexed in time domain: a programmable homodyne measurement system, a non-Gaussian element, and fault-tolerance. Cluster states form the backbone of this architecture. How we measure them, i.e. the choices of the measurement basis, determines the computation. Since modes are localized wave packets in the TDM method, high-speed switching and synchronicity, in addition to the programmability, are also necessary. Without the development of such systems, MBQC using TDM cluster states cannot be realized. Quantum computation with only CV cluster states and homodyne measurements are known to be classically simulatable[29]; to achieve useful quantum computation, non-Gaussian elements must be added. There are various theoretical approaches to achieve this[13, 30, 31, 32] and non-Gaussian ancillary states with up to three photons have also been experimentally demonstrated[33]. Finally, to achieve fault-tolerant MBQC, we require the combination of sufficiently high quality cluster states and bosonic codes, of which the Gottesman-Kitaev-Preskill (GKP) qubit[13] is currently the most promising candidate[14, 15, 16]. GKP qubits have been realized in microwave[34] and ion-trapped systems[35], and various generation methods are being explored in optical systems[36, 37, 38].

In this work, we develop a programmable homodyne measurement system and demonstrate a prototype of a CV optical quantum computer using MBQC multiplexed in the time domain. Combining this system with our one-dimensional cluster state setup, we implement various quantum operations. We verify that quantum gates can be correctly programmed by the appropriate choice of measurement basis. Next, we also demonstrate the nonclassicality of the quantum operations by verifying that pre-shared entanglement persists between different mode even after quantum operations are applied to them. We verify that our system can implement arbitrary single-mode Gaussian operations (analogous to Clifford operations in qubits) and that the nonclassical features of the quantum states are preserved. Finally, we implement multi-step quantum operations and observe that our system has the stability and is capable of implementing MBQC up to at least one hundred steps. Not only is this the largest number of operations ever observed in CV systems, our work also demonstrates a working scalable and programmable CV optical quantum computer prototype.

CV optical systems utilize electric fields—quadratures—as physical quantities in the quantum computation. The quadrature operators x^\hat{x} and p^\hat{p} associated with each temporal mode wave packet satisfy the following commutation relations: [x^k,p^l]=iδkl[\hat{x}_{k},\hat{p}_{l}]=i\hbar\delta_{kl}, where kk and ll are temporal indices of the wave packets. The basic measurement in CV optical systems is a homodyne measurement, which measures a linear combination of x^\hat{x} and p^\hat{p} for a given mode, i.e. (cosθ)x^+(sinθ)p^(\cos\theta)\hat{x}+(\sin\theta)\hat{p}. We can express CV quantum computation as a transformation of the quadrature operators by using the Heisenberg picture. Gaussian operations form an important subset of these, as they act linearly on the quadrature operators in the following sense:

𝐪^out=𝐒𝐪^in+𝐜,\displaystyle\hat{\mathbf{q}}_{\textrm{out}}=\mathbf{S}\hat{\mathbf{q}}_{\textrm{in}}+\mathbf{c}, (1)

where 𝐪^=(x^1x^2x^np^1p^2p^n)T\hat{\mathbf{q}}=(\hat{x}_{1}\quad\hat{x}_{2}\quad\cdots\quad\hat{x}_{n}\quad\hat{p}_{1}\quad\hat{p}_{2}\quad\cdots\quad\hat{p}_{n})^{\textrm{T}}, and the Heisenberg evolution under the Gaussian operation is represented by 𝐒\mathbf{S}, a 2n×2n2n\times 2n symplectic matrix, and 𝐜\mathbf{c} a vector of real numbers. Arbitrary operations of this type can be realized via homodyne measurements on CV cluster states that possess an appropriate graph structure [11, 12, 7]. The commonly used single-mode Gaussian operations are displacement (contributes a non-zero cc vector), phase rotation 𝐑(ϕ)=(cosϕsinϕsinϕcosϕ)\mathbf{R}(\phi)=\begin{pmatrix}\cos\phi&\sin\phi\\ -\sin\phi&\cos\phi\end{pmatrix}, squeezing 𝐒(ϕ)=(1/tanϕ00tanϕ)\mathbf{S}(\phi)=\begin{pmatrix}1/\tan\phi&0\\ 0&\tan\phi\end{pmatrix}, and shear 𝐏(ϕ)=(102tanϕ1)\mathbf{P}(\phi)=\begin{pmatrix}1&0\\ 2\tan\phi&1\end{pmatrix}. To implement universal MBQC, in addition to multi-mode Gaussian operations, non-Gaussian operations are also necessary[39]. Non-Gaussian operations can be realized simply by combining non-Gaussian ancillary states with Gaussian operations[13, 32, 31, 30].

MBQC using local homodyne measurements on TDM cluster states (Fig. 1a) is equivalent to quantum computation using non-local measurements on two-mode quantum entangled states (Fig. 1b) called two-mode-squeezed states (which become EPR states in the limit of infinite squeezing). In the latter representation, the non-local measurement consists of a 50:50 beamsplitter and two homodyne measurements. The choice of the measurement bases determines which quantum operations are applied. Recall that non-local measurements on two-mode-squeezed states are equivalent to CV gate teleportation, and thus, Fig. 1b can also be interpreted as sequential teleportation.

Figure 1c shows the experimental setup. TDM consists of using temporal wave packets that propagate along a common light beam and terminate at a fixed detector at different times. The clock frequency of the computation is determined by the time width of the wave packet Δt\Delta t. In our current setup, Δt=40\Delta t=40 ns, corresponding to 25 MHz clock frequency. By dynamically changing the measurement bases, we can easily address each mode in a scalable fashion without having to spatially separate them. The homodyne measurement basis is specified by the relative phase between a local oscillator (LO) and an input wave packet. Our programmable homodyne detectors consist of an electro-optic modulator (EOM) and a homemade 2-CH signal generator circuit. By applying the appropriate voltage to the EOM, the circuit can modify the relative phase, thus changing the homodyne measurement basis. To have an independent measurement for each temporal mode, the change in basis must be fast and synchronized. It must also be performed with sufficient precision to ensure high quality quantum gates. Figure 1d shows an example of the electric signals that our measurement system can generate and use for multi-step MBQC. The technical details of the circuitry can be found in Method.

To evaluate our measurement system and its potential for TDM MBQC, we demonstrate two things: first, we implement various single-step single-mode Gaussian operations in the time domain and demonstrate the programmability of our measurement system. Second, we evaluate its stability for multi-step MBQC of our system via multi-step quantum teleportation. Figure 1e shows our experimental verification procedure. We consider one mode of the two-mode-squeezed state in the system as the input to time-domain MBQC and the other mode is used as a reference. Quadrature measurement results of the reference mode will be highly correlated with those of the input mode due to entanglement, while the results of each alone will be randomly distributed. Therefore, by calculating correlations between the reference and the output mode, the elements of the symplectic matrix SS in Eq. (1) and the nonclassicality of the quantum operations can be verified.

In the single-step operations, we implement 𝐑(ϕ)\mathbf{R}(\phi), 𝐏(ϕ)\mathbf{P}(\phi), and 𝐑(π/2)𝐒(ϕ)\mathbf{R}(\pi/2)\mathbf{S}(\phi) gates, for various parameters ϕ\phi. The parameters ϕ\phi are determined by the bases of the homodyne measurement θA\theta^{\textrm{A}} and θB\theta^{\textrm{B}} (see Method for more details). Note that even for single-step operations, we have to switch between the measurement basis for the reference mode (θref\theta_{\textrm{ref}}), the operation (θA\theta^{\textrm{A}} and θB\theta^{\textrm{B}}), and the output mode (θout\theta_{\textrm{out}}) in real time. Figure 2 shows each element of the 𝐒\mathbf{S} matrices. In each case, we obtain values for the corresponding symplectic matrices from the experimental data (specifically, the correlations between the quadrature of the reference mode and the output mode). The experimental results are in good agreement with the theoretical predictions. These results indicate that we succeed in the implementations of a variety of single-mode Gaussian operations by programming the measurement bases appropriately. Arbitrary single-mode Gaussian operations can be implemented via combinations of these single-step Gaussian operations.

Next, we verify the nonclassicality of these single-step quantum operations. In this work, we use quantum entanglement as our notion of nonclassicality. Table 1 shows the measurement results of the variances of the nullifiers and verification of quantum entanglement. Prior to MBQC, the reference and output modes are in a two-mode-squeezed state. The infinite squeezing limit of these states are in the zero-eigenspaces of the operators x^ref+x^in\hat{x}_{\textrm{ref}}+\hat{x}_{\textrm{in}} and p^refp^in\hat{p}_{\textrm{ref}}-\hat{p}_{\textrm{in}}, which are known as nullifiers[40]. Hence, they are correlated in momentum and anti-correlated in position. The evolution of the state and corresponding correlations can be efficiently tracked by evolving the nullifiers—the post-evolution nullifiers are denoted by δ^1\hat{\delta}_{1} and δ^2\hat{\delta}_{2}. Furthermore, measurement of δ^1\hat{\delta}_{1} and δ^2\hat{\delta}_{2} can be used to verify the nonclassicality of the output. The quantum entanglement between the output mode and the reference mode can be established when the sum of the variances of the nullifiers is below a certain threshold (see Method for derivation). We observe that, for all three operations, the variances of the nullifiers are small (below the vacuum variances), and the successes of the verifications of the quantum entanglement are also shown in Table 1. Note that the criteria used in this work are sufficient criteria, not necessary and sufficient criteria, meaning that the failures to satisfy the criteria leave the test inconclusive. A few quantum operations that do not satisfy the criteria are those involving large squeezing. See Method for more discussions on this. The non-zero variances are the results of the imperfections in the quantum correlations of the EPR states. We observe that the sum of the variances after the quantum operations are on the order of 1.50 to 1.60 units of vacuum variance for all operations. For single-step operations, theoretically, these values are determined only by the strength of the initial quantum correlations and are independent of the choices of operations.

Results in Fig. 2 and Table 1 indicate the successful implementation of single-step Gaussian operations. Our measurement system can also be used to implement multi-step quantum operations, given that the whole system is sufficiently stable. To demonstrate the stability, we implement nn-step quantum teleportation (identity operation) for various values of nn. Then, we calculate the final symplectic matrices 𝐒\mathbf{S} and the variances of the nullifiers similar to that of Fig. 2 and Table 1. The experimental results are shown in Fig. 3. First, we observe that the 𝐒\mathbf{S} matrices remain close to an identity matrix for up to n=100n=100. On the other hand, the variances of the nullifiers increase as nn increases, which is due to the finite squeezing of the system. We plot the theoretical prediction based the variance of the single-step quantum teleportation (n=1n=1) and observe that they agree well with the experimental results. This indicates our system is stable, at least up to n=100n=100, and there are no other notable imperfections during continuous operation, besides the finite squeezing.

In the verification of the multi-step operation, we select the identity operation for its simplicity in the evaluations. Ideally, the 𝐒\mathbf{S} matrix remains an identity matrix for all nn and the variances of the nullifiers increase linearly with nn. For arbitrary multi-step operations, the variances of the nullifiers will be highly dependent on how we actually implement the operations, even when the resultant 𝐒\mathbf{S} matrices are the same[41, 42]. This makes the evaluations based on the variances non-trivial for other operations besides repeated identity operation. Note that for qubit systems, one of the standard procedures for evaluation of the multi-step operations is randomized benchmarking[43], which has also been formulated for qubit-based MBQC[44]. For CV systems, however, such experimental procedures are relatively underdeveloped, in addition to the fact that there were no platform capable of large-scale MBQC. We believe that our work will also stimulate developments of an experiment-friendly CV-MBQC version of the randomized benchmarking and might even provide a testbed for it.

In summary, we have developed a programmable homodyne measurement system and used it to demonstrate a prototype of a CV quantum computer based on MBQC multiplexed in time domain with 25 MHz clock frequency. The programmable measurement system made in this work is an essential component for multi-input MBQC, in addition to the previously demonstrated 2D cluster states[11, 12]. The clock frequency is anticipated to reach at least GHz-order with our recently developed THz-bandwidth squeezed light source[45]. The number of computation steps and the quality of the operations are limited via two factors: the stability of the experimental system and the finite squeezing. Regarding the former, we have explicitly demonstrated that the stability of our system is adequate for at least one hundred steps MBQC and, based on the previous experimental result[9], the system should be stable for at least 10,000 steps of MBQC. Regarding the latter, it is imperative that we increase the squeezing level and add GKP qubits, so that fault-tolerant universal MBQC can be reached[32]. Current state-of-the-art squeezed light sources[46] already admit performance close to the demands set by theoretical predictions for the fault-tolerance threshold[14, 15, 16, 15]. Though technologically challenging, increasing the squeezing level is a relatively straightforward task. Our work is the first working prototype quantum computer based on CV optical systems and it will be interesting to explore the immediate applications of our system in the context of noisy intermediate-scale quantum computation.

Method

Experimental setup, data acquisition, and data analysis

The cluster state generation system consists of two optical parametric oscillators (OPOs) as the squeezed light sources, 50:50 beam splitters, an optical delay line, and homodyne detectors. The normalized pump amplitudes are set to about 0.7 and the variances of the initial EPR states measured at the homodyne detectors are on average 4.0-4.0 dB compared to the variance of the vacuum state for both x^\hat{x} and p^\hat{p}. For detailed specifications of each component, see Ref. [11]. The optical delay line is a free-space optical delay line of length 12 m (equivalent to a wave packet size Δt=\Delta t= 40 ns). To modify the phase of the homodyne measurement, we use an electro-optical modulator (EOM, Photline, NIR-MPX800-LN-05) and a home-made 2-CH signal generator circuit. The modulators are attached to the local oscillators of the homodyne measurements and their half-wave voltages were measured to be \sim4 V. Extended data figure 1 shows the schematic of the home-made 2-CH signal generator circuit. This circuit consists of a field-programmable gate array (FPGA; Xilinx, Artix-7), Schmitt triggers (Texas Instruments, SN74LVC1G17), analog adder circuits, and amplifiers (Analog Devices, HMC994APM5E). The FPGA generates synchronized digital signals, necessary for synchronized homodyne basis changes. The signals produced by this FPGA, however, allow switching between only two bases when used as they are. Moreover, the sums of the rise time and the fall time of the signals generated by the FPGA are about 5 ns, which is long compared to the size of the wave packet. Long rise and fall times introduce inaccuracies into the measurement process, thereby degrading the quality of the measurement-based quantum operations. To overcome these issues, we first put the signals from the FPGA into the Schmitt triggers. The sums of the rise and fall times of the outputs of the Schmitt triggers are approximately 700 ps. We then combine outputs of the Schmitt triggers by using the analog adders. The analog adder is composed of inverted amplifiers made from high-speed op-amps (Texas Instruments, OPA855). For each homodyne detector, we combined outputs from seven Schmitt triggers using the analog adders and made a signal generator that can generate 7-bit signals. The signals can be easily changed by programming the FPGA —the number of the bits directly reflects the phase precision. Note that the phase precision can be simply increased by increasing the number of the Schmitt triggers and is limited only by the circuit noise. With the current number of bits, the phase precision is expected to be between 11^{\circ} to 22^{\circ}, which is adequate for current squeezing levels. The sums of the rise and fall times of the output signals of the analog adder are about 2 ns. The signal of the analog adder is then amplified by the analog amplifier before it is sent to the EOM. Bandwidth of the amplifier (28 GHz) is much broader than that of the op-amp used in the analog adder (8 GHz gain bandwidth product). No noticeable overshoot or ringing effects are observed in the output signals and the jitter of the signals are observed to be below 1 ns. Fig. 1d shows an example of the signals that can be generated with this signal generator. Note that nn-step quantum teleportation in Fig. 3 involves keeping DC voltages constant for a long time. However, as the current amplifier cannot handle such constant DC signals with long duration, we directly use the signals of the Schmitt triggers for the measurements in Fig. 3. In the future, this can be resolved simply by replacing the amplifiers or utilizing EOMs with lower half-wave voltages, so that amplifiers can be removed.

Similar to our recent experiment[11], we injected phase reference beams into each OPO and used the interference signals between these beams for feedback control and stabilization of the optical system. In that experiment, the phase reference beams and the feedback control were on all the time. Their signals were cut off by electrical low-pass filters as they have low frequency components that are outside the frequency range of the temporal wave packets used. The present experiment introduces additional complications due to the need to change the measurement basis. When the measurement basis is changed, if the phase reference beams also enter the homodyne detectors, the result is high frequency noise that interferes with the measurement results. To prevent this, we use sample & hold method[9]. In the sampling phase, the feedback control and the phase reference beams are on. In the hold phase, they are turned off and the voltage of the electrical components in the feedback systems are held at the values used in the sampling phase. Measurements and changes to the measurement bases are performed during the hold phase. The electrical signals for controlling the timing of the sample & hold are generated from the same FPGA used in homodyne measurement basis changing, so that all the processes are synchronized. For every measurement, the phase of the homodyne measurements are initially locked in the x^\hat{x} basis before changing.

The electrical signals from the homodyne detectors are recorded with an oscilloscope (Tektronix, DP07054). We use a sampling rate of 1 GS/s and a single frame is 10 μ\mus long, corresponding to 250 wave packets. In each frame, we implement and verify the maximum possible number of operations set by the frame length. For each operation, 38,600 events are used in the estimations of each element of the SS matrix. In order to verify the nonclassicality, we also make use of 38,600 events for each linear combination of the quadrature operators for each operation. The quadrature values of the wave packets with index kk are calculated by numerically integrating the electrical signals with the mode function fk(t)f_{k}(t). The mode function we use has the form of

fk(t)={(tkΔt)exp[(tkΔt)22τ2]|tkΔt|Δt2,0|tkΔt|>Δt2,\displaystyle f_{k}(t)=\begin{cases}(t-k\Delta t)\exp\left[-\frac{(t-k\Delta t)^{2}}{2\tau^{2}}\right]&|t-k\Delta t|\leq\frac{\Delta t}{2},\\ 0&|t-k\Delta t|>\frac{\Delta t}{2},\end{cases} (2)

with τ=5\tau=5 ns. This form is similar to the one in Ref. [11], but with a different parameter to ensure that the wave packet is contained in the time window Δt=40\Delta t=40 ns, even when the effects of the electrical filters are considered (see Ref. [10] for a more detailed discussion). This is necessary especially when we consider switching of the measurement basis. The error bars for all data are calculated using a bootstrapping method.

Feedforward operations (displacements) can be implemented by postprocessing the homodyne measurement data[47]. For the explicit formulae for these feedforward operations, see the supplementary information of Ref. [9].

When homodyne detectors HD-A and HD-B are set to measure the same basis at the same time bin (blue detectors in Fig. 1d), the result is a logical measurement of the input encoded at that time step (rather than the implementation of a measurement-based gate, which occurs when the homodyne bases at A and B differ)[47]. We perform this measurement on both the reference mode, and the output mode. If we let x^(θ)=(cosθ)x^+(sinθ)p^\hat{x}(\theta)=(\cos\theta)\hat{x}+(\sin\theta)\hat{p}, then the quadratures of the reference mode and the input mode are

x^ref(θ)\displaystyle\hat{x}_{\textrm{ref}}(\theta) =12[x^A(θ)x^B(θ)],\displaystyle=\frac{1}{\sqrt{2}}\left[\hat{x}^{\textrm{A}}(\theta)-\hat{x}^{\textrm{B}}(\theta)\right], (3)
x^out(θ)\displaystyle\hat{x}_{\textrm{out}}(\theta) =12[x^A(θ)+x^B(θ)].\displaystyle=\frac{1}{\sqrt{2}}\left[\hat{x}^{\textrm{A}}(\theta)+\hat{x}^{\textrm{B}}(\theta)\right]. (4)

Quantum teleportation, Gaussian operations, and actual noise

In the limit of large squeezing, selecting measurement bases x^A(θA)=(cosθA)x^A+(sinθA)p^A\hat{x}^{\textrm{A}}(\theta^{\textrm{A}})=(\cos\theta^{\textrm{A}})\hat{x}^{\textrm{A}}+(\sin\theta^{\textrm{A}})\hat{p}^{\textrm{A}} and x^B(θB)=(cosθB)x^B+(sinθB)p^B\hat{x}^{\textrm{B}}(\theta^{\textrm{B}})=(\cos\theta^{\textrm{B}})\hat{x}^{\textrm{B}}+(\sin\theta^{\textrm{B}})\hat{p}^{\textrm{B}} implements the following Heisenberg-picture map[47]

𝐪^out=𝐕(θA,θB)𝐪^in,\displaystyle\hat{\mathbf{q}}_{\textrm{out}}=\mathbf{V}(\theta^{\textrm{A}},\theta^{\textrm{B}})\hat{\mathbf{q}}_{\textrm{in}}, (5)

where 𝐪^=(x^p^)T\hat{\mathbf{q}}=(\hat{x}\quad\hat{p})^{\textrm{T}} and

𝐕(θA,θB)=𝐑(θ+π/2)𝐒(θ)𝐑(θ+),\displaystyle\mathbf{V}(\theta^{\textrm{A}},\theta^{\textrm{B}})=\mathbf{R}(\theta_{+}-\pi/2)\mathbf{S}(\theta_{-})\mathbf{R}(\theta_{+}), (6)

with θ±=(θB±θA)/2\theta_{\pm}=(\theta^{\textrm{B}}\pm\theta^{\textrm{A}})/2, 𝐑()\mathbf{R}(\cdot) and 𝐒()\mathbf{S}(\cdot) defined the same way as in the main text, and θAθB\theta^{\textrm{A}}\neq\theta^{\textrm{B}}. The identity operation, i.e. quantum teleportation, corresponds to the case where θA=0\theta^{\textrm{A}}=0 and θB=π/2\theta^{\textrm{B}}=\pi/2. Phase rotations 𝐑(ϕ)\mathbf{R}(\phi) can be implemented by setting θA=ϕ/2\theta^{\textrm{A}}=\phi/2 and θB=ϕ/2+π/2\theta^{\textrm{B}}=\phi/2+\pi/2. Squeezing operations (with an additional π/2\pi/2 phase rotation) 𝐑(π/2)𝐒(ϕ)\mathbf{R}(\pi/2)\mathbf{S}(\phi) correspond to the case where θA=ϕ\theta^{\textrm{A}}=\phi and θB=ϕ\theta^{\textrm{B}}=-\phi. Shear operations 𝐏(ϕ)\mathbf{P}(\phi) correspond to the case where θA=0\theta^{\textrm{A}}=0 and θB=π/2ϕ\theta^{\textrm{B}}=\pi/2-\phi.

In the case of a finitely squeezed resource and in the absence of optical losses, Eq. (5) must be modified:

𝐪^out=𝐕(θA,θB)𝐪^in+(x^anc,1erxp^anc,2erp).\displaystyle\hat{\mathbf{q}}_{\textrm{out}}=\mathbf{V}(\theta^{\textrm{A}},\theta^{\textrm{B}})\hat{\mathbf{q}}_{\textrm{in}}+\begin{pmatrix}\hat{x}_{\textrm{anc},1}e^{-r_{x}}\\ \hat{p}_{\textrm{anc},2}e^{-r_{p}}\end{pmatrix}. (7)

The above includes a second term that captures the noise due to finite squeezing. This contains x^anc,1\hat{x}_{\textrm{anc},1} and p^anc,2\hat{p}_{\textrm{anc},2}, which are quadrature operators of ancillary vacuum states with squeezing parameters rxr_{x} and rpr_{p}. The unitary part 𝐕(θA,θB)\mathbf{V}(\theta^{\textrm{A}},\theta^{\textrm{B}}) is identical to the infinite squeezing case. Since the unitary part is not affected by finite squeezing effects, we can verify it separately. Note that in the actual experiment, there are optical losses in various components, which makes the actual relations more complicated. However, the fact that 𝐕(θA,θB)\mathbf{V}(\theta^{\textrm{A}},\theta^{\textrm{B}}) depends mainly on the choice of measurement basis and the noise of the operations are determined by the amount of the squeezing in the system does not change.

Estimation of 𝐒\mathbf{S} matrix

The general form of a single-mode Gaussian operation (without displacements) including Gaussian noise is

(x^outp^out)=(S11S12S21S22)(x^inp^in)+𝐍^,\displaystyle\begin{pmatrix}\hat{x}_{\textrm{out}}\\ \hat{p}_{\textrm{out}}\end{pmatrix}=\begin{pmatrix}S_{11}&S_{12}\\ S_{21}&S_{22}\end{pmatrix}\begin{pmatrix}\hat{x}_{\textrm{in}}\\ \hat{p}_{\textrm{in}}\end{pmatrix}+\hat{\mathbf{N}}, (8)

where 𝐍^\hat{\mathbf{N}} is a noise term and SS is no longer restricted to a symplectic matrix. We remove this assumption because it no longer holds when noise is involved. For example, if the input mode were entirely lost, then S=0S=0 and the contributions to the output quadratures come entirely from noise. As the quadrature values of the input mode and the output mode cannot be simultaneously measured, we use a method that does not involve such measurement.

In this work, we measure the values of each element of SS by using quantum entanglement. EPR correlation between the input and reference modes is given by

(x^refp^ref)=(x^inp^in)+𝐍^,\displaystyle\begin{pmatrix}\hat{x}_{\textrm{ref}}\\ \hat{p}_{\textrm{ref}}\end{pmatrix}=\begin{pmatrix}-\hat{x}_{\textrm{in}}\\ \hat{p}_{\textrm{in}}\end{pmatrix}+\hat{\mathbf{N}}^{\prime}, (9)

where 𝐍^\hat{\mathbf{N}}^{\prime} is a noise term due to the finite squeezing which satisfies 𝐍^=𝟎\left\langle\hat{\mathbf{N}}^{\prime}\right\rangle=\mathbf{0}. Thus, by measuring the reference modes, we can infer the quadrature values of the input modes. Using the fact that x^refp^in=x^inp^ref=0\left\langle\hat{x}_{\textrm{ref}}\hat{p}_{\textrm{in}}\right\rangle=\left\langle\hat{x}_{\textrm{in}}\hat{p}_{\textrm{ref}}\right\rangle=0 for the EPR states, we can directly obtain the elements of SS from the quadrature values by calculating

Sij=ξ^out(i)ξ^ref(j)ξ^in(j)ξ^ref(j),\displaystyle S_{ij}=\frac{\left\langle\hat{\xi}_{\textrm{out}}^{(i)}\hat{\xi}_{\textrm{ref}}^{(j)}\right\rangle}{\left\langle\hat{\xi}_{\textrm{in}}^{(j)}\hat{\xi}_{\textrm{ref}}^{(j)}\right\rangle}, (10)

where ξ^(1)=x^\hat{\xi}^{(1)}=\hat{x} and ξ^(2)=p^\hat{\xi}^{(2)}=\hat{p}.

Verification of nonclassicality and criteria for quantum inseparability

The van Loock-Furusawa criteria[48] are often used to verify genuine multi-partite inseparability in CV cluster state experiments[11, 12, 10, 9, 24]. These criteria are formulated in terms of variances of observables that consist of linear combinations of only either x^\hat{x} or p^\hat{p} across different modes. In the current experiment, however, the relationships between the output mode and the input mode as indicated by Eq. (1) are not limited to relationships containing only x^\hat{x} or p^\hat{p}.

Here we use a more general form of inseparability criteria that is applicable to our experiment[49]. First, let us consider two subsystems A and B. Then, let us consider operators δ^1\hat{\delta}_{1}, δ^2\hat{\delta}_{2} which have the following form

δ^1\displaystyle\hat{\delta}_{1} =ζ^A+ζ^B,\displaystyle=\hat{\zeta}^{\textrm{A}}+\hat{\zeta}^{\textrm{B}}, (11)
δ^2\displaystyle\hat{\delta}_{2} =ξ^A+ξ^B,\displaystyle=\hat{\xi}^{\textrm{A}}+\hat{\xi}^{\textrm{B}}, (12)

where the superscripts A, B are used to denote which subsystem the operators belongs to, and ζ^\hat{\zeta} and ξ^\hat{\xi} are arbitrary linear combinations of both x^\hat{x} and p^\hat{p} type operators. Then, similar to the proof of van Loock-Furusawa criteria[48], we can show the following: if the subsystems are separable, i.e. the density matrix is in the form ρ^=iηiρ^iAρ^iB\hat{\rho}=\sum_{i}\eta_{i}\hat{\rho}^{\textrm{A}}_{i}\otimes\hat{\rho}^{\textrm{B}}_{i} with iηi=1\sum_{i}\eta_{i}=1, then, the following relation holds:

Δ2δ^1+Δ2δ^2|[ζ^A,ξ^A]|+|[ζ^B,ξ^B]|,\displaystyle\left\langle\Delta^{2}\hat{\delta}_{1}\right\rangle+\left\langle\Delta^{2}\hat{\delta}_{2}\right\rangle\geq|\langle[\hat{\zeta}^{\textrm{A}},\hat{\xi}^{\textrm{A}}]\rangle|+|\langle[\hat{\zeta}^{\textrm{B}},\hat{\xi}^{\textrm{B}}]\rangle|, (13)

where \langle\cdot\rangle denotes the mean and Δ2\langle\Delta^{2}\cdot\rangle denotes the variance. For the linear combination of the quadrature operators, the right hand side of Eq. (13) evaluates to a constant, thus does not depend on ρ^\hat{\rho}. Therefore, violation of the above inequalities provide sufficient criteria for two-mode quantum inseparability. Note that this derivation does not tell us the best choices of linear combinations to use for any given state. It might seem natural to use the nullifiers since their variances (i.e. left side of Eq. (13)) tend to 0 in the infinite squeezing limit. When we consider the finite squeezing case, however, this is not necessarily an optimal choice. We leave the exploration of such a possibility to future work and use the nullifiers for our verification procedure.

From Eq. (13) it is clear that the thresholds for establishing quantum inseparability depend on the quantum operations we perform. As an example, let us consider the variance of the nullifiers as they evolve under squeezing operations: (sinϕ)p^out(cosϕ)x^ref(\sin\phi)\hat{p}_{\textrm{out}}-(\cos\phi)\hat{x}_{\textrm{ref}} and (cosϕ)x^out(sinϕ)p^ref(\cos\phi)\hat{x}_{\textrm{out}}-(\sin\phi)\hat{p}_{\textrm{ref}}. Theoretically, the variances of these operators are determined by the squeezing level in the system and have the same values for all ϕ\phi (i.e. same for all squeezing parameters of the squeezing operations). On the other hand, the right hand side of Eq. (13) is |sin2ϕ|\hbar|\sin 2\phi|, which means that the larger the squeezing factor is (i.e. the closer ϕ\phi is to 0 or π/2\pi/2) the more severe the threshold becomes. Therefore, if we want to implement a gate that involves high squeezing and still observe quantum entanglement using this criteria, we would expect that the initial resource state must be highly squeezed.

Theoretical prediction of the variances in Fig. 3b

When we implement nn-step identity operations, theoretically, the variances will increase linearly with the number of steps. If we measure the nullifiers after a single-step, then the variances become

Δ2[12(x^out+x^ref)]\displaystyle\left\langle\Delta^{2}\left[\frac{1}{\sqrt{2}}\left(\hat{x}_{\textrm{out}}+\hat{x}_{\textrm{ref}}\right)\right]\right\rangle =2×2e2rx,\displaystyle=2\times\frac{\hbar}{2}e^{-2r_{x}}, (14)
Δ2[12(p^outp^ref)]\displaystyle\left\langle\Delta^{2}\left[\frac{1}{\sqrt{2}}\left(\hat{p}_{\textrm{out}}-\hat{p}_{\textrm{ref}}\right)\right]\right\rangle =2×2e2rp,\displaystyle=2\times\frac{\hbar}{2}e^{-2r_{p}}, (15)

where we assume that the two-mode-squeezed states used as both the input and the quantum teleportation(s) have the same level of squeezing. Hence, we can infer increases in variances after nn steps and draw a theoretical plot. After nn steps, the variances of the nullifiers become

Δ2[12(x^out+x^ref)]n\displaystyle\left\langle\Delta^{2}\left[\frac{1}{\sqrt{2}}\left(\hat{x}_{\textrm{out}}+\hat{x}_{\textrm{ref}}\right)\right]\right\rangle_{n} =(n+1)×2e2rx,\displaystyle=(n+1)\times\frac{\hbar}{2}e^{-2r_{x}}, (16)
Δ2[12(p^outp^ref)]n\displaystyle\left\langle\Delta^{2}\left[\frac{1}{\sqrt{2}}\left(\hat{p}_{\textrm{out}}-\hat{p}_{\textrm{ref}}\right)\right]\right\rangle_{n} =(n+1)×2e2rp.\displaystyle=(n+1)\times\frac{\hbar}{2}e^{-2r_{p}}. (17)

The above equations are used in the theoretical plots of Fig. 3b.

References

  • [1] Michael A. Nielsen and Isaac L. Chuang “Quantum Computation and Quantum Information” Cambridge: Cambridge University Press, 2000
  • [2] P. Krantz et al. “A quantum engineer’s guide to superconducting qubits” In Applied Physics Reviews 6.2, 2019, pp. 021318 DOI: 10.1063/1.5089550
  • [3] Colin D. Bruzewicz, John Chiaverini, Robert McConnell and Jeremy M. Sage “Trapped-ion quantum computing: Progress and challenges” In Applied Physics Reviews 6.2, 2019, pp. 021314 DOI: 10.1063/1.5088164
  • [4] S. Takeda and A. Furusawa “Toward large-scale fault-tolerant universal photonic quantum computing” In APL Photonics 4.6, 2019, pp. 060902 DOI: 10.1063/1.5100160
  • [5] Sergei Slussarenko and Geoff J. Pryde “Photonic quantum information processing: A concise review” In Applied Physics Reviews 6.4, 2019, pp. 041303 DOI: 10.1063/1.5115814
  • [6] Robert Raussendorf and Hans J. Briegel “A One-Way Quantum Computer” In Phys. Rev. Lett. 86 American Physical Society, 2001, pp. 5188–5191 DOI: 10.1103/PhysRevLett.86.5188
  • [7] Nicolas C. Menicucci et al. “Universal Quantum Computation with Continuous-Variable Cluster States” In Phys. Rev. Lett. 97 American Physical Society, 2006, pp. 110501 DOI: 10.1103/PhysRevLett.97.110501
  • [8] Nicolas C. Menicucci “Temporal-mode continuous-variable cluster states using linear optics” In Phys. Rev. A 83 American Physical Society, 2011, pp. 062314 DOI: 10.1103/PhysRevA.83.062314
  • [9] Shota Yokoyama et al. “Ultra-large-scale continuous-variable cluster states multiplexed in the time domain” In Nature Photonics 7.12, 2013, pp. 982–986 DOI: 10.1038/nphoton.2013.287
  • [10] Jun-ichi Yoshikawa et al. “Invited Article: Generation of one-million-mode continuous-variable cluster state by unlimited time-domain multiplexing” In APL Photonics 1.6, 2016, pp. 060801 DOI: 10.1063/1.4962732
  • [11] Warit Asavanant et al. “Generation of time-domain-multiplexed two-dimensional cluster state” In Science 366.6463 American Association for the Advancement of Science, 2019, pp. 373–376 DOI: 10.1126/science.aay2645
  • [12] Mikkel V. Larsen et al. “Deterministic generation of a two-dimensional cluster state” In Science 366.6463 American Association for the Advancement of Science, 2019, pp. 369–372 DOI: 10.1126/science.aay4354
  • [13] Daniel Gottesman, Alexei Kitaev and John Preskill “Encoding a qubit in an oscillator” In Phys. Rev. A 64 American Physical Society, 2001, pp. 012310 DOI: 10.1103/PhysRevA.64.012310
  • [14] Nicolas C. Menicucci “Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States” In Phys. Rev. Lett. 112 American Physical Society, 2014, pp. 120504 DOI: 10.1103/PhysRevLett.112.120504
  • [15] Kosuke Fukui, Akihisa Tomita, Atsushi Okamoto and Keisuke Fujii “High-Threshold Fault-Tolerant Quantum Computation with Analog Quantum Error Correction” In Phys. Rev. X 8 American Physical Society, 2018, pp. 021054 DOI: 10.1103/PhysRevX.8.021054
  • [16] Blayney W. Walshe, Lucas J. Mensen, Ben Q. Baragiola and Nicolas C. Menicucci “Robust fault tolerance for continuous-variable cluster states with excess antisqueezing” In Phys. Rev. A 100 American Physical Society, 2019, pp. 010301 DOI: 10.1103/PhysRevA.100.010301
  • [17] Frank Arute et al. “Quantum supremacy using a programmable superconducting processor” In Nature 574.7779, 2019, pp. 505–510 DOI: 10.1038/s41586-019-1666-5
  • [18] Hui Wang et al. “Boson Sampling with 20 Input Photons and a 60-Mode Interferometer in a 10141{0}^{14}-Dimensional Hilbert Space” In Phys. Rev. Lett. 123 American Physical Society, 2019, pp. 250503 DOI: 10.1103/PhysRevLett.123.250503
  • [19] Hans J. Briegel and Robert Raussendorf “Persistent Entanglement in Arrays of Interacting Particles” In Phys. Rev. Lett. 86 American Physical Society, 2001, pp. 910–913 DOI: 10.1103/PhysRevLett.86.910
  • [20] I. Schwartz et al. “Deterministic generation of a cluster state of entangled photons” In Science 354.6311 American Association for the Advancement of Science, 2016, pp. 434–437 DOI: 10.1126/science.aah4758
  • [21] Christian Reimer et al. “High-dimensional one-way quantum processing implemented on d-level cluster states” In Nature Physics 15.2, 2019, pp. 148–153 DOI: 10.1038/s41567-018-0347-x
  • [22] Ming Gong et al. “Genuine 12-Qubit Entanglement on a Superconducting Quantum Processor” In Phys. Rev. Lett. 122 American Physical Society, 2019, pp. 110501 DOI: 10.1103/PhysRevLett.122.110501
  • [23] B.. Lanyon et al. “Measurement-Based Quantum Computation with Trapped Ions” In Phys. Rev. Lett. 111 American Physical Society, 2013, pp. 210501 DOI: 10.1103/PhysRevLett.111.210501
  • [24] Moran Chen, Nicolas C. Menicucci and Olivier Pfister “Experimental Realization of Multipartite Entanglement of 60 Modes of a Quantum Optical Frequency Comb” In Phys. Rev. Lett. 112 American Physical Society, 2014, pp. 120505 DOI: 10.1103/PhysRevLett.112.120505
  • [25] P. Walther et al. “Experimental one-way quantum computing” In Nature 434.7030, 2005, pp. 169–176 DOI: 10.1038/nature03347
  • [26] Ryuji Ukai et al. “Demonstration of Unconditional One-Way Quantum Computations for Continuous Variables” In Phys. Rev. Lett. 106 American Physical Society, 2011, pp. 240504 DOI: 10.1103/PhysRevLett.106.240504
  • [27] Wei-Bo Gao et al. “Experimental measurement-based quantum computing beyond the cluster-state model” In Nature Photonics 5.2, 2011, pp. 117–123 DOI: 10.1038/nphoton.2010.283
  • [28] James G. Titchener, Alexander S. Solntsev and Andrey A. Sukhorukov “Reconfigurable cluster-state generation in specially poled nonlinear waveguide arrays” In Phys. Rev. A 101 American Physical Society, 2020, pp. 023809 DOI: 10.1103/PhysRevA.101.023809
  • [29] Stephen D. Bartlett, Barry C. Sanders, Samuel L. Braunstein and Kae Nemoto “Efficient Classical Simulation of Continuous Variable Quantum Information Processes” In Phys. Rev. Lett. 88 American Physical Society, 2002, pp. 097904 DOI: 10.1103/PhysRevLett.88.097904
  • [30] Petr Marek et al. “General implementation of arbitrary nonlinear quadrature phase gates” In Phys. Rev. A 97 American Physical Society, 2018, pp. 022329 DOI: 10.1103/PhysRevA.97.022329
  • [31] Kazunori Miyata et al. “Implementation of a quantum cubic gate by an adaptive non-Gaussian measurement” In Phys. Rev. A 93 American Physical Society, 2016, pp. 022301 DOI: 10.1103/PhysRevA.93.022301
  • [32] Ben Q. Baragiola et al. “All-Gaussian Universality and Fault Tolerance with the Gottesman-Kitaev-Preskill Code” In Phys. Rev. Lett. 123 American Physical Society, 2019, pp. 200502 DOI: 10.1103/PhysRevLett.123.200502
  • [33] Mitsuyoshi Yukawa et al. “Generating superposition of up-to three photons for continuous variable quantum information processing” In Opt. Express 21.5 OSA, 2013, pp. 5529–5535 DOI: 10.1364/OE.21.005529
  • [34] P. Campagne-Ibarcq et al. “A stabilized logical quantum bit encoded in grid states of a superconducting cavity” In arXiv e-prints, 2019, pp. arXiv:1907.12487 arXiv:1907.12487 [quant-ph]
  • [35] C. Flühmann et al. “Encoding a qubit in a trapped-ion mechanical oscillator” In Nature 566.7745, 2019, pp. 513–517 DOI: 10.1038/s41586-019-0960-6
  • [36] Jacob Hastrup, Jonas Schou Neergaard-Nielsen and Ulrik Lund Andersen “Deterministic generation of a four-component optical cat state” In Opt. Lett. 45.3 OSA, 2020, pp. 640–643 DOI: 10.1364/OL.383194
  • [37] Daniel J. Weigand and Barbara M. Terhal “Generating grid states from Schrödinger-cat states without postselection” In Phys. Rev. A 97 American Physical Society, 2018, pp. 022341 DOI: 10.1103/PhysRevA.97.022341
  • [38] Ilan Tzitrin, J. Bourassa, Nicolas C. Menicucci and Krishna Kumar Sabapathy “Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes” In Phys. Rev. A 101 American Physical Society, 2020, pp. 032315 DOI: 10.1103/PhysRevA.101.032315
  • [39] Seth Lloyd and Samuel L. Braunstein “Quantum Computation over Continuous Variables” In Phys. Rev. Lett. 82 American Physical Society, 1999, pp. 1784–1787 DOI: 10.1103/PhysRevLett.82.1784
  • [40] Nicolas C. Menicucci, Steven T. Flammia and Peter Loock “Graphical calculus for Gaussian pure states” In Phys. Rev. A 83 American Physical Society, 2011, pp. 042335 DOI: 10.1103/PhysRevA.83.042335
  • [41] Rafael N. Alexander, Seiji C. Armstrong, Ryuji Ukai and Nicolas C. Menicucci “Noise analysis of single-mode Gaussian operations using continuous-variable cluster states” In Phys. Rev. A 90 American Physical Society, 2014, pp. 062324 DOI: 10.1103/PhysRevA.90.062324
  • [42] Mikkel V. Larsen, Jonas S. Neergaard-Nielsen and Ulrik L. Andersen “Architecture and noise analysis of continuous variable quantum gates using two-dimensional cluster states” In arXiv e-prints, 2020, pp. arXiv:2005.13513 arXiv:2005.13513 [quant-ph]
  • [43] E. Knill et al. “Randomized benchmarking of quantum gates” In Phys. Rev. A 77 American Physical Society, 2008, pp. 012307 DOI: 10.1103/PhysRevA.77.012307
  • [44] Rafael N. Alexander, Peter S. Turner and Stephen D. Bartlett “Randomized benchmarking in measurement-based quantum computing” In Phys. Rev. A 94 American Physical Society, 2016, pp. 032303 DOI: 10.1103/PhysRevA.94.032303
  • [45] Takahiro Kashiwazaki et al. “Continuous-wave 6-dB-squeezed light with 2.5-THz-bandwidth from single-mode PPLN waveguide” In APL Photonics 5.3, 2020, pp. 036104 DOI: 10.1063/1.5142437
  • [46] Henning Vahlbruch, Moritz Mehmet, Karsten Danzmann and Roman Schnabel “Detection of 15 dB Squeezed States of Light and their Application for the Absolute Calibration of Photoelectric Quantum Efficiency” In Phys. Rev. Lett. 117 American Physical Society, 2016, pp. 110801 DOI: 10.1103/PhysRevLett.117.110801
  • [47] Rafael N. Alexander, Shota Yokoyama, Akira Furusawa and Nicolas C. Menicucci “Universal quantum computation with temporal-mode bilayer square lattices” In Phys. Rev. A 97 American Physical Society, 2018, pp. 032302 DOI: 10.1103/PhysRevA.97.032302
  • [48] Peter Loock and Akira Furusawa “Detecting genuine multipartite continuous-variable entanglement” In Phys. Rev. A 67 American Physical Society, 2003, pp. 052315 DOI: 10.1103/PhysRevA.67.052315
  • [49] Ryuji Ukai “Multi-Step Multi-Input One-Way Quantum Information Processing with Spatial and Temporal Modes of Light” Tokyo: Springer Japan, 2015

Acknowledgments

Funding

This work was partly supported by JSPS KAKENHI (Grant No. 18H05207), the Core Research for Evolutional Science and Technology (CREST) (Grant No. JPMJCR15N5) of the Japan Science and Technology Agency (JST), UTokyo Foundation, donations from Nichia Corporation, and the Australian Research Council Centre of Excellence for Quantum Computation and Communication Technology (Project No. CE170100012). W.A. acknowledges financial support from the Japan Society for the Promotion of Science (JSPS). B.C. acknowledges financial support from Program of Excellence in Photon Science (XPS). T.N. acknowledges financial support from Forefront Physics and Mathematics Program to Drive Transformation (FoPM). R. N. A. is supported by National Science Foundation grant PHY-1630114.

Author contributions

W.A. and B.C. conceive the project and the experiment was supervised by S.Y., M.E., J.Y., H.Y., and A.F. R.N.A., N.C.M., and W.A. work on the theory for the experiment. B.C., W.A. and T.N. build the optical part of the setup. B.C., T.E., W.A. and M.E. design, make, and test the electrical circuits for homodyne measurement basis switching. B.C. and T.E. write the code to program FPGA in quantum operations. W.A. and B.C. carry out the experiment and acquire the experimental data. W.A. perform data analysis, visualization of experimental data, and theoretical predictions of the experimental results. W.A. write the manuscript with assistance from all the co-authors.

Competing financial interests

The authors declare no competing financial interests.

Data and materials availability

Data that supporting the finding are available upon reasonable request. Any correspondence and request should be addressed to A. F.

Refer to caption
Figure 1: MBQC in time domain and its verification. MBQC using a, local measurements on 1D cluster states and b, non-local measurements on two-mode-squeezed states. The term “non-local” measurement here refers to local homodyne measurements on each mode after a beamsplitter interaction. c, Experimental system for MBQC multiplexed in time domain. TMS, two-mode-squeezed state; OPO, optical parametric oscillator; BS, beamsplitter; ODL, optical delay line; Δt\Delta t, time width of the wave packet; HD, homodyne detector; LO, local oscillator; EOM, electro-optic modulator. The phases of each LO (θA\theta^{A} and θB\theta^{B}) are proportional to VA(t)V^{\textrm{A}}(t) and VB(t)V^{\textrm{B}}(t), respectively. d, An example of the electric signals we can generate and use for switching measurement bases. The details of the circuitry are discussed in Method. e, Verification of nn-step quantum operations using quantum entanglement. Measurement bases of the non-local measurements are determined by the bases θA\theta^{\textrm{A}} and θB\theta^{\textrm{B}} at HD-A and HD-B. Feedforward operations can be delayed and implemented numerically at the end for Gaussian operations. The blue detectors show the measurements of the reference mode and the output mode at bases θref\theta_{\textrm{ref}} and θout\theta_{\textrm{out}} (see Method for more details on this).
Refer to caption
Figure 2: Verification of single-step quantum operations. The input–output relations are of the form (x^outp^out)=(S11S12S21S22)(x^inp^in)\begin{pmatrix}\hat{x}_{\textrm{out}}\\ \hat{p}_{\textrm{out}}\end{pmatrix}=\begin{pmatrix}S_{11}&S_{12}\\ S_{21}&S_{22}\end{pmatrix}\begin{pmatrix}\hat{x}_{\textrm{in}}\\ \hat{p}_{\textrm{in}}\end{pmatrix}. Each subfigure shows plots of SijS_{ij} of a, phase rotation 𝐑(ϕ)\mathbf{R}(\phi), b, shear 𝐏(ϕ)\mathbf{P}(\phi), and c, squeezing with 90 rotation 𝐑(π/2)𝐒(ϕ)\mathbf{R}(\pi/2)\mathbf{S}(\phi). Each point is obtained using 38,600 correlation measurements (see method). The error bars are also plotted. The dashed lines are ideal theoretical plots.
Table 1: Variances and entanglement threshold of various quantum operations.
Nullifiers Variances of the nullifiers
Operation Relation δ^1\hat{\delta}_{1} δ^2\hat{\delta}_{2} ϕ()\phi\,(^{\circ}) δ^1\hat{\delta}_{1} δ^2\hat{\delta}_{2} Sum Threshold
0 0.80±0.010.80\pm 0.01 0.83±0.010.83\pm 0.01 1.63±0.021.63\pm 0.02
22.5\pagecolor{gray!25}22.5 0.81±0.010.81\pm 0.01 0.68±0.010.68\pm 0.01 1.49±0.021.49\pm 0.02
22.5-22.5 0.81±0.010.81\pm 0.01 0.68±0.010.68\pm 0.01 1.49±0.021.49\pm 0.02
4545 0.80±0.010.80\pm 0.01 0.68±0.010.68\pm 0.01 1.48±0.021.48\pm 0.02
45-45 0.80±0.010.80\pm 0.01 0.69±0.010.69\pm 0.01 1.49±0.021.49\pm 0.02
67.567.5 0.78±0.010.78\pm 0.01 0.72±0.010.72\pm 0.01 1.50±0.021.50\pm 0.02
67.5-67.5 0.81±0.010.81\pm 0.01 0.70±0.010.70\pm 0.01 1.51±0.021.51\pm 0.02
9090 0.77±0.010.77\pm 0.01 0.73±0.010.73\pm 0.01 1.50±0.021.50\pm 0.02
Phase rotation (x^outp^out)=(cosϕsinϕsinϕcosϕ)(x^refp^ref)\begin{pmatrix}\hat{x}_{\textrm{out}}\\ \hat{p}_{\textrm{out}}\end{pmatrix}=\begin{pmatrix}-\cos\phi&\sin\phi\\ \sin\phi&\cos\phi\end{pmatrix}\begin{pmatrix}\hat{x}_{\textrm{ref}}\\ \hat{p}_{\textrm{ref}}\end{pmatrix} 12[x^out(ϕ/2)+x^ref(ϕ/2)]\frac{1}{\sqrt{2}}[\hat{x}_{\textrm{out}}(-\phi/2)+\hat{x}_{\textrm{ref}}(-\phi/2)] 12[p^out(ϕ/2)p^ref(ϕ/2)]\frac{1}{\sqrt{2}}[\hat{p}_{\textrm{out}}(-\phi/2)-\hat{p}_{\textrm{ref}}(-\phi/2)] 90-90 0.77±0.010.77\pm 0.01 0.72±0.010.72\pm 0.01 1.49±0.021.49\pm 0.02 2.00
1515 0.81±0.010.81\pm 0.01 0.78±0.010.78\pm 0.01 1.59±0.021.59\pm 0.02 1.00
2020 0.82±0.010.82\pm 0.01 0.81±0.010.81\pm 0.01 1.63±0.021.63\pm 0.02 1.29
2525 0.82±0.010.82\pm 0.01 0.78±0.010.78\pm 0.01 1.60±0.021.60\pm 0.02 1.53
3030 0.83±0.010.83\pm 0.01 0.77±0.010.77\pm 0.01 1.60±0.021.60\pm 0.02 1.73
3535 0.84±0.010.84\pm 0.01 0.80±0.010.80\pm 0.01 1.64±0.021.64\pm 0.02 1.87
4040 0.81±0.010.81\pm 0.01 0.77±0.010.77\pm 0.01 1.58±0.021.58\pm 0.02 1.96
4545 0.80±0.010.80\pm 0.01 0.79±0.010.79\pm 0.01 1.59±0.021.59\pm 0.02 2.00
5050 0.82±0.010.82\pm 0.01 0.77±0.010.77\pm 0.01 1.59±0.021.59\pm 0.02 1.96
5555 0.81±0.010.81\pm 0.01 0.77±0.010.77\pm 0.01 1.58±0.021.58\pm 0.02 1.87
6060 0.80±0.010.80\pm 0.01 0.77±0.010.77\pm 0.01 1.57±0.021.57\pm 0.02 1.73
6565 0.84±0.010.84\pm 0.01 0.78±0.010.78\pm 0.01 1.62±0.021.62\pm 0.02 1.53
7070 0.84±0.010.84\pm 0.01 0.76±0.010.76\pm 0.01 1.60±0.021.60\pm 0.02 1.29
Squeezing (x^outp^out)=(0tanϕ1tanϕ0)(x^refp^ref)\begin{pmatrix}\hat{x}_{\textrm{out}}\\ \hat{p}_{\textrm{out}}\end{pmatrix}=\begin{pmatrix}0&\tan\phi\\ \frac{1}{\tan\phi}&0\end{pmatrix}\begin{pmatrix}\hat{x}_{\textrm{ref}}\\ \hat{p}_{\textrm{ref}}\end{pmatrix} (cosϕ)x^out(sinϕ)p^ref(\cos\phi)\hat{x}_{\textrm{out}}-(\sin\phi)\hat{p}_{\textrm{ref}} (sinϕ)p^out(cosϕ)x^ref(\sin\phi)\hat{p}_{\textrm{out}}-(\cos\phi)\hat{x}_{\textrm{ref}} 7575 0.81±0.010.81\pm 0.01 0.76±0.010.76\pm 0.01 1.57±0.021.57\pm 0.02 1.00
Shear (x^outp^out)=(102tanϕ1)(x^refp^ref)\begin{pmatrix}\hat{x}_{\textrm{out}}\\ \hat{p}_{\textrm{out}}\end{pmatrix}=\begin{pmatrix}-1&0\\ -2\tan\phi&1\end{pmatrix}\begin{pmatrix}\hat{x}_{\textrm{ref}}\\ \hat{p}_{\textrm{ref}}\end{pmatrix} 12(x^out+x^ref)\frac{1}{\sqrt{2}}(\hat{x}_{\textrm{out}}+\hat{x}_{\textrm{ref}}) 12[p^out(ϕ)p^ref(ϕ)]\frac{1}{\sqrt{2}}\left[\hat{p}_{\textrm{out}}(\phi)-\hat{p}_{\textrm{ref}}(\phi)\right] 0 0.82±0.010.82\pm 0.01 0.89±0.010.89\pm 0.01 1.71±0.021.71\pm 0.02 2.00
1010 0.82±0.010.82\pm 0.01 0.70±0.010.70\pm 0.01 1.54±0.021.54\pm 0.02 1.96
10-10 0.85±0.010.85\pm 0.01 0.72±0.010.72\pm 0.01 1.57±0.021.57\pm 0.02 1.96
2020 0.82±0.010.82\pm 0.01 0.71±0.010.71\pm 0.01 1.53±0.021.53\pm 0.02 1.87
20-20 0.85±0.010.85\pm 0.01 0.72±0.010.72\pm 0.01 1.57±0.021.57\pm 0.02 1.87
3030 0.85±0.010.85\pm 0.01 0.74±0.010.74\pm 0.01 1.59±0.021.59\pm 0.02 1.73
30-30 0.83±0.010.83\pm 0.01 0.73±0.010.73\pm 0.01 1.56±0.021.56\pm 0.02 1.73
4545 0.83±0.010.83\pm 0.01 0.75±0.010.75\pm 0.01 1.58±0.021.58\pm 0.02 1.41
45-45 0.83±0.010.83\pm 0.01 0.75±0.010.75\pm 0.01 1.58±0.021.58\pm 0.02 1.41
6060 0.81±0.010.81\pm 0.01 0.77±0.010.77\pm 0.01 1.58±0.021.58\pm 0.02 1.00
60-60 0.83±0.010.83\pm 0.01 0.78±0.010.78\pm 0.01 1.61±0.021.61\pm 0.02 1.00

Note that x^(ϕ)=(cosϕ)x^+(sinϕ)p^\hat{x}(\phi)=(\cos\phi)\hat{x}+(\sin\phi)\hat{p} and p^(ϕ)=(cosϕ)p^(sinϕ)x^\hat{p}(\phi)=(\cos\phi)\hat{p}-(\sin\phi)\hat{x}.
The checkmarks ✓indicate whether the sums of the variances are below the inseparability threshold or not.
Variances are shown in vacuum variances unit (i.e. multiples of /2\hbar/2).

Refer to caption
Figure 3: Multi-step quantum operations. Identity operations are repeatedly implemented and evaluated. a, Elements of the symplectic matrix 𝐒\mathbf{S}. b, Variances of the nullifiers. 0 dB is the vacuum variance. Each point in both figures are calculated using 38,600 events. Dashed lines: theoretical predictions. Predictions of the variances are based on the results of the single-step identity operation. Errors of the elements of 𝐒\mathbf{S} matrix are plotted and the errors of the variances are about ±0.03\pm 0.03 dB for all points.
Refer to caption
Extended data figure 1: Schematic diagram of our home-made 2-CH signal generator circuit.