A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations to a universal set by the addition of "magic" quantum states. In this context, we develop a general framework to discuss the value of the available, nonideal magic resources, relative to those ideally required. We single out a quantity, the quantum-assisted robustness of magic (QROM), which measures the overhead of simulating the ideal resource with the nonideal ones through quasiprobability-based methods. This extends error mitigation techniques, originally developed for noisy intermediate-scale quantum devices, to the case where qubits are logically encoded. The QROM shows how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit and enables the construction of explicit protocols, interpolating between classical simulation and an ideal quantum computer.
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations to a universal set by the addition of "magic" quantum states. In this context, we develop a general framework to discuss the value of the available, nonideal magic resources, relative to those ideally required. We single out a quantity, the quantum-assisted robustness of magic (QROM), which measures the overhead of simulating the ideal resource with the nonideal ones through quasiprobability-based methods. This extends error mitigation techniques, originally developed for noisy intermediate-scale quantum devices, to the case where qubits are logically encoded. The QROM shows how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit and enables the construction of explicit protocols, interpolating between classical simulation and an ideal quantum computer.
Quantum computing is entering a transitional regime between noisy intermediate-scale quantum (NISQ) processing and early fault-tolerant quantum computation (FTQC), in which increasingly capable hardware is beginning to support repeated syndrome measurements, partial error correction, and logical-qubit operations, while residual physical and logical errors remain non-negligible. In this regime, error suppression, error mitigation, and quantum error correction are increasingly better viewed as complementary layers of a unified error-reduction strategy rather than as separate approaches, with each acting at a different stage of the quantum computation to improve simulation reliability. Thus, in this review, we provide a practical and forward-looking overview of the principal hardware error sources and the corresponding error suppression and mitigation methods for reducing their impact across the current NISQ-FTQC transition. We discuss hardware-aware circuit design, coherent-error suppression, readout mitigation, noise extrapolation, classical inference, and software-supported workflows, with particular emphasis on their implementation on actual quantum processors. We further examine how error mitigation techniques can be adapted to encoded and logical-qubit settings so that they can operate alongside quantum error correction to suppress residual logical errors and improve the accuracy of computation in the early fault-tolerant regime.
Quantum error mitigation (QEM) is typically viewed as a suite of practical techniques for today's noisy intermediate-scale quantum devices, with limited relevance once fault-tolerant quantum computers become available. In this work, we challenge this conventional wisdom by showing that QEM can continue to provide substantial benefits in the era of quantum error correction (QEC), and in an even more efficient manner than it does on current devices. We introduce a framework for logical-level QEM that leverages soft information naturally produced by QEC decoders, requiring no additional data, hardware modifications, or runtime overhead beyond what QEC protocols already provide. Within this framework, we develop and analyze three logical-level QEM techniques: post-selection and runtime abort policies, probabilistic error cancellation, and zero-noise extrapolation. Our techniques reduce logical error rates by more than 100x while discarding fewer than 0.1% of shots; they also provide in situ characterization of logical channels for QEM protocols. As a proof of principle, we benchmark our approach using a surface-code architecture and two state-of-the-art decoders based on tensor-network contraction and minimum-weight perfect matching. We evaluate logical-level QEM on random Clifford circuits and molecular simulation algorithms and find that, compared to previous approaches relying on QEC only or QEC combined with QEM, we can achieve up to 87.4% spacetime overhead savings. Our results demonstrate that logical-level QEM with QEC decoder soft information can reliably improve logical performance, underscoring the efficiency and usefulness of QEM techniques for fault-tolerant quantum computers.
Current quantum computers are plagued by prohibitive amounts of noise, which complicates the experimental realization of useful quantum algorithms that outperform classical computers.Quantum error mitigation techniques could constitute a potential avenue to demonstrate this feat without the need for fault-tolerant quantum error correction.One method in this family of mitigation techniques is the quasiprobability method introduced by Temme et al. [1].It simulates a noise-free quantum computer with a noisy one, with the caveat of only producing the correct expected values of measurement observables.The cost of a quasiprobability simulation manifests as a sampling overhead which scales exponentially in the number of error-mitigated gates in the circuit.In this thesis we aim to reduce the exponential basis of that overhead, which in turn allows the application of the quasiprobability method to deeper quantum circuits.A central result is the introduction of a novel scheme, which we call Stinespring algorithm, that aims to choose the quasiprobability decomposition in a noise-aware manner.Along the way, we introduce a generalization of the quasiprobability method, which we denote approximate quasiprobability method, that allows for a tradeoff between an approximation error and the sampling overhead.This method is already interesting on its own and we present a few potential applications.Finally, we present some ideas how quantum error correction can benefit from the quasiprobability method.This final part is separate to the other topics of the master thesis and gives a rough overview of a new research project that started towards the end of the thesis and that we will continue to pursue in the future.i Overview of ContributionsWe summarize the novel contributions from this thesis:• Many details in the presentation of Chapter 2 have not been stated in such precision in previous literature.However, we estimate that many of these contributions are evident for someone knowledgeable in the domain.• The channel difference decomposition (Section 2.6).• The approximate QPD and its applications (Chapter 3).• The Stinespring algorithm (Chapter 4).
Magic states are essential for universal quantum computation and are widely viewed as a key source of quantum advantage, yet in realistic devices they are inevitably noisy. In this work, we characterize how noise on injected magic resources changes the classical simulability of quantum circuits and when it induces a transition from classically intractable behavior to efficient classical simulation. We adopt a resource-centric noise model in which only the injected magic components are noisy, while the baseline states, operations, and measurements belong to an efficiently simulable family. Within this setting, we develop an approximate classical sampling algorithm with controlled error and prove explicit noise-dependent conditions under which the algorithm runs in polynomial time. Our framework applies to both qubit circuits with Clifford baselines and fermionic circuits with matchgate baselines, covering representative noise channels such as dephasing and particle loss. We complement the analysis with numerical estimates of the simulation cost, providing concrete thresholds and runtime scaling across practically relevant parameter regimes.
The development of a framework for quantifying ‘non-stabilizerness’ of quantum operations is motivated by the magic state model of fault-tolerant quantum computation and by the need to estimate classical simulation cost for noisy intermediate-scale quantum (NISQ) devices. The robustness of magic was recently proposed as a well-behaved magic monotone for multi-qubit states and quantifies the simulation overhead of circuits composed of Clifford + T gates, or circuits using other gates from the Clifford hierarchy. Here we present a general theory of the ‘non-stabilizerness’ of quantum operations rather than states, which are useful for classical simulation of more general circuits. We introduce two magic monotones, called channel robustness and magic capacity, which are well-defined for general n -qubit channels and treat all stabilizer-preserving CPTP maps as free operations. We present two complementary Monte Carlo-type classical simulation algorithms with sample complexity given by these quantities and provide examples of channels where the complexity of our algorithms is exponentially better than previously known simulators. We present additional techniques that ease the difficulty of calculating our monotones for special classes of channels.
Quantum computing has enormous potential, but this can only be realised if quantum errors can be controlled sufficiently to allow quantum algorithms to be completed reliably. However, quantum-error-corrected logical quantum bits (qubits) which can be said to have achieved meaningful error suppression have not yet been demonstrated. This thesis reports research on several topics related to the challenge of designing fault-tolerant quantum computers. The first topic is a proposal for achieving large-scale error correction with the surface code in a silicon donor based quantum computing architecture. This proposal relaxes some of the stringent requirements in donor placement precision set by previous ideas from the single atom level to the order of 10 nm in some regimes. This is shown by means of numerical simulation of the surface code threshold. The second topic then follows, it is the development of a method for benchmarking and assessing the performance of small error correcting codes in few-qubit systems, introducing a metric called 'integrity' - closely linked to the trace distance -- and a proposal for experiments to demonstrate various stepping stones on the way to 'strictly superior' quantum error correction. Most quantum error correcting codes, including the surface code, do not allow for fault-tolerant universal computation without the addition of extra gadgets. One method of achieving universality is through a process of distilling and then consuming high quality 'magic states'. This process adds additional overhead to quantum computation over and above that incurred by the use of the base level quantum error correction. The latter parts of this thesis report an investigation into how many physical qubits are needed in a `magic state factory' within a surface code quantum computer and introduce a number of techniques to reduce the overhead of leading magic state techniques. It is found that universal quantum computing is achievable with ∼ 16 million qubits if error rates across a device are kept below 10-4. In addition, the thesis introduces improved methods of achieving magic state distillation for unconventional magic states that allow for logical small angle rotations, and show that this can be more efficient than synthesising these operations from the gates provided by traditional magic states.