Related papers: Certifying nonstabilizerness in quantum processors
Non-classical probability (along with its underlying logic) is a defining feature of quantum mechanics. A formulation that incorporates them, inherently and directly, would promise a unified description of seemingly different prescriptions…
Nonstabilizerness is a quantum property of states associated with the non-Clifford resources required for their preparation. As a resource, nonstabilizerness complements entanglement, and the interplay between these two concepts has…
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…
Non-stabilizerness is a fundamental resource for quantum computational advantage, differentiating classically simulable circuits from those capable of universal quantum computation. Recently, non-stabilizerness has been shown to be relevant…
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…
Although the similarity between non-stabilizer states -- also known as magic states -- in discrete-variable systems and non-Gaussian states in continuous-variable systems has widely been recognized, the precise connections between these two…
Realizing universal fault-tolerant quantum computation is a key goal in quantum information science. By encoding quantum information into logical qubits utilizing quantum error correcting codes, physical errors can be detected and…
Quantum computing's potential is immense, promising super-polynomial reductions in execution time, energy use, and memory requirements compared to classical computers. This technology has the power to revolutionize scientific applications…
We propose a quantum-state-certification protocol for stabilizer states, motivated by application in in-situ testing of NISQ-era quantum computer systems: The number of qubits is bounded, and in terms of cost of running the protocol,…
A major signature of quantum mechanics beyond classical physics is coherence, the existence of superposition states. The recently developed resource theory of quantum coherence allows the formalisation of incoherent operations -- those…
A proof of quantumness is a protocol through which a classical machine can test whether a purportedly quantum device, with comparable time and memory resources, is performing a computation that is impossible for classical computers.…
Quantum computation has made considerable progress in the last decade with multiple emerging technologies providing proof-of-principle experimental demonstrations of such calculations. However, these experimental demonstrations of quantum…
The notion of symmetry is shown to be at the heart of all error correction/avoidance strategies for preserving quantum coherence of an open quantum system S e.g., a quantum computer. The existence of a non-trivial group of symmetries of the…
Physical processes in the quantum regime possess non-classical properties of quantum mechanics. However, methods for quantitatively identifying such processes are still lacking. Accordingly, in this study, we develop a framework for…
Current experiments are taking the first steps toward noise-resilient logical qubits. Crucially, a quantum computer must not merely store information, but also process it. A fault-tolerant computational procedure ensures that errors do not…
In practical quantum networks, a variety of multi-qubit stabilized states emitted from independent sources are distributed among the agents, and the correlations across the entire network can be derived from each agent's local measurements…
Randomness is a key feature of quantum physics. Heisenberg's uncertainty principle reveals the existence of an intrinsic noise, usually explored through Gaussian squeezed states. Due to their insufficiency for quantum advantage, the focus…
Large-scale quantum computation is likely to require massive quantum error correction (QEC). QEC codes and circuits are described via the stabilizer formalism, which represents stabilizer states by keeping track of the operators that…
We study the properties of eigenstates of an operating quantum computer which simulates the dynamical evolution in the regime of quantum chaos. Even if the quantum algorithm is polynomial in number of qubits $n_q$, it is shown that the…
Gate-model quantum computers can allow quantum computations in near-term implementations. The stabilization of an optimal quantum state of a quantum computer is a challenge, since it requires stable quantum evolutions via a precise…