Ancilla-driven quantum computation for qudits and continuous variables

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.

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.

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.

Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal measurement-based quantum computing and its verification. In this paper, we construct a universal hypergraph state that only requires X and Z-basis measurements for universal measurement-based quantum computing. We also show that universal measurement-based quantum computing on our hypergraph state can be verified in polynomial time using only X and Z-basis measurements. Furthermore, in order to demonstrate an advantage of our hypergraph state, we construct a verifiable blind quantum computing protocol that requires only X and Z-basis measurements for the client.

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.

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.

We consider the issue of what should count as a resource for measurement-based quantum computation (MBQC). While a state that supports universal quantum computation clearly should be considered a resource, universality should not be necessary given the existence of interesting, but less computationally-powerful, classes of MBQCs. Here, we propose minimal criteria for a state to be considered a resource state for MBQC. Using these criteria, we explain why discord-free states cannot be resources for MBQC, contrary to recent claims [Hoban et al., arXiv:1304.2667v1]. Independently of our criteria, we also show that the arguments of Hoban et al., if correct, would imply that Shor's algorithm (for example) can be implemented by measuring discord-free states.

We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically processed in a nested loop by an electrically programmable gate sequence. This architecture can process any input state and an arbitrary number of modes with almost minimum resources, and offers a universal gate set for both qubits and continuous variables. Furthermore, quantum computing can be performed fault tolerantly by a known scheme for encoding a qubit in an infinite-dimensional Hilbert space of a single light mode.

Entanglement is essential for quantum information processing, but is limited by noise. We address this by developing high-yield entanglement distillation protocols with several advancements. (1) We extend the 2-to-1 recurrence entanglement distillation protocol to higher-rate n-to-(n−1) protocols that can correct any single-qubit errors. These protocols are evaluated through numerical simulations focusing on fidelity and yield. We also outline a method to adapt any classical error-correcting code for entanglement distillation, where the code can correct both bit-flip and phase-flip errors by incorporating Hadamard gates. (2) We propose a constant-depth decoder for stabilizer codes that transforms logical states into physical ones using single-qubit measurements. This decoder is applied to entanglement distillation protocols, reducing circuit depth and enabling protocols derived from high-performance quantum error-correcting codes. We demonstrate this by evaluating the circuit complexity for entanglement distillation protocols based on surface codes and quantum convolutional codes. (3) Our stabilizer entanglement distillation techniques advance quantum computing. We propose a fault-tolerant protocol for constant-depth encoding and decoding of arbitrary states in surface codes, with potential extensions to more general quantum low-density parity-check codes. This protocol is feasible with state-of-the-art reconfigurable atom arrays and surpasses the limits of conventional logarithmic depth encoders. Overall, our study integrates stabilizer formalism, measurement-based quantum computing, and entanglement distillation, advancing both quantum communication and computing.

One reason why building large-scale quantum computers will be particularly challenging is that quantum computers are far more susceptible to making errors than conventional digital computers. I will explain the principles of quantum error correction and fault-tolerant quantum computation, which can enable a properly designed quantum computer with imperfect components to achieve good reliability. Some recent developments in the theory of quantum fault tolerance will be reviewed, including quantum error-correcting codes for systems described by continuous quantum variables, robust storage of quantum information based on topological principles, and applications of quantum error-correcting codes to quantum cryptography.

Measurement-Based Quantum Computing (MBQC) is an alternative to the quantum circuit model, whereby the computation proceeds via measurements on an entangled resource state. Noise processes are a major experimental challenge to the construction of a quantum computer. Here, we investigate how noise processes affecting physical states affect the performed computation by considering MBQC on a one-dimensional cluster state. This allows us to break down the computation in a sequence of building blocks and map physical errors to logical errors. Next, we extend the Matrix Product State construction to mixed states (which is known as Matrix Product Operators) and once again map the effect of physical noise to logical noise acting within the correlation space. This approach allows us to consider more general errors than the conventional Pauli errors, and could be used in order to simulate noisy quantum computation.

It has been proven that universal quantum computers based on qubits and classical analog networks both have superTuring capabilities. It is a grand challenge to computer science to prove that the combination of the two, in analog (continuous variable) quantum computing, offers supersuperTuring capability, the best we can achieve. Computing with continuous spins is now the most promising path AQC. Two papers at SPIE2014 described unbreakable quantum codes using continuous spins beyond what traditional qubits allow. To make this real, we must first develop a realistic ability to model and predict the behavior of networks of spin gates which act in part as polarizers. Last year I proposed a triphoton experiment, where three entangled photons go to linear polarizers set to angles θ_a, θ_b and θ_c. Assuming a “collapse of the wave function” yields predictions for the coincidence detection rate, R₃/R₀(θ_a, θ_b, θ_c) significantly different from the prediction of a new family of models based on classical Markov Random Fields (MRF) across space time, even though both yield the same correct prediction in the two-photon case. We cannot expect to predict systems of 100 entangled photons correctly if we cannot even predict three yet. Yanhua Shih is currently performing this experiment, as a first step to demonstrating a new technology to produce 100 entangled photons (collaborating with Scully) and understanding larger systems. I have also developed continuous-time versions of the MRF models and of “collapse of the wave function”, so as to eliminate the need to assume metaphysical observers in general.

Measurement-based quantum computation has emerged from the physics community as a new approach to quantum computation where measurements rather than unitary transformations are the main driving force of computation. Among measurement-based quantum computation methods the recently introduced one-way quantum computer [RB01] stands out as basic and fundamental In this work we a concrete syntax and an algebra of these patterns derived from a formal semantics. We developed a rewrite theory and proved a general standardization theorem which allows all patterns to be put in a semantically equivalent standard form

We study the effects of amplitude and phase damping decoherence in d-dimensional one-way quantum computation (QC). Our investigation shows how information transfer and entangling gate simulations are affected for d>=2. To understand motivations for extending the one-way model to higher dimensions, we describe how d-dimensional qudit cluster states deteriorate under environmental noise. In order to protect quantum information from the environment we consider the encoding of logical qubits into physical qudits and compare entangled pairs of linear qubit-cluster states with single qudit clusters of equal length and total dimension. Our study shows a significant reduction in the performance of one-way QC for d>2 in the presence of Markovian type decoherence models.

We experimentally demonstrate a controlled-phase gate for continuous variables using a cluster-state resource of four optical modes. The two independent input states of the gate are coupled with the cluster in a teleportation-based fashion. As a result, one of the entanglement links present in the initial cluster state appears in the two unmeasured output modes as the corresponding entangling gate acting on the input states. The genuine quantum character of this gate becomes manifest and is verified through the presence of entanglement at the output for a product two-mode coherent input state. By combining our gate with the recently reported module for single-mode Gaussian operations [R. Ukai et al., Phys. Rev. Lett. 106, 240504 (2011)], it is possible to implement any multimode Gaussian operation as a fully measurement-based one-way quantum computation.