Related papers: Dismagicker: Unitary Gate for Non-Stabilizerness R…
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
Feynman, in 1982, proposed the idea of using a quantum simulator to perform quantum simulations. A quantum simulator is basically a controllable quantum system that can mimic the dynamics of other quantum systems we wish to study. In this…
Magic State Distillation (MSD) has been a research focus for fault-tolerant quantum computing due to the need for non-Clifford resource in gaining quantum advantage. Although many of the MSD protocols so far are based on stabilizer codes…
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…
The density-matrix renormalization-group (DMRG) algorithm is extended to treat time-dependent problems. The method provides a systematic and robust tool to explore out-of-equilibrium phenomena in quantum many-body systems. We illustrate the…
The dynamics of many-body quantum states in open systems is commonly numerically simulated by unraveling the density matrix into pure-state trajectories. In this work, we introduce a new unraveling strategy that can adaptively minimize the…
Quantum magic, or non-stabilizerness, is an important quantum resource that characterizes computational power beyond classically simulable Clifford operations and is therefore essential for achieving quantum advantage. While previous…
Quantum Fourier analysis is an important topic in mathematical physics. We introduce a systematic protocol for testing and measuring ``magic'' in quantum states and gates, using a quantum Fourier approach. Magic, as a quantum resource, is…
Quantum computing's promise lies in its intrinsic complexity, with entanglement initially heralded as its hallmark. However, the quest for quantum advantage extends beyond entanglement, encompassing the realm of nonstabilizer (magic)…
The spontaneous disentanglement hypothesis is motivated by some outstanding issues in standard quantum mechanics, including the problem of quantum measurement. The current study compares between some possible methods that can be used to…
Stabilizer circuits arise in almost every area of quantum computation and communication, so there is interest in studying them from an information-theoretic perspective, i.e. as quantum channels. We consider several natural approaches to…
Disorder-free quantum many-body localization can strongly suppress transport while still enabling the dynamical buildup of computationally costly non-Clifford resources. In a tilted transverse-field Ising chain realizing disorder-free Stark…
Recent advances in classical simulation of Clifford+T circuits make use of the ZX calculus to iteratively decompose and simplify magic states into stabiliser terms. We improve on this method by studying stabiliser decompositions of ZX…
Quantum information scrambling is a unitary process that destroys local correlations and spreads information throughout the system, effectively hiding it in nonlocal degrees of freedom. In principle, unscrambling this information is…
Nonstabilizerness, or `magic', is a critical quantum resource that, together with entanglement, characterizes the non-classical complexity of quantum states. Here, we address the problem of quantifying the average nonstabilizerness of…
Magic state distillation (MSD) is a quantum algorithm that enables performing logical non-Clifford gates with in principle arbitrarily low noise level. It is herein typically assumed that logical Clifford gates can be executed without…
Quantum error correction is the art of protecting fragile quantum information through suitable encoding and active interventions. After encoding $k$ logical qubits into $n>k$ physical qubits using a stabilizer code, this amounts to…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
In this work we improve the runtime of recent classical algorithms for strong simulation of quantum circuits composed of Clifford and T gates. The improvement is obtained by establishing a new upper bound on the stabilizer rank of $m$…
A cluster state is a strongly entangled state, which is a source of measurement-based quantum computation. It is generated by applying controlled-Z (CZ) gates to the state $\left\vert ++\cdots +\right\rangle $. It is protected by the…