Universal Quantum Computing with Measurement-Induced Continuous-Variable Gate Sequence in a Loop-Based Architecture.

Quantum information and quantum computing offer a new range of possibilities in terms ofnew computing algorithms, the ability to perform new types of operations and make statementsabout information in terms of what it is physically possible to know about a system.Experiments in quantum information and quantum computing have been advancing significantly,especially over the last decade. In optical quantum computing there are two maintypes of experiments that are performed today. They are experiments involving single photonswith information encoded on the polarisation of the photon and experiments involvingstates with Gaussian noise profiles in their quadratures. There appears to be no way toperform the required operations for universal quantum computing using operations whichtake Gaussian states to Gaussian states. Universal quantum computing using single photonsis possible but uses either enormously large non-linearities or a large number of resources.Also, operations which take Gaussian states to non-Gaussian states are not well understoodin general and can often be very difficult to implement.This thesis presents three sources of optical non-Gaussian states which demonstrate someof the interesting properties of these states. First, a scheme for universal quantum computingusing superpositions of coherent states is presented. Error correction and the fault toleranceproperties of this scheme is also explored and compared with current single photon architectures.These gates require superpositions of coherent states as resources and a relativelysimple scheme is shown for how these states may be generated. Next a scheme for distillingnear ideal Gaussian entanglement using non-Gaussian operations is presented. The loss andnoise conditions under which ideal distillation can be achieved are presented. Finally, a verysimple way of generating mixed non-Gaussian states from two Gaussian states is presented.These states are shown to give rise to counter-intuitive results when measuring their entanglementand when analysing their operational ability in terms of teleportation and quantumkey distribution.

Quantum teleportation is one of the most basic quantum protocols, which transfers an unknown quantum state from one location to another through local operation and classical communication by using shared quantum entanglement without physical transfer of the information carrier. And it has been widely used in various quantum information protocols such as entanglement swapping, quantum repeaters, quantum gate teleportation, quantum computation based on measurement, and quantum teleportation networks, which have important application value in quantum computation and quantum information. Quantum teleportation is a naturally bipartite process, in which an unknown quantum state can only be transmitted from one node to another. With the further development of quantum information research, it is necessary to transfer quantum states or quantum information among more and more nodes. Multipartite quantum protocols are expected to form fundamental components for larger-scale quantum communication and computation. A bipartite quantum teleportation should be extended to a multipartite protocol known as a quantum teleportation network. In this paper, a multifunctional quantum teleportation network is proposed theoretically. We first propose a special method of constructing four-partite quantum resources in continuous variables (CVs), and based on this, construct two different types of CV quantum teleportation networks. One type of network contains just one quantum teleportation process consisting of a sender, a receiver and two controllers. In this type of network, the unknown quantum state can be recovered at any other node according to the requirement after the measurement in the input node, which enriches the transfer direction and transfer mode of the unknown quantum state. And meanwhile, the two controllers can control the transfer of a quantum state from the sender to the receiver by restricting the sender and receiver’s access to their information, which makes the quantum teleportation network controllable. The other type of network has two quantum teleportation processes, each containing only a sender, a receiver and no controllers, which increases the number of quantum states that can be transmitted. Then we analyze the dependence of the fidelity of each quantum teleportation network on different physical parameters, and compare the characteristics, advantages and disadvantages among different types of quantum teleportation networks. The scheme for constructing a multifunctional quantum teleportation network in this paper shows some advantages, such as the greater number of quantum nodes, diversity of types, simple operation procedure. And all these advantages provide a broader application prospect for establishing larger and more complex quantum information networks in the future and quicken the pace of the application of quantum information.

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.

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.

A new class of microelectromechanically tunable vertical-cavity surface-emitting lasers with a half-symmetric cavity structure is described. The cavity is realized by inducing a curvature (R/spl sim/320 μm) in the top movable dielectric mirror. The microcavity forces lasing oscillations in a single fundamental spatial mode of approximately 6 μm despite the 20 μm electrical aperture of the device. The device wavelength was tunable from 863 to 833 nm under a 13-V voltage swing. The device operates in a single fundamental mode with sidemode supression ratio of >20 dB throughout the tuning range.

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.

The interference of nonclassical states of light enables quantum-enhanced applications reaching from metrology to computation. Most commonly, the polarization or spatial location of single photons are used as addressable degrees of freedom for turning these applications into praxis. However, the scale-up for the processing of a large number of photons of these architectures is very resource-demanding due to the rapidly increasing number of components, such as optical elements, photon sources, and detectors. Here, we demonstrate a resource-efficient architecture for multiphoton processing based on time-bin encoding in a single spatial mode. We use an efficient quantum dot single-photon source and a fast programmable time-bin interferometer to observe the interference of up to eight photons in 16 modes, all recorded only with one detector, thus considerably reducing the physical overhead previously needed for achieving equivalent tasks. Our results can form the basis for a future universal photonics quantum processor operating in a single spatial mode.

Hybrid Architectures for Topological Quantum Computation: Platform Integration, Device Engineering, and Scalability

Quantum information theory has provided the formal framework for describing how information is stored, transmitted, and transformed in physical quantum systems [Renes, 2022; Tomamichel, 2015; Wilde, 2013]. Its entropic formulations underpin our understanding of quantum computation, communication, and cryptography. Yet this theory traditionally treats all quantum operations as freely available, ignoring computational restrictions. In practice, however, any manipulation of quantum information must be performed by devices of bounded complexity and runtime. Capturing such realistic constraints requires extending quantum information theory to include computational efficiency as a fundamental component. This work takes a first step toward building a computational version of quantum information theory, one that treats efficiency as part of the theory itself. The goal is to understand how the behavior of quantum information changes when the parties involved can only perform computationally efficient operations. This approach bridges the abstract, ideal setting of quantum information theory with the practical limitations of real quantum devices, offering a means to study information processing under realistic resource constraints. At the center of this work are two new quantities: the quantum computational min-entropy and the quantum computational max-entropy. These entropies extend standard quantum entropies by explicitly limiting the computational power of the observer or adversary. The quantum computational min-entropy captures how unpredictable a quantum system A remains to an observer holding system B, when that observer is restricted to quantum circuits of bounded size. Formally, for a bipartite state ρ_{AB}, we define {H^c}^s_{min}(A|B)_{ρ} ≔ -log d_A max_{ℰ^s_{B→A'}} F((𝕀_A ⊗ ℰ^s)(ρ_{AB}),|Φ_{AA'}⟩⟨Φ_{AA'}|) , where the maximization is over quantum channels that can be implemented by circuits of size at most s, and F denotes fidelity with a maximally entangled state. In the classical setting, the min-entropy can be expressed through the maximal probability of correctly guessing a random variable given some side-information. In the fully quantum setting, this idea extends to uncertainty about quantum information [König et al., 2009], quantifying how well one system can be inferred from another using local quantum operations. Our definition generalizes this operational viewpoint by restricting the computational power of the observer to efficient quantum circuits. This definition extends the operational meaning of the information-theoretic quantum min-entropy [König et al., 2009] by incorporating computational constraints, and it provides the fully quantum counterpart of the classical unpredictability entropy [Hsiao et al., 2007]. We establish fundamental properties for the computational min-entropy, including monotonicity in the circuit size and smoothing parameters, efficient data-processing inequalities, and fully quantum leakage and purification chain rules, which were left as open questions in earlier definitions of quantum computational entropies [Yi-Hsiu Chen et al., 2017; Munson et al., 2025]. For classical–quantum states, it coincides with the previously defined quantum computational unpredictability entropy [Noam Avidan and Rotem Arnon, 2025], showing that the new definition correctly generalizes known results. We also introduce the quantum computational max-entropy through a duality relation [Tomamichel et al., 2010] with the min-entropy using a fixed purification. Finally, we prove unconditional separations between the computational and information-theoretic entropies, demonstrating that computational restrictions can fundamentally alter entropic behavior even for simple states. These results establish the fundamental mathematical framework for studying quantum information within realistic computational constraints. By integrating efficiency directly into entropic quantities, they open the door to a fully developed computational quantum information theory that parallels its information-theoretic counterpart. Such a framework provides the foundation for analyzing cryptographic security against computationally bounded quantum adversaries [Noam Avidan and Rotem Arnon, 2025] and the limits of efficient quantum state manipulation. More broadly, it suggests that many core notions in quantum information theory may have refined computational analogues yet to be explored.

Blind quantum computation enables a client with limited quantum capabilities to delegate a powerful quantum computer for performing confidential quantum computation. This paper identifies a security loophole in the initial universal half-blind quantum computation protocol and resolves it using operation teleportation. Simultaneously, to minimize quantum resource consumption for both the client and the server, the proposed protocol relies on the universal gate set H, T, and CX, and only necessitates the client’s ability to prepare qubits in the eigenstates of Pauli gates X and Y or measure qubits based on these gates. Finally, a sample example is provided to illustrate the proposed protocol effectively.

By the birth of Quantum Physics, many new areas were opened for research and development in the world of science and technology. One such field is Quantum Computing and Communication where there is room for all that was once a dream in the field of computing and communication. Ultra high speed, immunity to eavesdropping, security, and name it and it may be possible. This paper gives a brief review of what is happening in the field of quantum computing and communication. We try to give an idea on polarization, quantum entanglement and their use in quantum communication and also briefly explain quantum communication networks, teleportation over optic fiber cables, quantum cryptography, quantum based satellite communication and quantum memory.

Quantum computers, although not yet available on the market, will revolutionise the future of information processing. Already now, quantum computers of special purpose, i.e., quantum simulators, are within reach. The physics of ultracold atoms, ions, and molecules offers unprecedented possibilities of control of quantum many systems, and novel possibilities of applications for quantum information and quantum metrology. Particularly fascinating is the possibility of using ultracold atoms in lattices to simulate condensed matter or even high energy physics. This book provides a comprehensive overview of ultracold lattice gases as quantum simulators, an interdisciplinary field involving atomic, molecular, and optical physics; quantum optics; quantum information; and condensed matter and high energy physics. It includes some introductory chapters on basic concepts and methods, and focuses on the physics of spinor, dipolar, disordered, and frustrated lattice gases, before reviewing in detail artificial lattice gauge fields with ultracold gases. The last part of the book moves onto a discussion of possible implementations universal quantum computers with ultracold atoms. After a crash course in quantum information theory, several models of quantum computation with ultracold gases are presented, as well as the current understanding of condensed matter from a quantum information perspective. The book ends with the general discussion of various detection methods that are unique for ultracold atoms.

Certain physical systems that one might consider for fault-tolerant quantum computing where qubits do not readily interact, for instance photons, are better suited for measurement-based quantum-computational protocols. Here we propose a measurement-based model for universal quantum computation that simulates the braiding and fusion of Majorana modes. To derive our model we develop a general framework that maps any scheme of fault-tolerant quantum computation with stabilizer codes into the measurement-based picture. As such, our framework gives an explicit way of producing fault-tolerant models of universal quantum computation with linear optics using protocols developed using the stabilizer formalism. Given the remarkable fault-tolerant properties that Majorana modes promise, the main example we present offers a robust and resource efficient proposal for photonic quantum computation.

The rapid development of quantum computers has enabled demonstrations of quantum advantages on various tasks. However, real quantum systems are always dissipative due to their inevitable interaction with the environment, and the resulting non-unitary dynamics make quantum simulation challenging with only unitary quantum gates. In this work, we present an innovative and scalable method to simulate open quantum systems using quantum computers. We define an adjoint density matrix as a counterpart of the true density matrix, which reduces to a mixed-unitary quantum channel and thus can be effectively sampled using quantum computers. This method has several benefits, including no need for auxiliary qubits and noteworthy scalability. Moreover, some long-time properties like steady states and the thermal equilibrium can also be investigated as the adjoint density matrix and the true dissipated one converge to the same state. Finally, we present deployments of this theory in the dissipative quantum XY model for the evolution of correlation and entropy with short-time dynamics and the disordered Heisenberg model for many-body localization with long-time dynamics. This work promotes the study of real-world many-body dynamics with quantum computers, highlighting the potential to demonstrate practical quantum advantages.

The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits). Our method uses a transpilation of a circuit in the standard qubit form, which depends on the characteristics of a qudit-based processor, such as the number of available qudits and the number of accessible levels. This approach provides a qubit-to-qudit mapping and comparison to a standard realization of quantum algorithms highlighting potential advantages of qudits. We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set. We then illustrate our method by considering an example of an efficient implementation of a 6-qubit quantum algorithm with qudits. In this particular example, we demonstrate how using qudits allows a decreasing amount of two-body interactions in the qubit circuit implementation. We expect that our findings are of relevance for ongoing experiments with noisy intermediate-scale quantum devices that operate with information carriers allowing qudit encodings, such as trapped ions and neutral atoms, as well as optical and solid-state systems.