Related papers: Denotational semantics for stabiliser quantum prog…
We propose quaternion-based strategies for quantum error correction by extending quantum mechanics into quaternionic Hilbert spaces. Building on the properties of quaternionic quantum states, we define quaternionic analogues of Pauli…
There is a connection between classical codes, highly entangled pure states (called k-uniform or absolutely maximally entangled (AME) states), and quantum error correcting codes (QECCs). This leads to a systematic method to construct…
Stabilizer codes lie at the heart of modern quantum-error-correcting codes (QECC). Of particular importance is a class called Calderbank-Shor-Steane (CSS) codes, which includes many important examples such as toric codes, color codes, and…
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of…
Classical coding theory contains several techniques to obtain new codes from other codes, including puncturing and shortening. For quantum codes, a form of puncturing is known, but its description is based on the code space rather than its…
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…
Fault-tolerant quantum computation with depolarization error often requires demanding error threshold and resource overhead. If the operations can maintain high noise bias -- dominated by dephasing error with small bit-flip error -- we can…
We generalize the stabilizer formalism for entanglement-assisted quantum error-correcting codes with noisy ebits (EAQECCs-Ne) from the binary case to the general $q$-ary case, where $q$ is a prime power. By leveraging the structure of the…
In David Schmidt's PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators.…
What provides the highest level of assurance for correctness of execution within a programming language? One answer, and our solution in particular, to this problem is to provide a formalization for, if it exists, the denotational semantics…
We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace…
We consider the explicit construction of resource states for measurement-based quantum information processing. We concentrate on special-purpose resource states that are capable to perform a certain operation or task, where we consider…
We introduce new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and $0D$ defects of Abelian composite-dimensional twisted quantum doubles. Using the physically intuitive concept of…
We generalize the polynomial-time outcome-complete simulation algorithm for stabilizer circuits in arXiv:2309.08676 to track global phases exactly, yielding what we call phased outcome-complete simulation. The original algorithm enabled…
Quantum error correction is a set of methods to protect quantum information--that is, quantum states--from unwanted environmental interactions (decoherence) and other forms of noise. The information is stored in a quantum error-correcting…
Motivated by some well-known results in the phase space description of quantum optics and quantum information theory, we aim to describe the formalism of quantum field theory by explicitly considering the holomorphic representation for a…
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.…
We introduce Qunity, a new quantum programming language designed to treat quantum computing as a natural generalization of classical computing. Qunity presents a unified syntax where familiar programming constructs can have both quantum and…
We introduce a novel quantum programming language featuring higher-order programs and quantum controlflow which ensures that all qubit transformations are unitary. Our language boasts a type system guaranteeingboth unitarity and…
Stabilizer simulation of Clifford quantum circuits - error-correction circuits, Clifford subroutines, etc. - on classical computers has played a central role in our understanding of circuit performance. The stabilizer description, however,…