Demonstration of a Controlled-Phase Gate for Continuous-Variable One-Way Quantum Computation

In this paper, we study the transformations that are obtained in one-way quantum computation on continuous-variable cluster states of various configurations. Of all possible cluster configurations, we choose those that are suitable for universal Gaussian operations.

Continuous-variable measurement-based quantum computation, which requires deterministically generated large-scale cluster states, is a promising candidate for practical, scalable, universal, and fault-tolerant quantum computation. In this work, based on our compact and scalable scheme of generating a two-dimensional spatiotemporal cluster state, a complete architecture including cluster state preparation, gate implementations, and error correction, is proposed. First, a scheme for generating two-dimensional large-scale continuous-variable cluster state by multiplexing both the temporal and spatial domains is proposed. Then, the corresponding gate implementations by gate teleportation are discussed and the actual gate noise from the generated cluster state is considered. After that, the quantum error correction can be further achieved by utilizing the square-lattice Gottesman-Kitaev-Preskill (GKP) code. Finally, a fault-tolerant quantum computation can be realized by introducing bias into the square-lattice GKP code (to protect against phase-flip errors) and concatenating a repetition code (to handle the residual bit-flip errors), with a squeezing threshold of 12.3 dB. Our work provides a possible option for a complete fault-tolerant quantum computation architecture in the future.

Measurement-Based Quantum Computing (MBQC), proposed in 2001 is a model of quantum computing that achieves quantum computation by performing a series of adaptive single-qubit measurements on an entangled cluster state. Our project is aimed at introducing MBQC to a wide audience ranging from high school students to quantum computing researchers through a Tangram puzzle with a modified set of rules played on an applet. The player is provided a quantum circuit which they have to map to MBQC using polyominos. Polyominos, the building blocks of our game, consist of square tiles joined edge-to-edge to form different shapes. Each tile represents a measurement basis, differentiated by its color. Polyominos rest on a square-grid playing board, which signifies a cluster state. We show that mapping a quantum circuit to MBQC is equivalent to arranging a set of polyominos—each corresponding to a gate in the circuit—on the playing board, subject to certain rules. We state the rules in simple terms with no reference to quantum computing. One such rule describes ways to deform a polyomino while it still correctly realizes a given quantum gate. The player has to place polyominos on the playing board conforming to the rules. Any correct solution creates a valid realization of the quantum circuit in MBQC. A higher-scoring correct solution fills up less space on the board, resulting in a lower-overhead embedding of the circuit in MBQC, a challenging research problem.

Although qubits are the leading candidate for the basic elements in a quantum computer, there are also a range of reasons to consider using higher dimensional qudits or quantum continuous variables (QCVs). In this paper we use a general `quantum variable' formalism to propose a method of quantum computation in which ancillas are used to mediate gates on a well-isolated `quantum memory' register and which may be applied to the setting of qubits, qudits (for $d>2$) or QCVs. More specifically, we present a model in which universal quantum computation may be implemented on a register using only: repeated applications of a single fixed two-body ancilla-register interaction gate, ancillas prepared in a single state, and local measurements of these ancillas. In order to maintain determinism in the computation, adaptive measurements via a classical-feedforward of measurement outcomes are used, with the method similar to that in measurement-based quantum computation (MBQC). We show that our model has the same hybrid quantum-classical processing advantages as MBQC, including the power to implement any Clifford circuit in essentially one layer of quantum computation. In some physical settings, high-quality measurements of the ancillas may be highly challenging or not possible, and hence we also present a globally unitary model which replaces the need for measurements of the ancillas with the requirement for ancillas to be prepared in states from a fixed orthonormal basis. Finally, we discuss settings in which these models may be of practical interest.

Cluster states, a special type of highly entangled states, are a universal resource for measurement-based quantum computation. Here, we propose an efficient one-step generation scheme for cluster states in semiconductor quantum dot molecules, where qubits are encoded on singlet and triplet states of two coupled quantum dots. By applying a collective electrical field or simultaneously adjusting interdot bias voltages of all double-dot molecules, we get a switchable Ising-like interaction between any two adjacent quantum molecule qubits. The initialization, the single-qubit measurement, and the experimental parameters are discussed. It is shown that preparation of large cluster states and one-way quantum computation are implementable in semiconductor quantum dots with the present techniques.

In this work, we study the generation of non-Gaussian quantum states of light using multimode quantum resources. We first propose a theoretical framework to describe photon subtraction operation - a well known non-Gaussian operation - applied to a multimode Gaussian state. We apply this framework to the case of Schrödinger kitten state generation using a multimode squeezed vacuum as input state. We show that a monomode non-Gaussian state with high purity can be generated by a better choice of the different experimental parameters. Then, we propose a new protocol to generate high amplitude non-Gaussian states using spectral multiplexing of input states and Gaussian operations. We show that this protocol can implement the cat breeding operation with less complexity. We show also that this protocol can be used for the generation of approximated GKP state.

Optical switches and rerouting networks are considered essential in optical quantum computers where they are used for injection and dejection of the necessary quantum states into an optical quantum computer. Practical optical switches and rerouting networks are, however, experimentally challenging as they must have extremely low loss, small switching time, high repetition rate, and minimum optical nonlinearity, requirements that are difficult to achieve simultaneously. In this paper, we present an optical quantum computation platform that does not require such optical switches. Our method is based on continuous-variable measurement-based quantum computation where, instead of the typical cluster states, we modify the structure of the quantum entanglement, so that the quantum teleportation protocol can be employed instead of optical switching and rerouting. The quantum entanglement structure in our architecture has additional modes that allow quantum states to be teleported in or out of the computation along the cluster state, a task that normally requires optical switches. We also outline how to combine our platform with Gottesman-Kitaev-Preskill encoding, the currently most promising encoding for a continuous-variable system.

One of the biggest challenges to a viable quantum computer with real-world impact is scaling it up to handle large computations. Continuous-variable (CV) cluster states, which are resource states for measurement-based quantum computation, can be made on a vast scale with minimal experimental resources. I will present recent experimental breakthroughs in producing large-scale CV cluster states, and I will illustrate how to use these states for fault-tolerant quantum computation.

Multidimensional cluster states are a key resource for robust quantum communication, measurement-based quantum computing and quantum metrology. Here, we present a device capable of emitting large-scale entangled microwave photonic states in a two dimensional ladder structure. The device consists of a pair of coupled superconducting transmon qubits which are each tuneably coupled to a common output waveguide. This architecture permits entanglement between each transmon and a deterministically emitted photonic qubit. By interleaving two-qubit gates with controlled photon emission, we generate 2 × n grids of time- and frequency-multiplexed cluster states of itinerant microwave photons. We generate states with fidelities above 0.50 for up to eight qubits and, in addition, observe nonzero localizable entanglement for states of up to 16 qubits. We expect the device architecture to be capable of generating a wide range of other tensor network states such as tree graph states, repeater states or the ground state of the toric code, and to be readily scalable to generate larger and higher dimensional states.

Cluster states, whose model are a remarkably rich structure in measurement-based quantum computation, hold high degree of entanglement, while entanglement is very fragile during the process of transmission because of the inevitable interaction with the environment. We propose two entanglement concentration protocols for four-particle linear cluster states which and are susceptible to the decoherence and the imperfect communication setups. In the first protocol, POVM operators are introduced to maximize the success probability, and the second protocol is based on cross-Kerr nonlinearity which is utilized to check the parity between the original particle and the ancillary particle. Both of the protocols have their own advantages. The first one can be easily realized in experiment by linear optics, while the one with cross-Kerr nonlinearity reach more than 90% success probability by iteration. Since the wide application of cluster states, the two protocols are efficient and valuable to different fields of quantum communication.

Cluster states are a class of multiqubit entangled states with broad applications such as quantum metrology and one-way quantum computing. Here, we present a protocol to generate frequency-bin-encoded dual-rail cluster states using a superconducting circuit consisting of a fixed-frequency transmon qubit, a resonator, and a Purcell filter. We implement time-frequency multiplexing by sequentially emitting copropagating microwave photons, where each time bin contains a dual-rail qubit encoded in two distinct frequency modes, and adjacent time bins are entangled to form the cluster state. The frequency-bin dual-rail encoding enables erasure detection based on photon occupancy. We characterize the state fidelity using quantum tomography and quantify the multipartite entanglement using localizable entanglement. Our implementation achieves a state fidelity exceeding <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"> <a:mn>50</a:mn> <a:mi mathvariant="normal">%</a:mi> </a:math> for a cluster state consisting of up to four logical qubits. The localizable entanglement remains across chains of up to seven logical qubits. After discarding the erasure errors, the fidelity exceeds <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" display="inline"> <d:mn>50</d:mn> <d:mi mathvariant="normal">%</d:mi> </d:math> for states with up to eight logical qubits, and the entanglement persists across chains of up to 11 qubits. These results highlight the improved robustness of frequency-bin dual-rail encoding against photon loss compared to conventional single-rail schemes. This work provides a scalable pathway toward high-dimensional entangled state generation and photonic quantum information processing in the microwave domain.

Circuit-based quantum computing (CBQC), also known as the gate model, is currently regarded as the leading paradigm for performing quantum computation and has garnered widespread interest due to its relatively better-established implementation and close intuitive resemblance to classical computation. However, an alternative model that solely utilizes single-qubit measurements on entangled states to perform computation, namely the measurement-based quantum computing (MBQC), has started to attract further research interest as it is deemed more naturally suited for certain quantum hardware architectures, though its actual implementation remains largely underexplored. Recently, there have been preliminary efforts to characterize the specific regimes in which MBQC may potentially be more advantageous compared to CBQC. Nevertheless, a more systematic assessment is necessary to assess the suitability of each model across a broader range of more practical cases. In this work, we present a detailed comparative analysis of CBQC and MBQC, beginning with reviewing the theoretical foundations of each model before highlighting its distinguishing features that set the two paradigms apart. Furthermore, building on previous work, we propose a generalized regime analysis that more accurately captures the conditions under which a given quantum algorithm is more favorably executed in MBQC or CBQC. Subsequently, we identify critical parameters that likely determine whether a quantum algorithm is better suited to CBQC or MBQC, categorizing detailed key factors and performance metrics into layers of quantum computation. Next, we propose a decision flow that, given specific hardware constraints and algorithm requirements, guides the selection to the most appropriate model, discussing suitability in two representative worked examples of quantum algorithm applications: Quantum Fourier Transform (QFT) and Variational Quantum Algorithm (VQE). Last, we discuss the potential to combine both models as a hybrid approach to leverage the best of both worlds and explore its benefits for practical quantum computing applications.

Trace signal selection is of great importance for post-silicon debug. Debuggers traditionally use state restoration to improve the observability of the trace data, and state restoration ratio (SRR) is computed after state restoration. In this paper, we exploit the combination of snapshot states and trace states to improve the observability. First, we propose a novel state restoration method, called cluster restoration. It uses both the snapshot states of flip-flop clusters at the beginning of tracing, and the tracing states of the clusters' inputs during the tracing window to deterministically restore all states of these clusters during the tracing window. We also present a cluster restoration-based trace signal selection method to select clusters instead of trace signals directly, which includes two stages: 1) cluster generation and 2) cluster evaluation. For cluster generation, feedback loop-based cluster generation and backward tracing-based cluster generation techniques are proposed. For cluster evaluation, a new metric, called the global state restoration improvement is proposed to evaluate the candidate clusters. The experimental results show that in comparison to prior trace signal selection methods, our method can improve the SRR and reduce the runtime of trace signal selection as well.

Quantum computing is a multidisciplinary field at the intersectionof quantum physics, computer science, and mathematics, aiming to har-ness quantum mechanical phenomena for computational advantage. Thisarticle provides a comprehensive review of both the foundational princi-ples and advanced theoretical models of quantum computing. We beginwith the basic framework of quantum computation, introducing the con-cept of qubits as two-level quantum systems, the linear algebra of Hilbertspaces, Dirac’s bra–ket notation, and the postulates of quantum mechan-ics (state superposition, unitary evolution, and projective measurement).We then discuss quantum logic gates and circuits, highlighting how clas-sical reversible computation principles extend to universal quantum gatesets. Next, we survey key quantum algorithms (from Shor’s factoring toGrover’s searching and beyond) and the complexity-theoretic implicationsof quantum computers, contrasting the class BQP with classical complex-ity classes. We cover the theoretical foundations of quantum error cor-rection and fault tolerance, explaining how quantum information can beprotected from decoherence using redundancy and how fault-tolerant pro-tocols can, in principle, allow scalable quantum computation despite noisyhardware. We then explore advanced models and paradigms of quantumcomputation, including measurement-based quantum computing (one-wayquantum computing), topological quantum computation with anyons, adi-abatic quantum computing and quantum annealing, continuous-variablequantum computing, and related approaches. We also provide an overviewof quantum information theory as it relates to computation, discussingentanglement, quantum entropy, and information-theoretic limits like theHolevo bound. Finally, we review the leading physical implementations(quantum hardware models) of quantum computers—trapped ions, super-conducting circuits, photonic systems, solid-state spin qubits, and oth-ers—outlining the challenges and achievements of each approach.

Blind quantum computation (BQC) enables a client with less quantum computational ability to delegate her quantum computation to a server with strong quantum computational power while preserving the client's privacy. Generally, many-qubit entangled states are often used to complete BQC tasks. But for a large-scale entangled state, it is difficult to be described since its Hilbert space dimension is increasing exponentially. Furthermore, the number of entangled qubits is limited in experiment of existing works. To tackle this problem, in this paper we propose a universal BQC protocol based on measurement with minor resources, where the trap technology is adopted to verify correctness of the server's measurement outcomes during computation and testing process. In our model there are two participants, a client who prepares initial single-qubit states and a server that performs universal quantum computation. The client is almost classical since she does not require any quantum computational power, quantum memory. To realize the client's universal BQC, we construct an $m\times n$ latticed state composed of six-qubit cluster states and eight-qubit cluster states, which needs less qubits than the brickwork state. Finally, we analyze and prove the blindness, correctness, universality and verifiability of our proposed BQC protocol.