Universal Quantum Computation Research Articles

A family of quantum von Neumann architecture

Abstract In this work, we develop universal quantum computing models that form a family of quantum von Neumann architectures, with modular units of memory, control, CPU, and internet, besides input and output. This family contains three generations characterized by dynamical quantum resource theory, and it also circumvents no-go theorems on quantum programming and control. Besides universality, such a family satisfies other desirable engineering requirements on system and algorithm design, such as modularity and programmability, hence serves as a unique approach to build universal quantum computers.

Magic of quantum hypergraph states

Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states, playing a fundamental role in quantum state complexity and universal fault-tolerant quantum computing. However, analytical and numerical characterizations of magic are very challenging, especially for multi-qubit systems, even with a moderate qubit number. Here, we systemically and analytically investigate the magic resource of archetypal multipartite quantum states—quantum hypergraph states, which can be generated by multi-qubit controlled-phase gates encoded by hypergraphs. We first derive the magic formula in terms of the stabilizer Rényi-α entropies for general quantum hypergraph states. If the average degree of the corresponding hypergraph is constant, we show that magic cannot reach the maximal value, i.e., the number of qubits n. Then, we investigate the statistical behaviors of random hypergraph states' magic and prove a concentration result, indicating that random hypergraph states typically reach the maximum magic. This also suggests an efficient way to generate maximal magic states with random diagonal circuits. Finally, we study hypergraph states with permutation symmetry, such as 3-complete hypergraph states, where any three vertices are connected by a hyperedge. Counterintuitively, such states can only possess constant or even exponentially small magic for α≥2. Our study advances the understanding of multipartite quantum magic and could lead to applications in quantum computing and quantum many-body physics.

Sufficient Condition for Universal Quantum Computation Using Bosonic Circuits

Continuous-variable bosonic systems stand as prominent candidates for implementing quantum computational tasks. While various necessary criteria have been established to assess their resourcefulness, sufficient conditions have remained elusive. We address this gap by focusing on promoting circuits that are otherwise simulatable to computational universality. The class of simulatable, albeit non-Gaussian, circuits that we consider is composed of Gottesman-Kitaev-Preskill (GKP) states, Gaussian operations, and homodyne measurements. Based on these circuits, we first introduce a general framework for mapping a continuous-variable state into a qubit state. Subsequently, we cast existing maps into this framework, including the modular and stabilizer subsystem decompositions. By combining these findings with established results for discrete-variable systems, we formulate a sufficient condition for achieving universal quantum computation. Leveraging this, we evaluate the computational resourcefulness of a variety of states, including Gaussian states, finite-squeezing GKP states, and cat states. Furthermore, our framework reveals that both the stabilizer subsystem decomposition and the modular subsystem decomposition (of position-symmetric states) can be constructed in terms of simulatable operations. This establishes a robust resource-theoretical foundation for employing these techniques to evaluate the logical content of a generic continuous-variable state, which can be of independent interest. Published by the American Physical Society 2024

Magic in generalized Rokhsar-Kivelson wavefunctions

Magic is a property of a quantum state that characterizes its deviation from a stabilizer state, serving as a useful resource for achieving universal quantum computation e.g., within schemes that use Clifford operations. In this work, we study magic, as quantified by the stabilizer Renyi entropy, in a class of models known as generalized Rokhsar-Kivelson systems, i.e., Hamiltonians that allow a stochastic matrix form (SMF) decomposition. The ground state wavefunctions of these systems can be written explicitly throughout their phase diagram, and their properties can be related to associated classical statistical mechanics problems, thereby allowing powerful analytical and numerical approaches that are not usually available in conventional quantum many body settings. As a result, we are able to express the SRE in terms of wave function coefficients that can be understood as a free energy difference of related classical problems. We apply this insight to a range of quantum many body SMF Hamiltonians, which affords us to study numerically the SRE of large high-dimensional systems, and in some cases to obtain analytical results. We observe that the behaviour of the SRE is relatively featureless across quantum phase transitions in these systems, although it is indeed singular (in its first or higher order derivative, depending on the nature of the transition). On the contrary, we find that the maximum of the SRE generically occurs at a cusp away from the quantum critical point, where the derivative suddenly changes sign. Furthermore, we compare the SRE and the logarithm of overlaps with specific stabilizer states, asymptotically realised in the ground state phase diagrams of these systems. We find that they display strikingly similar behaviors, which in turn establish rigorous bounds on the min-relative entropy of magic.

Atomic Quantum Technologies for Quantum Matter and Fundamental Physics Applications

Physics is living an era of unprecedented cross-fertilization among the different areas of science. In this perspective review, we discuss the manifold impact that state-of-the-art cold and ultracold-atomic platforms can have in fundamental and applied science through the development of platforms for quantum simulation, computation, metrology and sensing. We illustrate how the engineering of table-top experiments with atom technologies is engendering applications to understand problems in condensed matter and fundamental physics, cosmology and astrophysics, unveil foundational aspects of quantum mechanics, and advance quantum chemistry and the emerging field of quantum biology. In this journey, we take the perspective of two main approaches, i.e., creating quantum analogues and building quantum simulators, highlighting that independently of the ultimate goal of a universal quantum computer to be met, the remarkable transformative effects of these achievements remain unchanged. We wish to convey three main messages. First, this atom-based quantum technology enterprise is signing a new era in the way quantum technologies are used for fundamental science, even beyond the advancement of knowledge, which is characterised by truly cross-disciplinary research, extended interplay between theoretical and experimental thinking, and intersectoral approach. Second, quantum many-body physics is unavoidably taking center stage in frontier’s science. Third, quantum science and technology progress will have capillary impact on society, meaning this effect is not confined to isolated or highly specialized areas of knowledge, but is expected to reach and have a pervasive influence on a broad range of society aspects: while this happens, the adoption of a responsible research and innovation approach to quantum technologies is mandatory, to accompany citizens in building awareness and future scaffolding. Following on all the above reflections, this perspective review is thus aimed at scientists active or interested in interdisciplinary research, providing the reader with an overview of the current status of these wide fields of research where cold and ultracold-atomic platforms play a vital role in their description and simulation.

Hidden variable model for quantum computation with magic states on qudits of any dimension

It was recently shown that a hidden variable model can be constructed for universal quantum computation with magic states on qubits. Here we show that this result can be extended, and a hidden variable model can be defined for quantum computation with magic states on qudits with any Hilbert space dimension. This model leads to a classical simulation algorithm for universal quantum computation.

Half-blind quantum computation with operation teleportation

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.

Two-Particle Scattering on Non-Translation Invariant Line Lattices

Quantum walks have been used to develop quantum algorithms since their inception, and can be seen as an alternative to the usual circuit model; combining single-particle quantum walks on sparse graphs with two-particle scattering on a line lattice is sufficient to perform universal quantum computation. In this work we solve the problem of two-particle scattering on the line lattice for a family of interactions without translation invariance, recovering the Bose-Hubbard interaction as the limiting case. Due to its generality, our systematic approach lays the groundwork to solve the more general problem of multi-particle scattering on general graphs, which in turn can enable design of different or simpler quantum gates and gadgets. As a consequence of this work, we show that a CPHASE gate can be achieved with high fidelity when the interaction acts only on a small portion of the line graph.

Photonic Source of Heralded Greenberger-Horne-Zeilinger States.

Generating large multiphoton entangled states is of main interest due to enabling universal photonic quantum computing and all-optical quantum repeater nodes. These applications exploit measurement-based quantum computation using cluster states. Remarkably, it was shown that photonic cluster states of arbitrary size can be generated by using feasible heralded linear optics fusion gates that act on heralded three-photon Greenberger-Horne-Zeilinger (GHZ) states as the initial resource state. Thus, the capability of generating heralded GHZ states is of great importance for scaling up photonic quantum computing. Here, we experimentally demonstrate this required building block by reporting a polarisation-encoded heralded GHZ state of three photons, for which we build a high-rate six-photon source (547±2 Hz) from a solid-state quantum emitter and a stable polarization-based interferometer. The detection of three ancillary photons heralds the generation of three-photon GHZ states among the remaining particles with fidelities up to F=0.7278±0.0106. Our results initiate a path for scalable entangling operations using heralded linear-optics implementations.

Single-Atom Control of Arsenic Incorporation in Silicon for High-Yield Artificial Lattice Fabrication.

Artificial lattices constructed from individual dopant atoms within a semiconductor crystal hold promise to provide novel materials with tailored electronic, magnetic, and optical properties. These custom-engineered lattices are anticipated to enable new, fundamental discoveries in condensed matter physics and lead to the creation of new semiconductor technologies including analog quantum simulators and universal solid-state quantum computers. This work reports precise and repeatable, substitutional incorporation of single arsenic atoms into a silicon lattice. A combination of scanning tunneling microscopy hydrogen resist lithography and a detailed statistical exploration of the chemistry of arsine on the hydrogen-terminated silicon (001) surface are employed to show that single arsenic dopants can be deterministically placed within four silicon lattice sites and incorporated with 97 ± 2% yield. These findings bring closer to the ultimate frontier in semiconductor technology: the deterministic assembly of atomically precise dopant and qubit arrays at arbitrarily large scales.

Making the unreal real in quantum computing

Review proposes ways to realize spin-based qubits with floating electrons, which could enable universal quantum computation.

Programmable Photonic Time Circuits for Highly Scalable Universal Unitaries.

Programmable photonic circuits (PPCs) have garnered substantial interest for their potential in facilitating deep learning accelerations and universal quantum computations. Although photonic computation using PPCs offers ultrafast operation, energy-efficient matrix calculations, and room-temperature quantum states, its poor scalability hinders integration. This challenge arises from the temporally one-shot operation of propagating light in conventional PPCs, resulting in a light-speed increase in device footprints. Here we propose the concept of programmable photonic time circuits, utilizing time-cycle-based computations analogous to gate cycling in the von Neumann architecture and quantum computation. Our building block is a reconfigurable SU(2) time gate, consisting of two resonators with tunable resonances, and coupled via time-coded dual-channel gauge fields. We demonstrate universal U(N) operations with high fidelity using an assembly of the SU(2) time gates, substantially improving scalability from O(N^{2}) to O(N) in terms of both the footprint and the number of gates. This result paves the way for PPC implementation in very large-scale integration.

Optimal Hadamard Gate Count for Clifford+ T Synthesis of Pauli Rotations Sequences

The Clifford+ T gate set is commonly used to perform universal quantum computation. In such setup the T gate is typically much more expensive to implement in a fault-tolerant way than Clifford gates. To improve the feasibility of fault-tolerant quantum computing it is then crucial to minimize the number of T gates. Many algorithms, yielding effective results, have been designed to address this problem. It has been demonstrated that performing a pre-processing step consisting of reducing the number of Hadamard gates in the circuit can help to exploit the full potential of these algorithms and thereby lead to a substantial T -count reduction. Moreover, minimizing the number of Hadamard gates also restrains the number of additional qubits and operations resulting from the gadgetization of Hadamard gates, a procedure used by some compilers to further reduce the number of T gates. In this work we tackle the Hadamard gate reduction problem, and propose an algorithm for synthesizing a sequence of π /4 Pauli rotations with a minimal number of Hadamard gates. Based on this result, we present an algorithm which optimally minimizes the number of Hadamard gates lying between the first and the last T gate of the circuit.

Mechanism of Universal Quantum Computation in the Brain

Mechanism of Universal Quantum Computation in the Brain

Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity

Operator controllability refers to the ability to implement an arbitrary unitary in SU(N) and is a prerequisite for universal quantum computing. Controllability tests can be used in the design of quantum devices to reduce the number of external controls. Their practical use is hampered, however, by the exponential scaling of their numerical effort with the number of qubits. Here, we devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit. We show that controllability is linked to the number of independent parameters, which can be obtained by dimensional expressivity analysis. We exemplify the application of the algorithm to qubit arrays with nearest-neighbour couplings and local controls. Our work provides a systematic approach to the resource-efficient design of quantum chips.

UNDAMENTALS OF INFORMATION AND COMPUTATION IN THE REALM OF THE QUANTA

Information is a physical. Physical systems register and process information. These facts generated enormus interest in the development of novel quantum tecnologies, especially because the construction of smaller electronic devices ultimately leads to a consideration of quantum mechanical effects in electronic and computer desingns. The notion of the classical bit of information theory was formally pushed into the realm of the quanta with the introduction of the quantum bit or qubit, in the seminal works of Deutsch (Deutsch, 1985) and Shor (Shor, 1994). They demostrated that, indeed, controlled multipartite qubit interference effects could provide the means for a radical new way of computing, allowing the computation of many intractable computational problems, such as the factoring of large number or exact simulation of large quantum systems. The field of experimental and theoretical research in quantum information and computation has emerged as very important player in the understanding of quantum phenomena the both the basic and technological levels. This has attracted the attention of numerous researchers with backgrounds ranging from computer science, mathematics and engineerin, to the physical sciences, and we now have an interdisciplinary field where great efforts are being made in order to build devices that allow the progressing of information at a quantum level.
 A concise introduction to the field of quantum information and quantum computation is presented. This stars with the bassic definitions of bits, quantum registers, through to the universal gate-set for building the universal quantum computer, from a quantum network model of computation. The work shows how two-qubit gates suffice for quantum computation, emphasing the power of the quantum circuit representation for entagling and disentagling quantum states. This leads to the “no-cloning theorem”, which leads us to many interesting applications, such as quantum cryptography. Two alternative approaches or performing quantum computation are also described i) the one-way or measurement based quantum computer method, and ii) holonomic or geometric quantum computation. Following this, quantum entaglement quantification is highlighted, particulary its usefulness as a communication resource, in order to describe some of its most celebrated practical applications to date: quantum teleportation, cryptography, dens coding, and data compression. Deutsch’s concept of quantum parallelism is enphasized in order to gain insight into the potential for efficiently solving certain classically intratable algorithms. A subject central to the field of QIP- quantum decoherence- is then introduced.. Possible ways to overcome it, in particular quantum error correction, are discussed. A descriptios of some of the currently available hardware of the practical implementation of quantum computation is provided with a discussion of the main physical quantum bits that are currently employed (or proposed) for a such a purpose.

The two-qubit singlet/triplet measurement is universal for quantum computing given only maximally-mixed initial states.

In order to delineate which minimalistic physical primitives can enable the full power of universal quantum computing, it has been fruitful to consider various measurement based architectures which reduce or eliminate the use of coherent unitary evolution, and also involve operations that are physically natural. In this context previous works had shown that the triplet-singlet measurement of two qubit angular momentum (or equivalently two qubit exchange symmetry) yields the power of quantum computation given access to a few additional different single qubit states or gates. However, Freedman, Hastings and Shokrian-Zini1 recently proposed a remarkable conjecture, called the 'STP=BQP' conjecture, which states that the two-qubit singlet/triplet measurement is quantum computationally universal given only an initial ensemble of maximally mixed single qubits. In this work we prove this conjecture. This provides a method for quantum computing that is fully rotationally symmetric (i.e. reference frame independent), using primitives that are physically very-accessible, naturally resilient to certain forms of error, and provably the simplest possible.

Energy efficiency optimisation in massive multiple‐input, multiple‐output network for 5G applications using new quantum genetic algorithm

AbstractDevising efficient optimisation methods has been a subject of great research attention since current evolving trends in communication networks, machine learning, and other cutting‐edge systems that need a fast and accurate optimised computational model. Classical computers became incapable of handling new optimisation problems posed by newly emerging trends. Quantum optimisation algorithms appear as alternative solutions. The existing bottleneck that restricts the use of the newly developed quantum strategies is the limited qubit size of the available quantum computers (the size of the most recent universal quantum computer is 433 qubits). A new quantum genetic algorithm (QGA) is proposed that handles the presented problem. A quantum extreme value searching algorithm and quantum blind computing framework are utilised to extend the search capabilities of the GA. The quantum genetic strategy is exploited to maximise energy efficiency at full spectral efficiency of massive multiple‐input, multiple‐output (M‐MIMO) technology as a toy example for pointing out the efficiency of the presented quantum strategy. The authors run extensive simulations and prove how the presented quantum method outperforms the existing classical genetic algorithm.

Reconfigurable Hexapartite Cluster States by Four‐Wave Mixing Processes with a Spatially Structured Pump

AbstractThe universal quantum computation provides a new paradigm for information processing. One feasible approach is measurement‐based one‐way quantum computation utilizing cluster states. Generally, the generation of cluster states with different structures for implementing on‐demand quantum computation needs different experimental setup, which limits its scalability. Here, the reconfigurable hexapartite cluster states created by postprocessing the quadrature information of hexapartite entangled state are demonstrated. Without altering the experimental layout, nine quantum correlated states with different structures, especially three cluster states, are implemented. In particular, such method can effectively reduce the excess noise introduced by creating cluster states under limited squeezing resources. This approach provides an avenue for realizing large‐scale reconfigurable cluster states without changing the experimental architecture.

The Imminent Creation of Sentient Androids?

Onset of the imminent paradigm shift to the 3rd regime of Natural Science (Classical, Quantum, Unified Field) will sustain an explosion in technological innovation. Chief among these innovations will be the appearance of room temperature table-top Bulk Universal Quantum Computing (UQC) – a fundamental key element in producing Sentient Androids (SA). Controversy will occur around the meaning of Android, the nature of Sentience, what it means to pass the Turing Test, and if passing the Turing Test is a satisfactory demonstration of Sentience indistinguishable from a human. It is proposed that two classes of SA will be developed: 1) the Cognitive Science model of AI where passing the Turing Test will be deemed sufficient and 2) a Cartesian Dualism model requiring a life principle for sentience – where the brain is a form of naturally occurring conscious quantum computer.