相关论文: Pauli web of the $|Y\rangle$ state surface code in…
Originally motivated by the (fold-)transversal related initialisation of logical surface code $|Y\rangle$ states from [arXiv:1603.02286, arXiv:2302.07395, arXiv:2302.12292], which was then explicitly extended to the fold-transversal $S$…
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 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,…
Surface codes are versatile quantum error-correcting codes known for their planar geometry, making them ideal for practical implementations. While the original proposal used Pauli $X$ or Pauli $Z$ operators in a square structure, these…
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…
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…
We present an abstract model of quantum computation, the "Pauli Fusion" model, whose primitive operations correspond closely to generators of the ZX calculus (a formal graphical language for quantum computing). The fundamental operations of…
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…
Pauli-Blocking effect on the kinetic term is investigated by employing the quark cluster model. The effect can be understood by the change of the degrees of the mixing between the incoming wave and the 0$\ell$ state of the inter-cluster…
We consider the efficiency of classically simulating measurement-based quantum computation on surface-code states. We devise a method for calculating the elements of the probability distribution for the classical output of the quantum…
Our ability to numerically model and understand the complex flow behavior of solid-bearing suspensions has increased significantly over the last couple of years, partly due to direct numerical simulations that compute flow around individual…
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…
In an electromagnetic code, a wave can be injected in the simulation domain by prescribing an oscillating field profile at the domain boundary. The process is straightforward when the field profile has a known analytical expression…
The surface code is a promising candidate for fault-tolerant quantum computation and has been implemented in many quantum hardware platforms. In this work, we propose a new non-local unitary circuit to encode a surface code state based on a…
Quantum computations are easily represented in the graphical notation known as the ZX-calculus, a.k.a. the red-green calculus. We demonstrate its use in reasoning about measurement-based quantum computing, where the graphical syntax…
Fault-tolerant Z rotations by pi/2^k are important as they arise in numerous quantum algorithms, most notably those involving quantum Fourier transforms. We describe surface code implementations of two recently described methods of…
We derive the Pauli equation for a charged spin particle confined to move on a spatially curved surface $\mathcal{S}$ in an electromagnetic field. Using the thin-layer quantization scheme to constrain the particle on $\mathcal{S}$, and in…
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…
The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas such as quantum circuit optimisation, surface codes and lattice surgery, measurement-based…
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,…