相关论文: Pauli webs spun by transversal $|Y\rangle$ state i…

We employ ZX-calculus and Pauli web to understand the $|Y\rangle$ state injection on the rotated surface code.

We introduce graph state basis diagonalization to calculate the coherent information of a quantum code passing through a Pauli channel. The scheme is 5000 times faster than the best known one for some concatenated repetition codes,…

Transversal Pauli $Z$ rotations provide a natural route to fault-tolerant logical diagonal gates in quantum CSS codes, but their capability is inherently constrained. We develop a homological framework that organizes transversal diagonal…

Quantum error correction represents a significant milestone in large-scale quantum computing, with the surface code being a prominent strategy due to its high error threshold and experimental feasibility. However, it is challenging to…

We introduce a general framework for weak transversal gates -- probabilistic implementation of logical unitaries realized by local physical unitaries -- and propose a novel partially fault-tolerant quantum computing architecture that…

Graphical calculi for representing interacting quantum systems serve a number of purposes: compositionally, intuitive graphical reasoning, and a logical underpinning for automation. The power of these calculi stems from the fact that they…

In fault-tolerant quantum computation, the preparation of logical states is a ubiquitous subroutine, yet significant challenges persist even for the simplest states required. In the present work, we present a unitary, scalable,…

The development of quantum computing systems for large scale algorithms requires targeted error rates unachievable through hardware advancements alone. Quantum Error Correction (QEC) allows us to use systems with a large number of physical…

Petri nets are a well-known model of concurrency and provide an ideal setting for the study of fundamental aspects in concurrent systems. Despite their simplicity, they still lack a satisfactory causally reversible semantics. We develop…

Storing quantum information in a quantum error correction code can protect it from errors, but the ability to transform the stored quantum information in a fault tolerant way is equally important. Logical Pauli group operators can be…

We propose a new quantum computing formalism named Pauli quantum computing. In this formalism, we use the Pauli basis $I$ and $X$ on the non-diagonal blocks of density matrices to encode information and treat them as the computational basis…

We consider realistic, multi-parameter error models and investigate the performance of the surface code for three possible fault-tolerant superconducting quantum computer architectures. We map amplitude and phase damping to a diagonal Pauli…

A quantum error correcting code protects encoded logical information against errors. Transversal gates are a naturally fault-tolerant way to manipulate logical qubits but cannot be universal themselves. Protocols such as magic state…

The challenge of quantum computing is to combine error resilience with universal computation. Diagonal gates such as the transversal $T$ gate play an important role in implementing a universal set of quantum operations. This paper…

We propose an extension to the Pauli stabiliser formalism that includes fractional $2\pi/N$ rotations around the $Z$ axis for some integer $N$. The resulting generalised stabiliser formalism - denoted the XP stabiliser formalism - allows…

We present a solid-state implementation of ultrafast conditional quantum gates. Our proposal for a quantum-computing device is based on the spin degrees of freedom of electrons confined in semiconductor quantum dots, thus benefiting from…

We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…

We re-visit the pentagon holographic quantum error correcting code from a ZX-calculus perspective. By expressing the underlying tensors as ZX-diagrams, we study the stabiliser structure of the code via Pauli webs. In addition, we obtain a…

We realize a suite of logical operations on a distance-two logical qubit stabilized using repeated error detection cycles. Logical operations include initialization into arbitrary states, measurement in the cardinal bases of the Bloch…

The topology of entanglement in multipartite states with translational invariance is discussed in this article. Two global features are foundby which one can distinguish distinct states. These are the cyclic unit and the quantised geometric…