Related papers: Long-range nonstabilizerness and quantum codes, ph…
We develop classical simulation algorithms for adaptive quantum circuits that produce states with low levels of ``magic'' (i.e., non-stabilizerness). These algorithms are particularly well-suited to circuits with high rates of Pauli…
We apply the ideas of effective field theory to nonrelativistic quantum mechanics. Utilizing an artificial boundary of ignorance as a calculational tool, we develop the effective theory using boundary conditions to encode short-ranged…
Universal quantum computing requires nonstabilizer (magic) quantum states. Quantifying the nonstabilizerness and relating it to other quantum resources is vital for characterizing the complexity of quantum many-body systems. In this work,…
Robust open-loop steering of a finite-dimensional quantum system is a central problem in a growing number of applications of information engineering. In the present paper, we reformulate the problem in the classical control-theoretic…
Unraveling the secrets of how much nonstabilizerness a quantum dynamic can generate is crucial for harnessing the power of magic states, the essential resources for achieving quantum advantage and realizing fault-tolerant quantum…
Long-range entangled states are vital for quantum information processing and quantum metrology. Preparing such states by combining measurements with unitary gates opened new possibilities for efficient protocols with finite-depth quantum…
While quantum computers are expected to yield considerable advantages over classical devices, the precise features of quantum theory enabling these advantages remain unclear. Contextuality--the denial of a notion of classical physical…
Magic (non-stabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-tolerant quantum computation. To properly study and characterize the origin of quantum "complexity" in computation as well as physics, it is…
Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associated with error correction. We present a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check…
Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation…
In this work, we study the learnability of quantum circuits in the near term. We demonstrate the natural robustness of quantum statistical queries for learning quantum processes, motivating their use as a theoretical tool for near-term…
Quantum error correcting codes protect quantum computation from errors caused by decoherence and other noise. Here we study the problem of designing logical operations for quantum error correcting codes. We present an automated procedure…
Quantum error-correcting codes are essential to the implementation of fault-tolerant quantum computation. Homological products of classical codes offer a versatile framework for constructing quantum error-correcting codes with desirable…
The importance of quantum error correction in paving the way to build a practical quantum computer is no longer in doubt. This dissertation makes a threefold contribution to the mathematical theory of quantum error-correcting codes.…
By constructing the quantum state in high-dimensional probability tensor, we find the quantum magic square(QMS) may stand as an ideal means of characterizing the non-local phenomena, i.e. the separability, entanglement, two/one-way…
Magic-state distillation (or non-stabilizer state manipulation) is a crucial component in the leading approaches to realizing scalable, fault-tolerant, and universal quantum computation. Related to non-stabilizer state manipulation is the…
In quantum computing, non-stabilizerness -- the magic -- refers to the computational advantage of certain quantum states over classical computers and is an essential ingredient for universal quantum computation. Employing the second order…
Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for…
Non-stabilizerness (colloquially "magic") characterizes genuinely quantum (beyond-Clifford) operations necessary for preparation of quantum states, and can be measured by stabilizer R\'enyi entropy (SRE). For permutationally symmetric…
Magic states are a foundational resource for universal quantum computation. To survive in a realistic noisy environment, magic states must be prepared fault-tolerantly and protected by a quantum error-correcting code. The recent discovery…