相关论文: All pure fermionic non-Gaussian states are magic s…
We introduce the magic hierarchy, a quantum circuit model that alternates between arbitrary-sized Clifford circuits and constant-depth circuits with two-qubit gates ($\textsf{QNC}^0$). This model unifies existing circuit models, such as…
Matchgates are a restricted set of two-qubit gates known to be classically simulable under particular conditions. Specifically, if a circuit consists only of nearest-neighbour matchgates, an efficient classical simulation is possible if…
Matchgates are a group of two-qubit gates associated with free fermions. They are classically simulatable if restricted to act between nearest neighbors on a one-dimensional chain, but become universal for quantum computation with…
Notions of nonstabilizerness, or "magic", quantify how non-classical quantum states are in a precise sense: states exhibiting low nonstabilizerness preclude quantum advantage. We introduce 'pseudomagic' ensembles of quantum states that,…
The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum…
"Classical shadows" are estimators of an unknown quantum state, constructed from suitably distributed random measurements on copies of that state [Nature Physics 16, 1050-1057]. Here, we analyze classical shadows obtained using random…
Entanglement and magic are fundamental resources that capture the complexity of quantum many-body systems. Non-local magic isolates the irreducible nonstabilizerness intrinsically tied to entanglement. However, evaluating this quantity…
Let $H$ be a non trivial subgroup of index $d$ of a free group $G$ and $N$ the normal closure of $H$ in $G$. The coset organization in a subgroup $H$ of $G$ provides a group $P$ of permutation gates whose common eigenstates are either…
In fault-tolerant quantum computing with the surface code, non-Clifford gates are crucial for universal computation. However, implementing these gates using methods like magic state distillation and code switching requires significant…
The role of permutation gates for universal quantum computing is investigated. The \lq magic' of computation is clarified in the permutation gates, their eigenstates, the Wootters discrete Wigner function and state-dependent contextuality…
We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for fermionic linear optics with non-Gaussian…
In the seminal paper [Metger and Vidick, Quantum '21], they proposed a computational self-testing protocol for Bell states in a single quantum device. Their protocol relies on the fact that the target states are stabilizer states, and hence…
Topological quantum computation by way of braiding of Majorana fermions is not universal quantum computation. There are several attempts to make universal quantum computation by introducing some additional quantum gates or quantum states.…
Universal quantum computation using photonic systems requires gates whose Hamiltonians are of order greater than quadratic in the quadrature operators. We first review previous proposals to implement such gates, where specific non-Gaussian…
Imaginary time evolution is a powerful technique for computing the ground state of quantum Hamiltonians, where the convergence to ground state in asymptotic imaginary time is guaranteed. However, implementing this method on quantum…
Learning an unknown quantum process is a central task for validation of the functioning of near-term devices. The task is generally hard, requiring exponentially many measurements if no prior assumptions are made on the process. However, an…
Magic, also known as nonstabilizerness, quantifies the distance of a quantum state to the set of stabilizer states, and it serves as a necessary resource for potential quantum advantage over classical computing. In this work, we study magic…
Universal quantum computers require entanglement and non-stabilizerness, a resource known as \textit{quantum magic}. Here, we introduce a protocol that prepares magic steady states by leveraging non-Hermitian dynamics, which, contrary to…
Quantum theory promises computational speed-ups over classical approaches. The celebrated Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of "magic" states -- the secret sauce to…
Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers. A critical question for MBQC is the identification of resource graph states that can enable universal quantum computation. Any such…