Related papers: Dismagicker: Unitary Gate for Non-Stabilizerness R…
Magic state distillation (MSD) is a purification protocol that plays a central role in fault tolerant quantum computation. Repeated iteration of the steps of a MSD protocol, generates pure single non-stabilizer states, or magic states, from…
Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the…
Recently, there has been an emergence of useful applications for noisy intermediate-scale quantum (NISQ) devices notably, though not exclusively, in the fields of quantum machine learning and variational quantum algorithms. In such…
Magic state distillation is a critical component in leading proposals for fault-tolerant quantum computation. Relatively little is known, however, about how to construct a magic state distillation routine or, more specifically, which…
Many quantum algorithms, to compute some property of a unitary $U$, require access not just to $U$, but to $cU$, the unitary with a control qubit. We show that having access to $cU$ does not help for a large class of quantum problems. For a…
Building upon [arXiv:2509.01224], we present a few methods on how to simulate the non-Clifford $d=5$ magic state cultivation circuits [arXiv:2409.17595] with a sum of $\approx 8$ Clifford ZX-diagrams on average, at $0.1\%$ noise. Compared…
In this paper, we investigate the relationship between entanglement and non-stabilizerness (also known as magic) in matrix product states (MPSs). We study the relation between magic and the bond dimension used to approximate the ground…
Matchgates and Clifford circuits are two types of quantum circuits which can be efficiently simulated classically, though the underlying reasons are quite different. Matchgates are essentially the single particle basis transformations in…
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…
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…
We propose a systematic and explicit method for the inverse engineering of the dynamics of an open quantum systems with no auxiliary Hamiltonian nor the prerequisite of adiabatic passage. In particular, we exploit the Lindblad dissipators…
Toward an improved understanding of the role of quantum information in nuclei and exotic matter, we examine the quantum magic (non-stabilizerness) in low-energy strong interaction processes. As stabilizer states can be prepared efficiently…
Irreversible logic is at odds with unitary quantum evolution. Emulating such operations by classical measurements can result in disturbances and high resource demands. To overcome these limitations, we propose protocols that harness…
We introduce a hybrid quantum-classical framework for efficiently implementing approximate unitary dilations of non-unitary operators with enhanced noise resilience. The method embeds a target non-unitary operator into a subblock of a…
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit…
It has been recently realized that dissipative processes can be harnessed and exploited to the end of coherent quantum control and information processing. In this spirit we consider strongly dissipative quantum systems admitting a…
We give a pair of algorithms that efficiently learn a quantum state prepared by Clifford gates and $O(\log n)$ non-Clifford gates. Specifically, for an $n$-qubit state $|\psi\rangle$ prepared with at most $t$ non-Clifford gates, our…
Many-body quantum dynamics defined on a spatial lattice and in discrete time -- either as stroboscopic Floquet systems or quantum circuits -- has been an active area of research for several years. Being discrete in space and time, a natural…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
Density Matrix Renormalization Group (DMRG) algorithm has been extremely successful for computing the ground states of one-dimensional quantum many-body systems. For problems concerned with mixed quantum states, however, it is less…