Impact of Classical Control Electronics on Qubit Fidelity

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

Two-qubit gates are important components of quantum computing. However, unwanted interactions between qubits (so-called parasitic gates) can be particularly problematic and degrade the performance of quantum applications. In this work, we present two software methods to mitigate parasitic two-qubit gate errors. The first approach is built upon the Cartan’s KAK decomposition and keeps the original unitary decomposition for the error-free native two-qubit gate. It counteracts a parasitic two-qubit gate by only applying single-qubit rotations and therefore has no two-qubit gate overhead. We show the optimal choice of single-qubit mitigation gates. The second approach applies a numerical optimisation algorithm to re-compile a target unitary into the error-parasitic two-qubit gate plus single-qubit gates. We demonstrate these approaches on the CPhase-parasitic iSWAP-like gates. The KAK-based approach helps decrease unitary infidelity by a factor of 3 compared to the noisy implementation without error mitigation. When arbitrary single-qubit rotations are allowed, recompilation could completely mitigate the effect of parasitic errors but may require more native gates than the KAK-based approach. We also compare their average gate fidelity under realistic noise models, including relaxation and depolarising errors. Numerical results suggest that different approaches are advantageous in different error regimes, providing error mitigation guidance for near-term quantum computers.

Unlike classical digital computers in which a bit can represent either 1 or 0 at any time, quantum computers use a two-level system, i.e., a qubit, to implement logical operations based on quantum mechanical laws, which can represent both values at once. Owing to the superposition property of qubits, quantum computers have natural parallel processing advantages and thus have potential to exceed the computational efficiency of classical computers for particular tasks. Quantum logic gates are the generalization of classical logic gates in computational networks. It has been proved that two-qubit quantum gates together with one-qubit quantum gates are adequate for constructing networks with any possible quantum computational property. Directional couplers are the most critical elementsfor constructing the quantum gates. In recent years, photonic quantum technologies have emerged as a promising experimental platform for quantum computing. Single photons have robust noise resistance, long coherence time, high transmission speed and great compatibility with other systems. They can be easily manipulated and encoded in any of several degrees of freedom, for example, polarization, path, spatial mode or time bin. Optical waveguide technology enables the realizing of complex optical schemes comprised of many elements with desired scalability, stability and miniaturization. Femtosecond laser direct writing of waveguide has been adopted as a powerful tool for integrated quantum photonics with characteristics of rapidness, cost-effectiveness, mask-less and single-step process. In particular, it has the ability to build arbitrary three-dimensional circuits directly inside bulk materials, which is impossible to achieve with conventional lithography. In this article we review the femtosecond laser writing and quantum characterization of directional coupler and important one-qubit and two-qubit optical quantum logic gates, such as Hadamard gate, Pauli-X gate, controlled-NOT gate, and controlled-Phase gate. The qubits in these gates are usually encoded through optical paths or polarizations of photons. The key to the realization of polarization-encoded one-qubit gates is to achieve flexible wave-plate operations, which is described in detail. Controlled-NOT gate and controlled-phase gate are the most crucial two-qubit gates in the linear optics computation and sometimes they can be converted into each other by adding some one-qubit gates or special superposition states. Many different kinds of waveguide circuits have been used to implement these two-qubit gates. The outlook and challenges for the femtosecond laser writing of three-qubit gates, such as Toffoli gate and Fredkin gate, are briefly introduced.

Quantum computers are analog devices; thus they are highly susceptible to accumulative errors arising from classical control electronics. Fast operation—as necessitated by decoherence—makes gating errors very likely. In most current designs for scalable quantum computers, it is not possible to satisfy both the requirements of low decoherence errors and low gating errors. Here, we introduce a hardware-based technique for pseudo-digital gate operation. We perform self-consistent simulations of semiconductor quantum dots, finding that pseudo-digital techniques reduce operational error rates by more than two orders of magnitude, thus facilitating fast operation.

<sec>Spin qubits in silicon-based semiconductor quantum dots have become one of the prominent candidates for realizing fault-tolerant quantum computing due to their long coherence time, good controllability, and compatibility with modern advanced integrated circuit manufacturing processes. In recent years, due to the remarkable advances in silicon-based materials, the structure of quantum dot and its fabrication process, and qubit manipulation technology, the great progress of high-fidelity state preparation and readout, single- and two-qubit gates of spin qubits for silicon based semiconductor quantum computation has been achieved. The control fidelities for single- and two-qubit gates all exceed 99%—fault tolerance threshold required by the surface code known for its exceptionally high tolerance to errors. In this paper, we briefly introduce the basic concepts of silicon-based semiconductor quantum dots, discuss the state-of-art technologies used to improve the fidelities of single- and two-qubit gates, and finally highlight the research directions that should be focused on.</sec><sec>This paper is organized as follows. Firstly, we introduce three major types of quantum dot (QD) devices fabricated on different silicon-based substrates, including Si/SiGe heterojunction and Si/SiO<sub>2</sub>. The spin degree of electron or nucleus hosted in QD can be encoded into spin qubits. Electron spin qubits can be thermally initialized to ground state by using an electron reservoirs, and can be read out by spin-charge conversion mechanism: energy-selective readout (Elzerman readout) with reservoirs or Pauli spin blockade (PSB) without reservoirs. Additionally, high fidelity single-shot readout has been demonstrated by using radio-frequency gate reflectometry combined with the PSB, which has unique advantages in large-scale qubit array. To coherently control the spin qubits, electron dipole resonance (ESR) or electron dipole spin resonance (EDSR) for electron and nuclear magnetic resonance (NMR) for nucleus are introduced. With the help of isotope purification greatly improving the dephasing time of qubit and fast single-qubit manipulation based on EDSR, fidelity above 99.9% can be reached. For the two-qubit gates based on exchange interaction between electron spins, the strength of interaction <inline-formula><tex-math id="M1">\begin{document}$ J $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M1.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M1.png"/></alternatives></inline-formula> combined with Zeeman energy difference <inline-formula><tex-math id="M2">\begin{document}$ \Delta {E}_{z} $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M2.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M2.png"/></alternatives></inline-formula> determines the energy levels of system, which lead to the different two-qubit gates, such as controlled-Z (CZ), controlled-Rotation (CROT), and the square root of the SWAP gate (<inline-formula><tex-math id="M3">\begin{document}$ \sqrt{\rm{S}\rm{W}\rm{A}\rm{P}} $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M3.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="23-20221900_M3.png"/></alternatives></inline-formula>) gates. In order to improve the fidelity of two-qubit gates, a series of key technologies is used experimentally, they being isotope purification, symmetry operation, careful Hamiltonian engineering, and gate set tomography. Fidelity of two-qubit gates exceeding 99% has been demonstrated for electron spin qubits in Si/SiGe quantum dots and nuclear spin qubits in donors. These advances have pushed the silicon-based spin qubit platform to become a major stepping stone towards fault-tolerant quantum computation. Finally, we discuss the future study of spin qubits, that is, how to effectively expand the number of qubits, and many other problems to be explored and solved.</sec>

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.

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.

Ultracold atoms trapped by light offer robust quantum coherence and controllability, providing an attractive system for quantum information processing and for the simulation of complex problems in condensed matter physics. Many quantum information processing schemes require the manipulation and deterministic entanglement of individual qubits; this would typically be accomplished using controlled, state-dependent, coherent interactions among qubits. Recent experiments have made progress towards this goal by demonstrating entanglement among an ensemble of atoms confined in an optical lattice. Until now, however, there has been no demonstration of a key operation: controlled entanglement between atoms in isolated pairs. Here we use an optical lattice of double-well potentials to isolate and manipulate arrays of paired (87)Rb atoms, inducing controlled entangling interactions within each pair. Our experiment realizes proposals to use controlled exchange coupling in a system of neutral atoms. Although 87Rb atoms have nearly state-independent interactions, when we force two atoms into the same physical location, the wavefunction exchange symmetry of these identical bosons leads to state-dependent dynamics. We observe repeated interchange of spin between atoms occupying different vibrational levels, with a coherence time of more than ten milliseconds. This observation demonstrates the essential component of a neutral atom quantum SWAP gate (which interchanges the state of two qubits). Its 'half-implementation', the root SWAP gate, is entangling, and together with single-qubit rotations it forms a set of universal gates for quantum computation.

Fixed-frequency transmon quantum computers (QCs) have advanced in coherence times, addressability, and gate fidelities. Unfortunately, these devices are restricted by the number of on-chip qubits, capping processing power and slowing progress toward fault-tolerance. Although emerging transmon devices feature over 100 qubits, building QCs large enough for meaningful demonstrations of quantum advantage requires overcoming many design challenges. For example, today’s transmon qubits suffer from significant variation due to limited precision in fabrication. As a result, barring significant improvements in current fabrication techniques, scaling QCs by building ever larger individual chips with more qubits is hampered by device variation. Severe device variation that degrades QC performance is referred to as a defect. Here, we focus on a specific defect known as a frequency collision. When transmon frequencies collide, their difference falls within a range that limits two-qubit gate fidelity. Frequency collisions occur with greater probability on larger QCs, causing collision-free yields to decline as the number of on-chip qubits increases. As a solution, we propose exploiting the higher yields associated with smaller QCs by integrating quantum chiplets within quantum multi-chip modules (MCMs). Yield, gate performance, and application-based analysis show the feasibility of QC scaling through modularity. Our results demonstrate that chiplet architectures, relative to monolithic designs, benefit from average yield improvements ranging from 9.6 – 92.6 × for ≲5 qubit machines. In addition, our simulations explore the design space of chiplet systems and discover configurations that demonstrate average two-qubit gate infidelity reductions that are at best 0.815 × their monolithic counterpart. Finally, we observe that carefully-selected modular systems achieve fidelity improvements on a range of benchmark circuits.

Besides noticeable challenges in implementing low-error single- and two-qubit quantum gates in superconducting quantum processors, the readout technique and analysis are a key factor in determining the efficiency and performance of quantum processors. Being able to efficiently implement quantum algorithms involving entangling gates and asses their output is mandatory for quantum utility. In a transmon-based 5-qubit superconducting quantum processor, we compared the performance of quantum circuits involving an increasing level of complexity, from single-qubit circuits to maximally entangled Bell circuits. This comparison highlighted the importance of the readout analysis and helped us optimize the protocol for more advanced quantum algorithms. Here, we report the results obtained from the analysis of the outputs of quantum circuits using two readout paradigms, referred to as “multiplied readout probabilities” and “conditional readout probabilities.” The first method is suitable for single-qubit circuits, while the second is essential for accurately interpreting the outputs of circuits involving two-qubit gates.

<p indent="0mm">Recently, the achievement, entitled “lifetime enhancement for a logic qubit by bosonic encoding error correction”, has been selected as one of “The Ten Major Advances in Chinese Science 2023”. Here, we will introduce briefly the importance of this work. It is known that quantum states are fragile due to decoherence induced by environment. Error will happen on a qubit, resulting in continuously changes of the parameters for this qubit, such as amplitude and phase parameters. The aim of quantum error correction is to amend those errors by using various quantum error correction codes, in which a logic qubit can be represented by several physical qubits. It should be noted that the quantum error correction can be realized by correcting a discrete set of errors, such as bit-flip error, phase-flip error or both of them. On the other hand, types of errors occurred depend on specific platforms of quantum computation. For example, photon loss is more inclined to occur in photonic systems. In this case, the approach of bosonic encoding of quantum error correction is more efficient. The work “lifetime enhancement for a logic qubit by bosonic encoding error correction” is for such a scenario. The challenge of quantum error correction is that operation itself is not perfect which may incur new errors. So it is actually difficult to demonstrate that we can benefit from quantum error correction. The achievement of lifetime enhancement by bosonic encoding error correction succeeds in beating this break-even point. The experiments are performed by circuit quantum electrodynamics on a superconducting processor with a qubit and a coupled resonate cavity. The logic qubit is realized by the bosonic mode of the cavity, while the superconducting qubit plays the role of the ancillary qubit in error correction. The initial states are prepared by the superconducting qubit, and are transferred to the logic qubit in the cavity. Then the error correction can be performed based on detection of photon loss by the superconducting qubit. The results show that the lifetime of the logic qubit increases from <sc>694 μs</sc> to <sc>805 μs</sc> with 16% enhancement. Besides high quality devices, the success of this experiment depends on the feedback control to detect and correct the error of photon loss in a short time. The result of beating the break-even point of bosonic encoding error correction is for one logic qubit. In the near future, it is hopeful to implement logic gates, such as single-qubit rotation gate and two-qubit gate, on a couple of logic qubits by bosonic encoding. The importance of the results will depend on whether higher fidelity can be achieved compared with those of gates with physical qubits. In this way, the advantage of the logic qubits for quantum computation is presented. It will be significant that the approach of bosonic encoding with a superconducting processor is scalable to hundreds of logic qubits, which may take a few years to realize. Our aim is to realize a fault-tolerant universal quantum computer based on a large quantity of high-precision logic qubits. The work “lifetime enhancement for a logic qubit by bosonic encoding error correction” is an important step toward this aim.

Quantum mechanics is the most ground-breaking and fascinating theoretical concept developed in physics during the past century. Much of our present understanding of the microscopic world and its extension into the macroscopic world, including modern technical applications, is based upon quantum mechanics. We have experienced a remarkable development of information and communication technology during the past two decades, to a large extent depending upon successful fabrication of smaller and smaller components and circuits. However, we are finally approaching the physical limits of component miniaturization as we enter a microscopic world ruled by quantum mechanics.

This chapter presents state-of-the-art and future perspectives of quantum computing and communication. Timeline of relevant findings in quantum informatics, such as quantum algorithms, quantum cryptography protocols, and quantum computing models, is summarized. Mathematics of information representation with quantum states is presented. The quantum circuit and adiabatic models of quantum computation are outlined. The functionality, limitations, and security of the quantum key distribution (QKD) protocol is presented. Current implementations of quantum computers and principles of quantum programming are shortly described.

The engineering of a compact qubit unit cell that embeds all quantum functionalities is mandatory for large-scale integration. In addition, these functionalities should present the lowest error rate possible to successfully implement quantum error correction protocols1. Electron spins in silicon quantum dots are particularly promising because of their high control fidelity2-5 and their potential compatibility with complementary metal-oxide-semiconductor industrial platforms6,7. However, an efficient and scalable spin readout scheme is still missing. Here we demonstrate a high fidelity and robust spin readout based on gate reflectometry in a complementary metal-oxide-semiconductor device that consists of a qubit dot and an ancillary dot coupled to an electron reservoir. This scalable method allows us to read out a spin in a single-shot manner with an average fidelity above 98% for a 0.5 ms integration time. To achieve such a fidelity, we combine radio-frequency gate reflectometry with a latched spin blockade mechanism that requires electron exchange between the ancillary dot and the reservoir. We show that the demonstrated high readout fidelity is fully preserved up to 0.5 K. This result holds particular relevance for the future cointegration of spin qubits and classical control electronics.

We describe a method to control and detect in single shot the electron spin state of an individual donor in silicon with greatly enhanced sensitivity. A silicon-based single-electron transistor (SET) allows for spin-dependent tunneling of the donor electron directly into the SET island during the readout phase. Simulations show that the charge transfer signals are typically $\ensuremath{\Delta}q\ensuremath{\gtrsim}0.2e$---over an order of magnitude larger than achievable with metallic SETs on the ${\text{SiO}}_{2}$ surface. A complete spin-based qubit structure is obtained by adding a local electron spin resonance line for coherent spin control. This architecture is ideally suited to demonstrate and study the coherent properties of donor electron spins, but can be expanded and integrated with classical control electronics in the context of scale up.