Topological Quantum Computing: Principles, Advances, and Implications in Acta Universi

Developing quantum systems which are robust against noise are of prime importance to the realisation of quantum technologies. Without fault tolerance, we will never be able to preserve delicate quantum states for macroscopic time scales, a necessary requirement in the construction of scalable quantum computer. Topologically ordered models offer very beautiful mechanisms for preserving quantum states. In such models, quantum information is encoded globally over a degenerate topological Hilbert space which offers a natural robustness against local environmental noise. Remarkably, topological order is present in certain realistic condensed-matter systems. This provides a platform for accessing topological order in a laboratory. Moreover, considering condensed-matter systems enables us to combine topological features with other physical effects to enhance their behaviour. In this Thesis we study the physics of topologically ordered lattice models with defects. We seek practical applications of lattice defects for the realisation of a fault-tolerant quantum computer. The first result we present shows that anyonic data of point-like lattice defects, called twists, can be found by measuring the entanglement of the ground state of the host system. The data we learn relates to the capacity of a twist defect to perform quantum computational tasks. The second result in this Thesis concerns the dynamics of the qudit toric code model with line-like defects coupled to a thermal bath. We show we can entropically inspire fragile glassy dynamics in the system. Such dynamics qualitatively improve the coherence times of quantum information encoded in the ground state of the lattice. A novel way of achieving fault-tolerant quantum computation is by producing and manipulating twist defects of topologically ordered systems. In many ways, this paradigm of topological quantum computation is analogous to quantum computation using anyons. The first area of study in this Thesis extends the analogy between anyons and twists. Specifically, we show that the anyonic data of twists in Kitaev’s toric code model can be extracted

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.

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

The proposal of fault-tolerant quantum computations, which promise to dramatically improve the operation of quantum computers and to accelerate the development of the compact hardware for them, is based on topological quantum field theories, which rely on the existence in Nature of physical systems described by a Lagrangian containing a non-Abelian (NA) topological term. These are solid-state systems having two-dimensional electrons, which are coupled to magnetic-flux-quanta vortexes, forming complex particles, known as anyons. Topological quantum computing (TQC) operations thus represent a physical realization of the mathematical operations involving NA representations of a braid group Bn, generated by a set of n localized anyons, which can be braided and fused using a “tweezer” and controlled by a detector. For most of the potential TQC material systems known so far, which are 2D-electron–gas semiconductor structure at high magnetic field and a variety of hybrid superconductor/topological-material heterostructures, the realization of anyon localization versus tweezing and detecting meets serious obstacles, chief among which are the necessity of using current control, i.e., mobile particles, of the TQC operations and high density electron puddles (containing thousands of electrons) to generate a single vortex. Here we demonstrate a novel system, in which these obstacles can be overcome, and in which vortexes are generated by a single electron. This is a ~ 150 nm size many electron InP/GaInP2 self-organized quantum dot, in which molecules, consisting of a few localized anyons, are naturally formed and exist at zero external magnetic field. We used high-spatial-resolution scanning magneto-photoluminescence spectroscopy measurements of a set of the dots having five and six electrons, together with many-body quantum mechanical calculations to demonstrate spontaneous formation of the anyon magneto-electron particles (eν) having fractional charge ν = n/k, where n = 1–4 and k = 3–15 are the number of electrons and vortexes, respectively, arranged in molecular structures having a built-in (internal) magnetic field of 6–12 T. Using direct imaging of the molecular configurations we observed fusion and braiding of eν-anyons under photo-excitation and revealed the possibility of using charge sensing for their control. Our investigations show that InP/GaInP2 anyon-molecule QDs, which have intrinsic transformations of localized eν-anyons compatible with TQC operations and capable of being probed by charge sensing, are very promising for the realization of TQC.

Topological quantum computation provides an elegant way around decoherence, as one encodes quantum information in a non-local fashion that the environment finds difficult to corrupt. Here we establish that one of the key operations---braiding of non-Abelian anyons---can be implemented in one-dimensional semiconductor wire networks. Previous work [Lutchyn et al., arXiv:1002.4033 and Oreg et al., arXiv:1003.1145] provided a recipe for driving semiconducting wires into a topological phase supporting long-sought particles known as Majorana fermions that can store topologically protected quantum information. Majorana fermions in this setting can be transported, created, and fused by applying locally tunable gates to the wire. More importantly, we show that networks of such wires allow braiding of Majorana fermions and that they exhibit non-Abelian statistics like vortices in a p+ip superconductor. We propose experimental setups that enable the Majorana fusion rules to be probed, along with networks that allow for efficient exchange of arbitrary numbers of Majorana fermions. This work paves a new path forward in topological quantum computation that benefits from physical transparency and experimental realism.

Quantum computation requires controlled engineering of quantum states to perform tasks that go beyond those possible with classical computers. Topological quantum computation aims to achieve this goal by using non-Abelian quantum phases of matter. Such phases allow for quantum information to be stored and manipulated in a nonlocal manner, which protects it from imperfections in the implemented protocols and from interactions with the environment. Recently, substantial progress in this field has been made on both theoretical and experimental fronts. We review the basic concepts of non-Abelian phases and their topologically protected use in quantum information processing tasks. We discuss different possible realizations of these concepts in experimentally available solid-state systems, including systems hosting Majorana fermions, their recently proposed fractional counterparts, and non-Abelian quantum Hall states.

One of the current trends in quantum computing is the application of algebraic topological methods in the design of new algorithms and quantum computers, giving rise to topological quantum computing. One of the tools used in it is the Yang-Baxter equation whose solutions are interpreted as universal quantum gates. Lately, more general Yang-Baxter equations have been investigated, making progress as two-spectral equations and Yang-Baxter systems. This paper intends to apply these new findings to the field of topological quantum computation, more specifically, the proposition of the two-spectral Yang-Baxter operators as universal quantum gates for 2 qubits and 2 qutrits systems, obtaining 4x4 and 9x9 matrices respectively, and further elaboration of the corresponding Hamiltonian by the use of computer algebra software Mathematica® and its Qucalc package. In addition, possible physical systems to which the Yang-Baxter operators obtained can be applied are considered. In the present work it is demonstrated the utility of the Yang-Baxter equation to generate universal quantum gates and the power of computer algebra to design them; it is expected that these mathematical studies contribute to the further development of quantum computers

The present paper aims to introduce a new algebra based on the knots and their ability to change dramatically the physical state, when we act on them with the braiding operator. The frame of all this ideas is the topological quantum computing. Nowadays, the quest for a reliable quantum computer technology refers, among others quantum phenomena, to the Quantum Hall Effect. Setting suitable quantum experiments (for instance a super lattice - two dimensional electron system that appears in the hetero structures of two semiconductors) involving exceptionally strong magnetic fields and very low temperatures, the QHE puts into evidence new quasi particles, evolving in 2+1 dimensions space. Such a topological quantum computer will successfully fight against the undesirable interaction between the quantum system and the environment (de-coherence). The knotted quantum world-lines of quasi-particles (anyons) provide the quantum computing physical support. The necessary algebra (which will deal with) is the algebra of the creation and annihilation of the knot's braids when the corresponding braiding operators act.

: Spin has long been known to have the potential to perform universal quantum computation. To realize quantum computation with spins one needs an extraordinary amount of control over the spins so we can set, manipulate, and read out the various processes required in information processing. This is a daunting task as these processes are not immune from decoherence. While one can manipulate single spins with high-fidelity and long coherence times, there is no clear path to move from single spin manipulation to many spins. Recent advances have revealed a new type of information processing, topological quantum computation, which is immune from environment related decoherence. Topological information processing relies on the manipulation of anyons, particles which obey non-Abelian statistics. The simplest of these particles, Majorana fermions, are believed to exist as excitations in exotic materials under extreme conditions. Additionally, Majorana fermions have been proposed to exist in a new class of materials commonly referred to as topological insulators coupled with superconducting contacts under much less extreme conditions. In this work, we propose to theoretically investigate the formation, manipulation, entanglement and detection of Majorana fermions in diamond-topological insulator-superconductor heterojunctions. Furthermore, we propose to further investigate the relationship between superconducting elements and 2D and 3D topological insulators. The tasks we outline in this proposal will be undertaken using a variety of analytical tools to provide insight into the system behavior at the theoretical limits and numerical techniques to yield results in experimentally realistic conditions. The goal is to make significant and measurable advances towards transformative information processing technologies that have the potential to vastly increase operational capabilities of multiple Air Force applications.

Recent experimental progress introduced devices that can combine topological superconductivity with Coulomb-blockade effects. Experiments with these devices have already provided additional evidence for Majorana zero modes in proximity-coupled semiconductor wires. They also stimulated numerous ideas for how to exploit interactions between Majorana zero modes generated by Coulomb charging effects in networks of Majorana wires. Coulomb effects promise to become a powerful tool in the quest for a topological quantum computer as well as for driving topological superconductors into topologically ordered insulating states. Here, we present a focused review of these recent developments, including discussions of recent experiments, designs of topological qubits, Majorana-based implementations of universal quantum computation, and topological quantum error correction. Motivated by the analogy between a qubit and a spin-1/2 degree of freedom, we also review how coupling between Cooper-pair boxes leads to emergent topologically ordered insulating phases.

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.

As the version of Majorana fermions in condensed matter physics, the research of Majorana zero modes is one of the most interesting topics in physics currently. Majorana zero modes obey the non-Abelian statistics and can be used for constructing the topologically protected qubits. This kind of qubit constructed from spatially separated Majorana zero modes is immune to local noise, and has a long decoherence time, which makes it show important application prospects in fault-tolerant quantum computation. The semiconductor/superconductor nanowires are one of the most ideal experimental platforms for studying Majorana zero modes and topological quantum computation. This work reviews the research progress of the epitaxial growth of high-quality semiconductor nanowires, the fabrication of semiconductor/superconductor heterostructure nanowires, and Majorana zero modes in semiconductor/superconductor nanowires. The application prospects of semiconductor/ superconductor nanowires in quantum computation is also prospected finally.

1D topological systems for next-generation electronics

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.

Chern-Simons topological quantum computer is a device that can be effectively described by the Chern-Simons topological quantum field theory and used for quantum computations. Quantum qudit gates of this quantum computer are represented by sequences of quantum R-matrices. Its dimension and explicit form depend on the parameters of the Chern-Simons theory — level k, gauge group SU(N), and representation, which is chosen to be symmetric representation [r]. In this paper, we examine the universality of such a quantum computer. We prove that for sufficiently large k it is universal, and the minimum allowed value of k depends on the remaining parameters r and N.