Circular Image

B.M. Terhal

info

Please Note

24 records found

This thesis investigates fault-tolerant universal quantum computation using the surface code, fast transversal Clifford gates and 15-to-1 magic state distillation (MSD). In particular, it addresses the decoding challenges introduced by transversal gates and the preparation of high-fidelity logical T states. The Logical Observable Matching (LOM) decoder is extended to support noisy T-state preparation through unitary encoding followed by magic state distillation. Theoretical analysis demonstrates that the distillation factory achieves the optimal \(O(p^3)\) error-suppression scaling under the LOM decoder. Furthermore, a computationally efficient simulation method is developed to benchmark non-Clifford distillation circuits without relying on approximations. Numerical results confirm the theoretical error-suppression scaling and demonstrate the applicability of the LOM decoder to fault-tolerant universal quantum computation. The work also identifies challenges associated with multiple rounds of magic state distillation and discusses possible extensions to the rotated surface code. ...
Master thesis (2026) - S.A.J.H. Camps, B.M. Terhal
In this thesis we numerically investigate the performance of logical measurements on the toric quantum error correcting code using the ancilla construction of Cohen et al.[1], both with and without the morphing circuit design technique. We simulate the measurement of the logical Z1 observable on the toric code under circuit-level noise using the STIM package, exploring the effects of the number of ancilla layers and QEC rounds on the logical measurement and idle error rates. We find that for the toric code, a single dual layer performs best and that additional layers only increase the measurement error rate without improving the idle error rate. Regarding the number of QEC rounds, we find that performing at least as many rounds as the code distance is necessary to ensure the measurement error rate scales with the code distance rather than the weight of low-order measurement errors over different QEC rounds. Beyond this threshold, additional rounds improve the measurement error rate at the cost of a higher idle error rate, presenting a tunable trade-off. Finally, we compare the morphing and standard versions of the circuit. Despite the morphing version using half as many physical qubits, it achieves better logical measurement error rates and similar idle error rates relative to the standard circuit, leading us to conclude that the morphing version outperforms its standard counterpart.

Code appendix: https://github.com/SAJHCamps/Thesis-project-AM ...
Bachelor thesis (2026) - Harsh Harsh K. Mishra, Ana Achúcarro, B. Janssens, B.M. Terhal, A.A.F.M. Artaud, R.C. Kraaij
In general relativity, mass cannot generally be defined as the volume integral over some density, as it is in Newtonian physics. This thesis investigates this question and how a spherically symmetric spacetime provides the tools to construct a volume integral expression for mass. However, the volume integral for this mass contains no ’curvature factor’, which would normally be expected for volume integral in a general relativistic setting. The static and dust solutions, important special cases of spherically symmetric spacetimes, are reviewed to demonstrate this peculiar property. In addition, we comment on the implications of this mass definition for the averaging procedures in cosmology. ...
Doctoral thesis (2026) - F. Yilmaz, C.K. Andersen, B.M. Terhal
This thesis summarises my work on the design, electromagnetic simulation and modelling, fabrication, and experimental characterisation of superconducting quantum circuits, with a particular focus on highly anharmonic fluxonium qubits. To this end, I have worked on complementary aspects of superconducting quantum-device development, ranging from predictive electromagnetic modelling and materials engineering to superinductive elements and multi-qubit architectures.

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.
...
Doctoral thesis (2026) - M.E.H.M. Stroeks, B.M. Terhal, Fabian Hassler
This thesis studies computational tasks that arise in quantum many-body physics, with an emphasis on fermionic systems. We develop complexity-theoretic classifications and constructive algorithmic results, thereby establishing opportunities and limitations of classical and quantum algorithms for carrying out these tasks.

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. ...
Master thesis (2025) - S.C. Birkenhäger, B.M. Terhal, C.K. Andersen, B. Janssens, Sascha Heußen
Logical state preparation is a fundamental step in fault-tolerant quantum computing, and logical |0⟩𝐿 states are frequently needed throughout fault-tolerant circuits, for example at the start of computation, during error correction, or as part of magic state distillation. It is therefore important that they can be implemented efficiently. This thesis investigates intermediate verification (IV) as an alternative strategy, where the verification step is placed partway through the preparation circuit rather than at the end. We use the |0⟩𝐿 state of the [[15, 1, 3]] code as a case study, and construct IV circuits based on the recursive structure of its encoding circuit. We prove that such circuits remain fault-tolerant for punctured quantum Reed-Muller (PQRM) codes of the form PQRM(1, 𝑚−2, 𝑚) with 𝑚 ≥ 4 and 𝑑 = 3, including the [[15, 1, 3]] code as the special case 𝑚 = 4.
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. ...

Understanding the chaos of entropy in combinatorics

The Union-Closed Sets Conjecture (UCSC), posed by Peter Frankl in 1979, asserts that every finite union-closed family of sets contains an element that appears in at least half of its member sets. Despite this seemingly simple formulation, the conjecture has remained unresolved for decades. Recently in November 2022 Gilmer developed a novel approach based on the information theoretic concept: \emph{entropy}, which has offered fresh insights and promising partial results. In this thesis, we provide a self-contained introduction to entropy and explore its utility in combinatorics, specifically its application to the UCSC. We thoroughly examine the groundbreaking entropy-based proof that establishes a constant lower bound of \(\frac{3 - \sqrt{5}}{2}\approx0.382\). Additionally, we shortly discuss the small further improvements made to this bound. We then consider a related conjecture proposed by Nagel, which states: \textit{the \(k\)th most frequent element in a union-closed family appears in at least a fraction \(\frac{1}{2^{k-1} +1}\) of the sets.} We shall discuss how the new entropy approach could also be used there to improve the bounds on the sizes of the family.
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. ...

A way to map fermionic Hamiltonians onto qubit Hamiltonians while preserving locality and sparsity and minimizing the number of qubits

In order to perform simulations of fermionic systems on a quantum computer, there is an encoding needed which maps the fermionic Hamiltonian onto a qubit Hamiltonian. In this thesis, a fermionic encoding is constructed which is less constraining in terms of the required operations that realize this mapping compared to other known mappings.
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. ...

From Calibration to Logical Performance

Doctoral thesis (2025) - H.A.S. Ali, L. di Carlo, B.M. Terhal
Quantum computers hold great potential to solve complex physics and chemistry problems that are beyond the capabilities of classical computers. Unlike classical systems that use bits represented as deterministic 0s and 1s, quantum computers operate with quantum bits or qubits, which can exist in a superposition of states. In addition to superposition, quantum computers harness the power of entanglement and quantum interference that enable quantum computers to encode and process information in ways that classical systems fundamentally cannot. These properties allow quantum computers to explore vast solution spaces in parallel, solving certain computational problems far more efficiently than classical systems. This has numerous potential applications ranging from the factoring of large numbers, optimizing complex systems, computational chemistry, machine learning, cryptography, and artificial intelligence.

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…
...
Doctoral thesis (2025) - J.D. Koenig, G.A. Steele, B.M. Terhal
In this thesis observations on the application of parametric drives to superconducting quantum circuits in disparate parameter regimes are presented. By the nonlinear inductance of the Josephson junction, a variety of interactions in circuit quantum electrodynamical systems comprised of strongly, moderately, and weakly nonlinear oscillators are realized.

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.
...

Finding Interleaved Measurement Schedules

Bachelor thesis (2024) - J.Q. Broshuis, B.M. Terhal, L. di Carlo, M.F. Russ
Quantum computers hold the potential to revolutionize computation by harnessing the unique properties of qubits. However, qubits are highly susceptible to errors, posing a major challenge in building reliable quantum systems. To address this, the development of quantum error correction codes is essential. The surface code has become a well-known code, using a 2D square grid to encode qubits. However, its high qubit overhead may be improved by alternative codes with more efficient encoding schemes. This thesis focuses on the small stellated dodecahedron code, previously outperformed by the surface code, and proposes a new approach to optimize its performance by developing an algorithm that finds interleaved measurement schedules. The developed algorithm is tested on both the surface code and a code based on the Tetrahemi hexahedron, correctly providing interleaved schedules for both. Applying the algorithm to the small stellated dodecahedron reduces the number of time steps required from 10 to 6, significantly boosting error correction performance. Simulations under a depolarizing noise model confirm the fault tolerance of these new schedules and demonstrate a 2.6x improvement in the code’s pseudo-threshold compared to the original sequential schedule. While the surface code remains more effective at protecting against errors, performing 1.26 times better, the stellated dodecahedron code offers a compelling alternative for near-term research, requiring fewer qubits while maintaining strong performance. ...
Doctoral thesis (2023) - Y. Wang, B.M. Terhal, T.H. Taminiau
Solid-state defect centers, such as the nitrogen-vacancy centers in diamond, represent a promising and versatile platform for quantum technologies. This thesis focuses on overcoming the challenge of noise in diamond to facilitate its practical use in various quantum technology applications. ...
Master thesis (2023) - Z. Wang, B.M. Terhal
Surface codes have become a leading method for quantum error correction (QEC) and play a pivotal role in the realization of fault-tolerant quantum computing. However, while the execution of more quantum error correction cycles can potentially protect the quantum information for longer time, an excess can potentially slow down computation and increase errors in idling logical qubits. This dissertation addresses this challenge by focusing on the optimization of rounds of QEC cycles for two important scenarios: lattice surgery and moving logical qubits. Theoretical upper bounds for decoding failure are derived for these settings, providing insights into the required number of QEC cycles for successful decoding. Numerical experiments are conducted to support and validate these theoretical findings, emphasizing the necessity of additional QEC cycles to ensure reliable stabilizer measurement outcomes, particularly in lattice surgery and logical qubit movement. Furthermore, the research investigates the fault-tolerant and proper order of syndrome measurements within each QEC cycle for square surface codes. The order of these measurements is shown to have a significant impact on logical error rates. Additionally, methods for constructing detectors under code and stabilizer deformation are introduced, facilitating accurate tracking of error syndromes. ...

A Homological Approach to Quantum Low Density Parity Check Codes

In the past few years, the search for good quantum low density parity check (qLDPC) codes suddenly took flight, and many different constructions of these codes have since been presented, including many product constructions. As these code constructions have a natural interpretation in the language of homology, this thesis studies the interplay between homological algebra and various recent product constructions of qLDPC 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. ...
In this thesis, the repetition code for bit flip errors is examined. Based the stabilizer measurements outcome of a run of the repetition code, one does not know exactly which errors have occurred. Statistics can be used to estimate the probability of all possible error events. This probability estimation is investigated for simulated data assuming phenomenological and circuit level noise. Experiments on the repetition code are performed by the DiCarlo group at the Delft University of Technology on a superconducting quantum computer. For this data, some error probabilities are estimated to be nonphysical. The goal of this thesis is to investigate these nonphysical probabilities and to determine whether they result from sampling noise or a problem with the assumed error model that determines the estimation of the probabilities. By estimating the standard deviation using the bootstrap method it is shown that the nonphysical probabilities are not due to sampling noise. Therefore, it is possible that non-conventional errors, such as leakage or crosstalk, are affecting these estimates.

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 this work, we first analyse a theoretical technique based on entropic inequalities, which in principle can be used to compare classical and quantum algorithms running on noisy quantum devices. The technique has been used in the past for depolarizing noise, and has shown that for NISQ variational quantum algorithms (VQAs) to give an advantage over purely classical methods, it is essential that the structure of the problem is close to the quantum hardware the VQA is run on. Here, we use this technique for relaxation and pure dephasing noise and examine whether we can deduce the same results for the Quantum Approximate Optimization Algorithm (QAOA) running on a noisy quantum device. In the later part of the thesis, we study the properties of the steady state of the Lindblad Master Equation for a 1D array of transmon qubits coupled by cross-resonance type interactions for relaxation and pure dephasing noise. For n=2,3 number of qubits we solve exactly the master equation, while for a general number of n qubits we approximate the solution by using two different approaches, namely perturbation theory and mean-field theory. Finally, we assess how well those approximation methods compare to the exact solution for n=2,3 qubits. ...
In this research, the implementations of quantum random walks in superconducting circuit-QED are studied. In particular, a walk that moves across the Fock states of a quantum harmonic oscillator by a Jaynes-Cummings model is investigated, which is difficult to implement because of different Rabi frequencies for different Fock states. Theoretically, the lower boundary vacuum state of the harmonic oscillator causes a reflection of the probability amplitudes in the distribution. A walk that moves across a grid of coherent states |nα+imα〉 in phase space is then investigated. A setup for a 1D and 2D quantum random walk is suggested, using controlled displacements of a resonator dispersively coupled to one or two superconducting transmon qubits in circuit-QED, followed by Hadamard gates. From numerical simulations it was observed that the 2D walk commutes for α·β = 0 mod π/2 for which the variance is proportional to the number of steps t squared. For other values of α·β the horizontal and vertical displacements do not commute, resulting in extra phase factors. The numerical simulations showed that for most values of α· β with a larger distance to 0 mod π/2 than 0.01, the probability distribution of the
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. ...
Master thesis (2020) - Maarten Stroeks, B.M. Terhal
Quantum systems are in general not e_ciently simulatable by classical means. If one wishes to determine (some of) the eigenvalues of a Hamiltonian H that is associated with a quantum system, there are two favoured strategies: Quantum simulation and quantum Monte Carlo schemes. The former strategy uses an experimentally well-controllable quantum system that emulates the system of interest, in a digital (i.e. universal) or analog manner. The latter, albeit with a limited range of applicability, uses classical stochastic processes to e_ciently obtain (often low-lying) eigenvalues of H. Quantum Monte Carlo methods may su_er from a sign problem when simulating fermionic or frustrated bosonic systems. This yields, for a given accuracy, a simulation time that scales exponentially in the system size and the inverse temperature. ...
The concept of entanglement is one of the distinguishing features in quantum mechanics. Information about one particle can determine the state of another particle. This information and entanglement in subsystems is quantified by the entanglement entropy. The entanglement entropy has become an important research topic in recent years. Entanglement entropy is expected to grow with the boundary size for systems described by Hamiltonians with local interactions, described by the area law. For one dimension there exists a bound quantifying this area law S = O (21/ΔE) in terms of the energy gap ΔE between the ground-state energy and the first excited-state energy. It is an open problem whether the area law holds in higher spatial dimensions. Therefore it is of great interest to study the entanglement entropy in systems that violate the area law. In this thesis spin chain models with local interactions are studied for arbitrary spin. Hamiltonians with a unique ground state are constructed by mapping spin chains onto (coloured) Dyck and (coloured) Motzkin paths. We show that these models express logarithmic or power law violations of the area law for the bipartite entanglement entropy. These results are presented in the table below. The known bound of the area law in one dimensional systems is dependent on the energy gap of these models. The energy gap of the Motzkin-path model is investigated by constructing the an orthogonal excited state with small energy. In doing so we associate the Hamiltonian with the Laplacian of a graph. We present an alternative proof for the bound on the energy gap of the colourless Motzkin-path model than S. Bravyi et al and R. Movassagh et al. We show that the energy gap ΔE scales in terms of the chain length n as ΔE = O(n-2) in the limit n →∞. Therefore ΔE → 0 in this limit, resulting in area-law violations of the entanglement entropy while maintaining the known bound on the entanglement entropy. ...