相关论文: Pauli webs spun by transversal $|Y\rangle$ state i…
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…
We introduce the notion of quantum computational webs: These are quantum states universal for measurement-based computation which can be built up from a collection of simple primitives. The primitive elements - reminiscent of building…
State surfaces are spanning surfaces of links that are obtained from link diagrams guided by the combinatorics underlying Kauffman's construction of the Jones polynomial via state models. Geometric properties of such surfaces are often…
We theoretically find that the second-order topological insulator, i.e., corner states, can be engineered by coupling two copies of two-dimensional $\mathbb{Z}_2$ topological insulators with opposite spin-helicities. As concrete examples,…
Certain types of quantum computing platforms, such as those realized using Rydberg atoms or Kerr-cat qubits, are natively more susceptible to Pauli-Z noise than Pauli-X noise, or vice versa. On such hardware, it is useful to ensure that…
Quantum computing has been pursued with various hardware platforms, and an optical system is one of the most reasonable choices for large-scale computation. In the optical continuous-variable computation scheme, the incorporation of…
Pauli-based computation (PBC) is driven by a sequence of adaptively chosen, non-destructive measurements of Pauli observables. Any quantum circuit written in terms of the Clifford+$T$ gate set and having $t$ $T$ gates can be compiled into a…
Formal reasoning about distributed algorithms (like Consensus) typically requires to analyze global states in a traditional state-based style. This is in contrast to the traditional action-based reasoning of process calculi. Nevertheless,…
Graphical calculi are vital tools for representing and reasoning about quantum circuits and processes. Some are not only graphically intuitive but also logically complete. The best known of these is the ZX-calculus, which is an industry…
The robust operation of quantum entanglement states are crucial for applications in quantum information, computing, and communications1-3. However, it has always been a great challenge to complete such a task because of decoherence and…
The transformations of $W$-type entangled states by using local operations assisted with classical communication are investigated. For this purpose, a parametrization of the $W$-type states which remains invariant under local unitary…
The color code has been invaluable for the development of the theory of fault-tolerant logic gates using transversal rotations. Three-dimensional examples of the color code have shown us how its structure, specifically the intersection of…
The quantum simulation kernel is an important subroutine appearing as a very long gate sequence in many quantum programs. In this paper, we propose Paulihedral, a block-wise compiler framework that can deeply optimize this subroutine by…
Pole Expansion and Selected Inversion (PEXSI) is an efficient scheme for evaluating selected entries of functions of large sparse matrices as required e.g. in electronic structure algorithms. We show that the triangular factorizations…
The development of quantum codes with good error correction parameters and useful sets of transversal gates is a problem of major interest in quantum error-correction. Abundant prior works have studied transversal gates which are restricted…
We report numerical results on the diagonalization of 1D transverse field Ising model. Numerical simulations using the Pauli product representation yield diagonalization from 3 spins to 22 spins in the transverse field Ising model with the…
Geometric configurations of three-$\alpha$ particles in the ground- and first-excited $J^\pi=0^+$ states of $^{12}$C are discussed within two types of $\alpha$-cluster models which treat the Pauli principle differently. Though there are…
We introduce the concept of directional coupling, i.e., the selective transfer of a state between adjacent quantum wires, in the context of quantum computing and short-distance communication. Our analysis rests upon a mathematical analogy…
Magic state distillation and the Shor factoring algorithm make essential use of logical diagonal gates. We introduce a method of synthesizing CSS codes that realize a target logical diagonal gate at some level $l$ in the Clifford hierarchy.…
We show two fascinating topics lying between quantum information processing and statistical mechanics. First, we introduce an elaborated technique, the surface code, to prepare the particular quantum state with robustness against…