相关论文: Pauli webs spun by transversal $|Y\rangle$ state i…
Transformations on quantum states form a basic building block of every quantum information system. From photonic polarization to two-level atoms, complete sets of quantum gates for a variety of qubit systems are well known. For multi-level…
We generalize the polynomial-time outcome-complete simulation algorithm for stabilizer circuits in arXiv:2309.08676 to track global phases exactly, yielding what we call phased outcome-complete simulation. The original algorithm enabled…
We study the ground-state entanglement in systems of spins forming the boundary of a quantum spin network in arbitrary geometries and dimensionality. We show that as long as they are weakly coupled to the bulk of the network, the surface…
By recursively nesting sums and products, probabilistic circuits have emerged in recent years as an attractive class of generative models as they enjoy, for instance, polytime marginalization of random variables. In this work we study these…
Probabilistic computers replace logic gates with networks of interacting random variables, creating bidirectional systems that can back-derive inputs from outputs. Such architectures enable efficient generation of random samples,…
We propose a randomized variant of the stabilizer rewiring algorithm (SRA), a method for constructing a transversal circuit mapping between any pair of stabilizer codes. As gates along this circuit are applied, the initial code is deformed…
The "marginal" distributions for measurable coordinate and spin projection is introduced. Then, the analog of the Pauli equation for spin-1/2 particle is obtained for such probability distributions instead of the usual wave functions. That…
Given a simple algebraic group $G$, a web is a directed trivalent graph with edges labelled by dominant minuscule weights. There is a natural surjection of webs onto the invariant space of tensor products of minuscule representations.…
Higher-order topological corner states have been realized in two-dimensional Kekul\'{e} lattice, which can be further coupled with spin polarization through the implementation of local magnetization. In this work, we numerically investigate…
The polarizations of topological edge modes in the vicinity of optical Weyl points were numerically studied in chiral photonic crystals. We investigated two kinds of rotationally stacked woodpile structures in which planar rod arrays were…
Surface codes are the most promising candidates for fault-tolerant quantum computation. Single qudit errors are typically modelled as Pauli operators, to which general errors are converted via randomizing methods. In this Letter, we…
Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data…
Proposed Bell pair swapping protocols, an essential component of the Quantum Internet, are planned-path: specific, structured, routing paths are reserved prior to the execution of the swapping process. This makes sense when one assumes the…
In this paper, we propose a novel optimizer state compression algorithm, namely $\pi$-Quant, which leverages the properties of irrational numbers (e.g., $\pi$) for memory-efficient training. The core idea is based on our mathematical…
Optimising quantum circuits to minimise resource usage is crucial, especially with near-term hardware limited by quantum volume. This paper introduces an optimisation algorithm aiming to minimise non-Clifford gate count and two-qubit gate…
With the rapidly growing interest in quantum computing also grows the importance of securing these quantum computers from various physical attacks. Constantly increasing qubit counts and improvements to the fidelity of the quantum computers…
In trapped-ion quantum computers, two-qubit entangling gates are generated by applying spin-dependent force which uses phonons to mediate interaction between the internal states of the ions. To maintain high-fidelity two-qubit gates under…
We investigate the iteration of a sequence of local and pair unitary transformations, which can be interpreted to result from a Turing-head (pseudo-spin $S$) rotating along a closed Turing-tape ($M$ additional pseudo-spins). The dynamical…
We introduce the Scalable ZX-calculus (SZX-calculus for short), a formal and compact graphical language for the design and verification of quantum computations. The SZX-calculus is an extension of the ZX-calculus, a powerful framework that…
We introduce the P\'olya Web, a system of coalescing random walks based on the classic P\'olya urn model. This construction serves as an analogue to the web of coalescing random walks studied by T\'oth and Werner (1998), replacing simple…