B.M. Terhal
Please Note
24 records found
1
Code appendix: https://github.com/SAJHCamps/Thesis-project-AM ...
Code appendix: https://github.com/SAJHCamps/Thesis-project-AM
As a critical foundation for the design of highly anharmonic fluxonium qubits, I extended the energy participation ratio (EPR) approach to describe strongly nonlinear superconducting circuits beyond its conventional low-order treatment of nonlinear terms, which becomes inadequate for strongly anharmonic circuits such as fluxonium. This extension yields more accurate predictions of the fluxonium frequency, anharmonicity, and dispersive coupling, which we experimentally validated using a fluxonium qubit coupled to a microwave resonator. The predicted quantities show excellent agreement with the corresponding experimental measurements, demonstrating that the extended EPR framework can accurately capture the interaction between highly nonlinear circuits and their electromagnetic environment.
The implementation of high-coherence superconducting circuits requires careful material selection and fabrication-process engineering. Microwave resonators provide a useful platform for studying material-dependent loss mechanisms, as their performance can be quantified through the internal quality factor. In this work, different superconducting material stacks and substrates were investigated, with particular attention to tantalum-based resonators and the influence of deposition, etching, surface morphology, and structural properties on resonator performance. A growth recipe was developed for Nb-seed-layer tantalum films on silicon as an alternative to NbTiN for superconducting resonators. The resulting resonators showed reproducible power-dependent behaviour, while additional low-power measurements of the Nb/Ta-on-Si platform reached internal quality factors of up to ∼ 5 × 10^6. Across the investigated tantalum devices, the resonator performance varied substantially with the substrate, seed layer, and fabrication conditions. The Nb/Ta-on-Si devices achieved Q_i values exceeding 10^6 and outperformed the NbTiN reference, while the Ta-on-sapphire devices showed slightly higher performance than the NbTiN reference but did not reach 10^6. These results highlight tantalum as a promising material for high-coherence superconducting circuits, while also demonstrating the importance of controlling the growth and fabrication conditions.
In parallel, granular aluminium was investigated as a compact alternative to Josephson-junction arrays for fluxonium superinductors. GrAl nanowire resonators were fabricated and demonstrated to be superconducting, with power-dependent quality factors and a measurable resonance-frequency shift at high drive powers, indicating nonlinear behaviour. The deposition process was subsequently optimised to improve control over the deposition rate and its temporal stability, providing a more reproducible route towards the targeted kinetic inductance. Although the integration of the GrAl nanowire into a complete fluxonium device could not be completed within the scope of this thesis, these results establish the fabrication and deposition processes required for its future implementation.
Building on the advanced circuit-simulation and fabrication capabilities developed throughout this work, increasingly complex fluxonium systems were designed and characterised. To enable fast and high-fidelity two-qubit operations, a fluxonium-transmon-fluxonium architecture was developed, with electromagnetic and circuit-level simulations identifying suitable operating conditions and optimised gate protocols. To further improve the speed of qubit-state assignment, flux-pulse-assisted readout was demonstrated experimentally by temporarily moving the fluxonium away from its sweet spot to a readout point with a larger dispersive shift, enabling faster qubit-state assignment than conventional readout at the fluxonium sweet spot.
Together, these results demonstrate the importance of integrating modelling, materials engineering, fabrication, device design, and quantum control in the development of scalable fluxonium-based quantum processors.
...
As a critical foundation for the design of highly anharmonic fluxonium qubits, I extended the energy participation ratio (EPR) approach to describe strongly nonlinear superconducting circuits beyond its conventional low-order treatment of nonlinear terms, which becomes inadequate for strongly anharmonic circuits such as fluxonium. This extension yields more accurate predictions of the fluxonium frequency, anharmonicity, and dispersive coupling, which we experimentally validated using a fluxonium qubit coupled to a microwave resonator. The predicted quantities show excellent agreement with the corresponding experimental measurements, demonstrating that the extended EPR framework can accurately capture the interaction between highly nonlinear circuits and their electromagnetic environment.
The implementation of high-coherence superconducting circuits requires careful material selection and fabrication-process engineering. Microwave resonators provide a useful platform for studying material-dependent loss mechanisms, as their performance can be quantified through the internal quality factor. In this work, different superconducting material stacks and substrates were investigated, with particular attention to tantalum-based resonators and the influence of deposition, etching, surface morphology, and structural properties on resonator performance. A growth recipe was developed for Nb-seed-layer tantalum films on silicon as an alternative to NbTiN for superconducting resonators. The resulting resonators showed reproducible power-dependent behaviour, while additional low-power measurements of the Nb/Ta-on-Si platform reached internal quality factors of up to ∼ 5 × 10^6. Across the investigated tantalum devices, the resonator performance varied substantially with the substrate, seed layer, and fabrication conditions. The Nb/Ta-on-Si devices achieved Q_i values exceeding 10^6 and outperformed the NbTiN reference, while the Ta-on-sapphire devices showed slightly higher performance than the NbTiN reference but did not reach 10^6. These results highlight tantalum as a promising material for high-coherence superconducting circuits, while also demonstrating the importance of controlling the growth and fabrication conditions.
In parallel, granular aluminium was investigated as a compact alternative to Josephson-junction arrays for fluxonium superinductors. GrAl nanowire resonators were fabricated and demonstrated to be superconducting, with power-dependent quality factors and a measurable resonance-frequency shift at high drive powers, indicating nonlinear behaviour. The deposition process was subsequently optimised to improve control over the deposition rate and its temporal stability, providing a more reproducible route towards the targeted kinetic inductance. Although the integration of the GrAl nanowire into a complete fluxonium device could not be completed within the scope of this thesis, these results establish the fabrication and deposition processes required for its future implementation.
Building on the advanced circuit-simulation and fabrication capabilities developed throughout this work, increasingly complex fluxonium systems were designed and characterised. To enable fast and high-fidelity two-qubit operations, a fluxonium-transmon-fluxonium architecture was developed, with electromagnetic and circuit-level simulations identifying suitable operating conditions and optimised gate protocols. To further improve the speed of qubit-state assignment, flux-pulse-assisted readout was demonstrated experimentally by temporarily moving the fluxonium away from its sweet spot to a readout point with a larger dispersive shift, enabling faster qubit-state assignment than conventional readout at the fluxonium sweet spot.
Together, these results demonstrate the importance of integrating modelling, materials engineering, fabrication, device design, and quantum control in the development of scalable fluxonium-based quantum processors.
Chapter 2 investigates the fermionic satisfiability problem, FERMIONIC k-SAT, which asks whether there exists a state in the joint null space of parity-preserving local fermionic projectors. This serves as a setting for understanding when the satisfiability of “quantum fermionic constraints” remains classically decidable. We show that the case k = 2 is efficiently solvable classically, but that adding global constraints can crucially change the complexity: enforcing particle-number parity preserves classical tractability, while fixing the particle number itself makes the problem NP-complete. We also show that at higher locality, k = 9, the problem becomes QMA1-hard.
Chapters 3 and 4 address fermionic Hamiltonian optimization through Gaussian approximations, motivated by the broader question of when simple classes of states provably capture a non-vanishing fraction of an interacting ground-state energy. In stark contrast to qubit Hamiltonians—for which product states provably achieve a constant fraction of the ground energy—fermionic Gaussian states achieve only a vanishing fraction in general. This raises the question of whether certain (physically motivated) structural assumptions can be imposed on fermionic Hamiltonians to avoid this “Gaussian breakdown.” Chapter 3 focuses on classically interacting (i.e., density-density interacting) fermionic Hamiltonians, reflecting the diagonal structure of Coulomb terms in electronic-structure models. Here we prove that fermionic Gaussian states achieve a constant approximation ratio of at least 1/3 for such Hamiltonians, and we develop efficient semidefinite programming methods for Gaussian approximations for several traceless and positive-semidefinite families, including variants that enforce a fixed average particle number. Chapter 4 shows that sparsity is another decisive structural assumption: for sparse fermionic Hamiltonians, Gaussian states also achieve a constant ratio of the ground energy, and the corresponding Gaussian state can be found efficiently.
Chapter 5 develops quantum algorithms for simulating (sparse) free fermions in a compressed representation. While free-fermion physics is classically tractable in an asymptotic sense, practical costs can still become prohibitive when simulating large systems. The key idea behind our quantum algorithms is to block-encode correlation matrices, Green’s functions, and related objects into quantum circuits, enabling procedures whose memory costs scale polylogarithmically in the number of modes—an exponential improvement in memory relative to standard classical representations. Depending on geometric structure (lattices versus general graphs), the resulting runtime improvement over the best known classical methods is exponential or strongly polynomial. Because the associated simulation tasks are BQP-hard, the results also imply that compressed free-fermion simulation should be viewed not merely as a convenience, but as a route to potential quantum advantage for some families of instances.
Chapters 6 and 7 share the theme of estimating spectra of many-body Hamiltonians from time-domain data and connect algorithm design to practical bottlenecks in extracting spectral information from experiments. Chapter 6 studies how spectral properties can be recovered from signals derived from time evolution, comparing a classical Monte Carlo scheme that estimates imaginary-time decays to quantum procedures that estimate real-time oscillations generated using phase-estimation-type circuits. We give guarantees on resolvability under assumptions relating to spectral gaps, initial states, and sign-problem-freeness of the Hamiltonian. Chapter 7 targets a different problem related to the practical implementation of phase-estimation-type quantum circuits on near-term devices. These circuits contain an expensive controlled time-evolution step, and their depth can be reduced by removing this control, making them more suitable for such devices. We realize this by employing adapted phase-retrieval methods, at the cost of running reduced-depth circuits more times. Numerical studies on the Fermi–Hubbard model illustrate the feasibility and noise resilience of our methods. ...
Chapter 2 investigates the fermionic satisfiability problem, FERMIONIC k-SAT, which asks whether there exists a state in the joint null space of parity-preserving local fermionic projectors. This serves as a setting for understanding when the satisfiability of “quantum fermionic constraints” remains classically decidable. We show that the case k = 2 is efficiently solvable classically, but that adding global constraints can crucially change the complexity: enforcing particle-number parity preserves classical tractability, while fixing the particle number itself makes the problem NP-complete. We also show that at higher locality, k = 9, the problem becomes QMA1-hard.
Chapters 3 and 4 address fermionic Hamiltonian optimization through Gaussian approximations, motivated by the broader question of when simple classes of states provably capture a non-vanishing fraction of an interacting ground-state energy. In stark contrast to qubit Hamiltonians—for which product states provably achieve a constant fraction of the ground energy—fermionic Gaussian states achieve only a vanishing fraction in general. This raises the question of whether certain (physically motivated) structural assumptions can be imposed on fermionic Hamiltonians to avoid this “Gaussian breakdown.” Chapter 3 focuses on classically interacting (i.e., density-density interacting) fermionic Hamiltonians, reflecting the diagonal structure of Coulomb terms in electronic-structure models. Here we prove that fermionic Gaussian states achieve a constant approximation ratio of at least 1/3 for such Hamiltonians, and we develop efficient semidefinite programming methods for Gaussian approximations for several traceless and positive-semidefinite families, including variants that enforce a fixed average particle number. Chapter 4 shows that sparsity is another decisive structural assumption: for sparse fermionic Hamiltonians, Gaussian states also achieve a constant ratio of the ground energy, and the corresponding Gaussian state can be found efficiently.
Chapter 5 develops quantum algorithms for simulating (sparse) free fermions in a compressed representation. While free-fermion physics is classically tractable in an asymptotic sense, practical costs can still become prohibitive when simulating large systems. The key idea behind our quantum algorithms is to block-encode correlation matrices, Green’s functions, and related objects into quantum circuits, enabling procedures whose memory costs scale polylogarithmically in the number of modes—an exponential improvement in memory relative to standard classical representations. Depending on geometric structure (lattices versus general graphs), the resulting runtime improvement over the best known classical methods is exponential or strongly polynomial. Because the associated simulation tasks are BQP-hard, the results also imply that compressed free-fermion simulation should be viewed not merely as a convenience, but as a route to potential quantum advantage for some families of instances.
Chapters 6 and 7 share the theme of estimating spectra of many-body Hamiltonians from time-domain data and connect algorithm design to practical bottlenecks in extracting spectral information from experiments. Chapter 6 studies how spectral properties can be recovered from signals derived from time evolution, comparing a classical Monte Carlo scheme that estimates imaginary-time decays to quantum procedures that estimate real-time oscillations generated using phase-estimation-type circuits. We give guarantees on resolvability under assumptions relating to spectral gaps, initial states, and sign-problem-freeness of the Hamiltonian. Chapter 7 targets a different problem related to the practical implementation of phase-estimation-type quantum circuits on near-term devices. These circuits contain an expensive controlled time-evolution step, and their depth can be reduced by removing this control, making them more suitable for such devices. We realize this by employing adapted phase-retrieval methods, at the cost of running reduced-depth circuits more times. Numerical studies on the Fermi–Hubbard model illustrate the feasibility and noise resilience of our methods.
Intermediate Flag Verification for Logical Zero State Preparation
In the [[15,1,3]] Code and Other PQRM Codes
We compare IV and final verification circuits under realistic noise models, evaluating their logical error rate, acceptance probability, and expected runtime. Our results show that IV does not always improve expected runtime, since the acceptance probability is already high in the relevant noise regime. How- ever, IV could lead to reduced circuit depth after native gate compilation and scheduling. Hardware experiments on the Quantinuum H1-1 trapped-ion quantum chip confirm that the logical error rate falls below the physical error rate of this device, indicating that encoding already offers a practical benefit. These findings highlight IV as a viable design element for logical state preparation, especially as a design feature within circuit synthesis or reinforcement learning methods that aim to minimise depth under hardware constraints. ...
We compare IV and final verification circuits under realistic noise models, evaluating their logical error rate, acceptance probability, and expected runtime. Our results show that IV does not always improve expected runtime, since the acceptance probability is already high in the relevant noise regime. How- ever, IV could lead to reduced circuit depth after native gate compilation and scheduling. Hardware experiments on the Quantinuum H1-1 trapped-ion quantum chip confirm that the logical error rate falls below the physical error rate of this device, indicating that encoding already offers a practical benefit. These findings highlight IV as a viable design element for logical state preparation, especially as a design feature within circuit synthesis or reinforcement learning methods that aim to minimise depth under hardware constraints.
An Entropy-Based Approach to the Union-Closed Sets Conjecture
Understanding the chaos of entropy in combinatorics
All these explorations have been focused on understanding recent developments and to create a unified narrative. Due to time constraints, the thesis did not pursue new results. However, the comprehensive understanding gained has given some promising directions for future research. ...
All these explorations have been focused on understanding recent developments and to create a unified narrative. Due to time constraints, the thesis did not pursue new results. However, the comprehensive understanding gained has given some promising directions for future research.
Improved fermion-to-qubit mappings for local and sparse fermionic Hamiltonians
A way to map fermionic Hamiltonians onto qubit Hamiltonians while preserving locality and sparsity and minimizing the number of qubits
In the constructed mapping, the Bravyi-Kitaev superfast encoding is used to place qubits at the edges of a graph corresponding to a physical system of n fermionic modes. From this encoding certain stabilizer constraints arise which ensure that the correct fermionic operators are being encoded throughout the entire simulation, and which are used to detect the occurrence of any errors during the simulation.
In combination with the superfast encoding, a randomized algorithm developed by Freedman-Hastings is combined with a stacking- and sewing procedure of the graph and a Vertex Coloring algorithm to obtain a cycle basis which governs the properties of these stabilizer constraints.
This constructed mapping obtains a locality and sparsity of the qubit Hamiltonian terms and stabilizer constraints of O(1), while keeping the total number of qubits O(npoly(log(n))). Here poly(log(n)) means some polynomial in log(n). It is also numerically shown that the number of qubits can be further reduced, while keeping the locality of the stabilizer constraints O(1), and the locality and sparsity of the qubit Hamiltonian terms and the sparsity of the stabilizer constraints O(poly(log(n))).
It is furthermore shown how to use this encoding to perform simulations of two fermionic systems, namely the Fermi-Hubbard model on sparse hopping graphs and the sparse SYK model. ...
In the constructed mapping, the Bravyi-Kitaev superfast encoding is used to place qubits at the edges of a graph corresponding to a physical system of n fermionic modes. From this encoding certain stabilizer constraints arise which ensure that the correct fermionic operators are being encoded throughout the entire simulation, and which are used to detect the occurrence of any errors during the simulation.
In combination with the superfast encoding, a randomized algorithm developed by Freedman-Hastings is combined with a stacking- and sewing procedure of the graph and a Vertex Coloring algorithm to obtain a cycle basis which governs the properties of these stabilizer constraints.
This constructed mapping obtains a locality and sparsity of the qubit Hamiltonian terms and stabilizer constraints of O(1), while keeping the total number of qubits O(npoly(log(n))). Here poly(log(n)) means some polynomial in log(n). It is also numerically shown that the number of qubits can be further reduced, while keeping the locality of the stabilizer constraints O(1), and the locality and sparsity of the qubit Hamiltonian terms and the sparsity of the stabilizer constraints O(poly(log(n))).
It is furthermore shown how to use this encoding to perform simulations of two fermionic systems, namely the Fermi-Hubbard model on sparse hopping graphs and the sparse SYK model.
Surface-code Superconducting Quantum Processors
From Calibration to Logical Performance
Yet, current quantum processors are fragile, noisy and fairly limited in both quantity and quality with tens of qubits and physical error rates of around 10-3. To realize practical quantum applications, however, error rates need to be below 10-15 across millions of qubits. To bridge this gap and fully harness the potential of quantum computers, quantum error correction (QEC) is essential. QEC codes are designed to protect quantum information by redundantly encoding it onto multiple physical qubits. This encoding allows for the detection and correction of local errors affecting individual qubits, e.g., through stabilizer measurements. Importantly, if the physical error rates are below a specific threshold, QEC codes can exponentially suppress logical error rates by increasing the number of physical qubits involved. This is essential for achieving fault-tolerant computations, which are key to unlocking the full potential of quantum computers…
...
Yet, current quantum processors are fragile, noisy and fairly limited in both quantity and quality with tens of qubits and physical error rates of around 10-3. To realize practical quantum applications, however, error rates need to be below 10-15 across millions of qubits. To bridge this gap and fully harness the potential of quantum computers, quantum error correction (QEC) is essential. QEC codes are designed to protect quantum information by redundantly encoding it onto multiple physical qubits. This encoding allows for the detection and correction of local errors affecting individual qubits, e.g., through stabilizer measurements. Importantly, if the physical error rates are below a specific threshold, QEC codes can exponentially suppress logical error rates by increasing the number of physical qubits involved. This is essential for achieving fault-tolerant computations, which are key to unlocking the full potential of quantum computers…
Chapter 1 contains an introduction to classical and quantum information and introduces superconducting circuits as a platform for quantum information processing. An outline of the contents of the thesis is also provided.
In Chapter 2 a theoretical foundation for the later chapters is established, spanning from the classical harmonic oscillator to circuit quantum electrodynamical systems and parametric driving. The transmon qubit, junction-embedded coplanar waveguide, tunable coupler, and Josephson junction array resonator are introduced and some methods for realizing parametrically activated interactions in such systems are discussed.
Chapter 3 focuses on the steps necessary for constructing a superconducting quantum circuit. The design, simulation, and fabrication methods necessary for creating the experimental devices of later chapters are discussed.
In Chapter 4 results of the parametrically activated interactions between two tunably coupled transmon qubits by flux modulation of a SQUID are presented. When the coupling SQUID is modulated at the sum or difference frequencies of the transmons, level repulsion and attraction are observed spectroscopically. The viability of the platform for analog quantum simulations is discussed and the experimental results are compared to analytical models and numerical simulations of the quantum master equation.
In Chapter 5 spectroscopic signatures of a few-photon Kerr parametric oscillator are observed upon the application of an all-microwave bichromatic drive to a Josephson junction-embedded coplanar waveguide resonator. Semiclassical analytical, numerical, and quantum master equation simulations are performed and compared with the experimental results. An effective model based on semiclassical methods proves insufficient in modelling the behaviour of the system, indicating the presence of quantum effects.
In Chapter 6 a weakly nonlinear Josephson junction array resonator is bichromatically driven into a parametric phase state. Stochastic switching between the two non-equilibrium stationary states of the system is observed and the time between stochastic switching events is determined for a range of drive strengths. An additional microwave drive resonant with the frequency of parametric response is applied and the system is biased into one of the phase states. The biasing and change in switching time as a function of drive power and phase is shown. The contributions of classical and quantum effects to the occurrence of switching events is discussed.
In Chapter 7 measurements of a strongly parametrically driven Duffing oscillator are presented. As the system is strongly driven at a variety of large negative detunings, signatures of chaotic behaviour are observed in the output field spectrum and quadrature histograms. The observed features are discussed and compared to known markers of chaotic behaviour in classical parametrically driven Duffing oscillators.
Chapter 8 concludes the thesis, providing a review of the contents and findings of the previous chapters. The thesis ends with an outlook and suggestions for potential future topics of study.
...
Chapter 1 contains an introduction to classical and quantum information and introduces superconducting circuits as a platform for quantum information processing. An outline of the contents of the thesis is also provided.
In Chapter 2 a theoretical foundation for the later chapters is established, spanning from the classical harmonic oscillator to circuit quantum electrodynamical systems and parametric driving. The transmon qubit, junction-embedded coplanar waveguide, tunable coupler, and Josephson junction array resonator are introduced and some methods for realizing parametrically activated interactions in such systems are discussed.
Chapter 3 focuses on the steps necessary for constructing a superconducting quantum circuit. The design, simulation, and fabrication methods necessary for creating the experimental devices of later chapters are discussed.
In Chapter 4 results of the parametrically activated interactions between two tunably coupled transmon qubits by flux modulation of a SQUID are presented. When the coupling SQUID is modulated at the sum or difference frequencies of the transmons, level repulsion and attraction are observed spectroscopically. The viability of the platform for analog quantum simulations is discussed and the experimental results are compared to analytical models and numerical simulations of the quantum master equation.
In Chapter 5 spectroscopic signatures of a few-photon Kerr parametric oscillator are observed upon the application of an all-microwave bichromatic drive to a Josephson junction-embedded coplanar waveguide resonator. Semiclassical analytical, numerical, and quantum master equation simulations are performed and compared with the experimental results. An effective model based on semiclassical methods proves insufficient in modelling the behaviour of the system, indicating the presence of quantum effects.
In Chapter 6 a weakly nonlinear Josephson junction array resonator is bichromatically driven into a parametric phase state. Stochastic switching between the two non-equilibrium stationary states of the system is observed and the time between stochastic switching events is determined for a range of drive strengths. An additional microwave drive resonant with the frequency of parametric response is applied and the system is biased into one of the phase states. The biasing and change in switching time as a function of drive power and phase is shown. The contributions of classical and quantum effects to the occurrence of switching events is discussed.
In Chapter 7 measurements of a strongly parametrically driven Duffing oscillator are presented. As the system is strongly driven at a variety of large negative detunings, signatures of chaotic behaviour are observed in the output field spectrum and quadrature histograms. The observed features are discussed and compared to known markers of chaotic behaviour in classical parametrically driven Duffing oscillators.
Chapter 8 concludes the thesis, providing a review of the contents and findings of the previous chapters. The thesis ends with an outlook and suggestions for potential future topics of study.
The Small Stellated Dodecahedron Code
Finding Interleaved Measurement Schedules
From Möbius Strips to Twisted Toric Codes
A Homological Approach to Quantum Low Density Parity Check Codes
First, we provide an overview of the theory of singular homology, cellular homology, and homological algebra over vector spaces, and use this theory to analyse two product constructions: the hypergraph product construction and the distance balancing procedure. These constructions can be interpreted as tensor products of chain complexes over vector spaces. We present new proofs for results from the literature regarding the distance and the number of encoded qubits of these product codes.
Secondly, we survey the theory of homology over ring modules, and use this theory to interpret and analyse another product code construction (the lifted product code construction), which is a generalisation of the hypergraph product construction. We prove a Künneth theorem for these codes, and use this theorem to prove a formula for the number of qubits such codes encode.
Thirdly, we investigate the homology of fibre bundles. To this end, we provide an overview of the theory of covering spaces and of fibre bundles, as well as an overview of the theory of homology with local coefficients and of spectral sequences. We then calculate the homology of a specific class of fibre bundles using three different methods. After this discussion, we consider two product code constructions: the fibre bundle product construction and the balanced product construction. We explicate their mathematical foundations, and use these insights to prove two new results for the number of qubits that these product codes encode. Finally, we explain under which conditions these two code constructions and the lifted product construction coincide.
Lastly, we consider a specific example of fibre bundle product codes: the twisted toric code. We determine an analytic expression for the distance of such a code and verify this expression using numerical simulations. Furthermore, we perform an extensive numerical study on these codes to determine how performing a twist alters the scaling of the logical error rate of such codes. We present a new analytic method to explain the scaling of these codes on a small domain, and verify the validity of these calculations by comparing them with the results of our numerical simulations. ...
First, we provide an overview of the theory of singular homology, cellular homology, and homological algebra over vector spaces, and use this theory to analyse two product constructions: the hypergraph product construction and the distance balancing procedure. These constructions can be interpreted as tensor products of chain complexes over vector spaces. We present new proofs for results from the literature regarding the distance and the number of encoded qubits of these product codes.
Secondly, we survey the theory of homology over ring modules, and use this theory to interpret and analyse another product code construction (the lifted product code construction), which is a generalisation of the hypergraph product construction. We prove a Künneth theorem for these codes, and use this theorem to prove a formula for the number of qubits such codes encode.
Thirdly, we investigate the homology of fibre bundles. To this end, we provide an overview of the theory of covering spaces and of fibre bundles, as well as an overview of the theory of homology with local coefficients and of spectral sequences. We then calculate the homology of a specific class of fibre bundles using three different methods. After this discussion, we consider two product code constructions: the fibre bundle product construction and the balanced product construction. We explicate their mathematical foundations, and use these insights to prove two new results for the number of qubits that these product codes encode. Finally, we explain under which conditions these two code constructions and the lifted product construction coincide.
Lastly, we consider a specific example of fibre bundle product codes: the twisted toric code. We determine an analytic expression for the distance of such a code and verify this expression using numerical simulations. Furthermore, we perform an extensive numerical study on these codes to determine how performing a twist alters the scaling of the logical error rate of such codes. We present a new analytic method to explain the scaling of these codes on a small domain, and verify the validity of these calculations by comparing them with the results of our numerical simulations.
In a further analysis on the error probabilities and their standard deviation, it is shown that the standard error for space and time edges in the experiment is consistent with the standard error from phenomenological noise initialised with the average error data and ancilla error probabilities, even when
these may be affected by non-conventional errors. ...
In a further analysis on the error probabilities and their standard deviation, it is shown that the standard error for space and time edges in the experiment is consistent with the standard error from phenomenological noise initialised with the average error data and ancilla error probabilities, even when
these may be affected by non-conventional errors.
walk collapses to a distribution centered around origin within t = 100 steps, similar to a classical random walk. Exceptions are the 2D walks for α·β = ±π/6 mod π/2 or ±
π/4 mod π/2, for which the variance is still proportional to the number of steps squared. ...
walk collapses to a distribution centered around origin within t = 100 steps, similar to a classical random walk. Exceptions are the 2D walks for α·β = ±π/6 mod π/2 or ±
π/4 mod π/2, for which the variance is still proportional to the number of steps squared.