相关论文: A non-anyonic qudit ZW-calculus

We introduce surface ZZZY codes, a novel family of quantum error-correcting codes designed for asymmetric channels. Derived from standard surface codes through tailored modification of generators, ZZZY codes can be decoded by the minimum…

In this article, we present an introduction to quantum computing (QC) tailored for computing professionals such as programmers, machine learning engineers, and data scientists. Our approach abstracts away the physics underlying QC, which…

We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a…

This is the second in a series of "graphical grokking" papers in which we study how stabiliser codes can be understood using the ZX-calculus. In this paper we show that certain complex rules involving ZX-diagrams, called spider nest…

A scenario for realization of a quantum computer is proposed consisting of spatially distributed q-bits fabricated in a host structure where nuclear spin-spin coupling is mediated by laser pulse controlled electron-nuclear transferred…

The ZX, ZW and ZH calculi are all graphical calculi for reasoning about pure state qubit quantum mechanics. All of these languages use certain diagrammatic decorations, called !-boxes and phase variables, to indicate not just one diagram…

Quantum circuit cutting refers to a series of techniques that allow one to partition a quantum computation on a large quantum computer into several quantum computations on smaller devices. This usually comes at the price of a sampling…

Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…

The d-level or qudit one-way quantum computer (d1WQC) is described using the valence bond solid formalism and the generalised Pauli group. This formalism provides a transparent means of deriving measurement patterns for the implementation…

In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula…

Leveraging noise bias, where phase-flip errors dominate over bit-flips, can drastically reduce the hardware overhead of fault-tolerant quantum computation, but existing approaches require bias-preserving CNOT gates whose implementation…

Quantum computers allow a near-exponential speed-up for specific applications when compared to classical computers. Despite recent advances in the hardware of quantum computers, their practical usage is still severely limited due to a…

In this work, we develop a graphical calculus for multi-qudit computations with generalized Clifford algebras, building off the algebraic framework developed in our prior work. We build our graphical calculus out of a fixed set of graphical…

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…

In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle…

We present a quantum compilation algorithm that maps Clifford encoders, encoding maps for stabilizer quantum codes, to a unique graphical representation in the ZX calculus. Specifically, we develop a canonical form in the ZX calculus and…

Qudit, a high-dimensional quantum system, provides a larger Hilbert space to process the quantum information and has shown remarkable advantages over the qubit counterparts. It is a great challenge to realize the high fidelity universal…

Distributed quantum computing (DQC) is a promising proposal for overcoming the scalability challenges of quantum computing. However, the evaluation of DQC hardware and software is difficult due to the relative dearth of classical simulation…

The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. The circuit model usually implements a desired unitary…

The implementation of a universal quantum processor still poses fundamental issues related to error mitigation and correction, which demand to investigate also platforms and computing schemes alternative to the main stream. A possibility is…