相关论文: Qudit lattice surgery

The design and implementation of large sets of spatially-extended, gauge-invariant operators for use in determining the spectrum of baryons in lattice QCD computations are described. Group-theoretical projections onto the irreducible…

Facilitating the ability to achieve logical qubit error rates below physical qubit error rates, error correction is anticipated to play an important role in scaling quantum computers. While many algorithms require millions of physical…

A new quantum link microstructure was proposed for the lattice quantum chromodynamics (QCD) Hamiltonian, replacing the Wilson gauge links with a bilinear of fermionic qubits, later generalized to D-theory. This formalism provides a general…

The implementation of holonomic quantum computation on superconducting quantum circuits is challenging due to the general requirement of controllable complicated coupling between multilevel systems. Here we solve this problem by proposing a…

Various aspects of the theory of quantum integrable systems are reviewed. Basic ideas behind the construction of integrable ultralocal and nonultralocal quantum models are explored by exploiting the underlying algebraic structures related…

This work develops a framework to apply normalizing-flow transformations of field configurations for all-orders Quantum Electrodynamics (QED) corrections in lattice field theory. This opens a new possibility to determine all-order…

The ZX-calculus is a graphical calculus for reasoning about pure state qubit quantum mechanics. It is complete for pure qubit stabilizer quantum mechanics, meaning any equality involving only stabilizer operations that can be derived using…

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 our recent work [Phys. Rev. Lett. 102, 230502 (2009)] we showed that the partition function of all classical spin models, including all discrete standard statistical models and all Abelian discrete lattice gauge theories (LGTs), can be…

Quantum computing platforms are evolving to a point where placing high numbers of qubits into a single core comes with certain difficulties such as fidelity, crosstalk, and high power consumption of dense classical electronics. Utilizing…

A scheme based on a unifying q-deformed algebra and associated with a generalized Lax operator is proposed for generating integrable quantum and statistical models. As important applications we derive known as well as novel quantum models…

Physical constraints and engineering challenges, including wafer dimensions, classical control cabling, and refrigeration volumes, impose significant limitations on the scalability of quantum computing units. As a result, a modular quantum…

The ZW-calculus is a graphical language capable of representing 2-dimensional quantum systems (qubit) through its diagrams, and manipulating them through its equational theory. We extend the formalism to accommodate finite dimensional…

The ZX-calculus is an intuitive but also mathematically strict graphical language for quantum computing, which is especially powerful for the framework of quantum circuits. Completeness of the ZX-calculus means any equality of matrices with…

We construct lattice gauge theories in which the elements of the link matrices are represented by non-commuting operators acting in a Hilbert space. These quantum link models are related to ordinary lattice gauge theories in the same way as…

We present a new graphical calculus that is sound and complete for a universal family of quantum circuits, which can be seen as the natural string-diagrammatic extension of the approximately (real-valued) universal family of Hadamard+CCZ…

Recent completeness results on the ZX-Calculus used a third-party language, namely the ZW-Calculus. As a consequence, these proofs are elegant, but sadly non-constructive. We address this issue in the following. To do so, we first describe…

There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different models in a unifying framework based on the ZX calculus. We…

We present the first high performance compiler for very large scale quantum error correction: it translates an arbitrary quantum circuit to surface code operations based on lattice surgery. Our compiler offers an end to end error correction…

QCD is constructed as a lattice gauge theory in which the elements of the link matrices are represented by non-commuting operators acting in a Hilbert space. The resulting quantum link model for QCD is formulated with a fifth Euclidean…