English
Related papers

Related papers: Signed quantum weight enumerators characterize qub…

200 papers

Despite the central importance of quantum entanglement in quantum technologies, the understanding of the optimal ways to exploit it is still beyond our reach, and even measuring entanglement in an operationally meaningful way is…

Quantum Physics · Physics 2026-04-03 Ludovico Lami , Mario Berta , Bartosz Regula

In leading fault-tolerant quantum computing schemes, accurate transformation are obtained by a two-stage process. In a first stage, a discrete, universal set of fault-tolerant operations is obtained by error-correcting noisy transformations…

Quantum Physics · Physics 2015-04-22 Guillaume Duclos-Cianci , David Poulin

The outcomes of quantum mechanical experiments are inherently random. It is therefore necessary to develop stringent methods for quantifying the degree of statistical uncertainty about the results of quantum experiments. For the…

Quantum Physics · Physics 2017-10-11 Daniel Suess , Łukasz Rudnicki , Thiago O. Maciel , David Gross

Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of universal quantum…

Quantum Physics · Physics 2026-04-29 Nicholas J. C. Papadopoulos , Ramin Ayanzadeh

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…

Quantum Physics · Physics 2022-09-20 Akihiro Mizutani , Yuki Takeuchi , Ryo Hiromasa , Yusuke Aikawa , Seiichiro Tani

Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli…

Quantum Physics · Physics 2018-06-13 Yuki Takeuchi , Tomoyuki Morimae

Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum…

Quantum Physics · Physics 2015-11-06 Kentaro Honda

Non-stabilizerness or magic resource characterizes the amount of non-Clifford operations needed to prepare quantum states. It is a crucial resource for quantum computing and a necessary condition for quantum advantage. However, quantifying…

Quantum Physics · Physics 2023-01-31 Tobias Haug , M. S. Kim

Precisely engineered mechanical oscillators keep time, filter signals, and sense motion, making them an indispensable part of today's technological landscape. These unique capabilities motivate bringing mechanical devices into the quantum…

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)…

Quantum Physics · Physics 2024-03-05 Antonio Francesco Mello , Guglielmo Lami , Mario Collura

Monotone operator equilibrium networks are implicit-layer models whose output is the unique equilibrium of a monotone operator, guaranteeing existence, uniqueness, and convergence. When deployed on low-precision hardware, weights are…

Optimization and Control · Mathematics 2026-03-12 James Li , Philip H. W. Leong , Thomas Chaffey

Nonstabilizerness or `magic' is a crucial resource for quantum computers which can be distilled from noisy quantum states. However, determining the magic of mixed quantum has been a notoriously difficult task. Here, we provide efficient…

Quantum Physics · Physics 2026-04-16 Tobias Haug , Poetri Sonya Tarabunga

With the advent of physical qubits exhibiting strong noise bias, it becomes increasingly relevant to identify which quantum gates can be efficiently implemented on error-correcting codes designed to address a single dominant error type.…

Quantum Physics · Physics 2025-07-09 Victor Barizien , Hugo Jacinto , Nicolas Sangouard

We show that measuring pairs of qubits in the Bell basis can be used to obtain a simple quantum algorithm for efficiently identifying an unknown stabilizer state of n qubits. The algorithm uses O(n) copies of the input state and fails with…

Quantum Physics · Physics 2017-07-27 Ashley Montanaro

Typical stabilizer codes aim to solve the general problem of fault-tolerance without regard for the structure of a specific system. By incorporating a broader representation-theoretic perspective, we provide a generalized framework that…

Quantum Physics · Physics 2026-03-30 Zachary P. Bradshaw , Margarite L. LaBorde , Dillon Montero

Erasure qubits constitute a promising approach for tackling the daunting resources required for fault-tolerant quantum computing. By heralding erasure errors, both the error-correction threshold and the sub-threshold scaling of the logical…

Quantum Physics · Physics 2026-01-16 Shoham Jacoby , Yotam Vaknin , Alex Retzker , Arne L. Grimsmo

In many architectures for fault tolerant quantum computing universality is achieved by a combination of Clifford group unitary operators and preparation of suitable nonstabilizer states, the so-called magic states. Universality is possible…

Quantum Physics · Physics 2011-06-28 Earl T. Campbell

Quantum state tomography, the ability to deduce the state of a quantum system from measured data, is the gold standard for verification and benchmarking of quantum devices. It has been realized in systems with few components, but for larger…

We present an algorithm for manipulating quantum information via a sequence of projective measurements. We frame this manipulation in the language of stabilizer codes: a quantum computation approach in which errors are prevented and…

Quantum Physics · Physics 2018-09-26 Kristina R. Colladay , Erich J. Mueller

The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…