arXiv subjects

Dong-Sheng Wang

Publications and source records attributed to Dong-Sheng Wang.

At least 19 recordsLinked to original sources

arXiv2026

LEAD: A Local Ensemble-Assisted Parallel Decoding Framework for Quantum Tanner Codes

Quantum Tanner codes are a recently developed family of quantum error-correcting codes characterized by favorable asymptotic performance characteristics. Despite their theoretical potential, practical decoding algorithms that effectively leverage their structural properties remain limited. This work introduces LEAD (Local Ensemble-Assisted Decoder), a structure-aware decoding framework tailored for quantum Tanner codes. The proposed scheme leverages the decomposable structure of Cayley complexes to project the global code onto overlapping local subcodes defined by vertex neighborhoods, where error probabilities are estimated in parallel. To ensure global consistency, LEAD utilizes the inherent topological symmetry of the complex and introduces a soft-information regularization mechanism to mitigate local overconfidence during information aggregation. This framework enables highly parallelized, low-complexity decoding that is intrinsically compatible with various local search heuristics. Simulation results demonstrate that LEAD achieves significantly lower logical error rates than standard decoding framework while substantially reducing the average decoding latency and iteration count.

quant-ph↗

arXiv2026

Towards Minimal Fault-tolerant Error-Correction Sequence with Quantum Hamming Codes

The high overhead of fault-tolerant measurement sequences (FTMSs) poses a major challenge for implementing quantum stabilizer codes. Here, we address this problem by constructing efficient FTMSs for the class of quantum Hamming codes $[\![2^r-1, 2^r-1-2r, 3]\!]$ with $r=3k+1$ ($k \in \mathbb{Z}^+$). Our key result demonstrates that the sequence length can be reduced to exactly $2r+1$-only one additional measurement beyond the original non-fault-tolerant sequence, establishing a tight lower bound. The proposed method leverages cyclic matrix transformations to systematically combine rows of the initial stabilizer matrix and preserving a self-dual CSS-like symmetry analogous to that of the original quantum Hamming codes. This induced symmetry enables hardware-efficient circuit reuse: the measurement circuits for the first $r$ stabilizers are transformed into circuits for the remaining $r$ stabilizers simply by toggling boundary Hadamard gates, eliminating redundant hardware. For distance-3 fault-tolerant error correction, our approach simultaneously reduces the time overhead via shorting the FTMS length and the hardware overhead through symmetry-enabled circuit multiplexing. These results provide an important advance towards the important open problem regarding the design of minimal FTMSs for quantum Hamming codes and may shed light on similar challenges in other quantum stabilizer codes.

quant-ph↗

arXiv2024

Quantum resource theory of coding for error correction

Error-correction codes are central for fault-tolerant information processing. Here we develop a rigorous framework to describe various coding models based on quantum resource theory of superchannels. We find, by treating codings as superchannels, a hierarchy of coding models can be established, including the entanglement assisted or unassisted settings, and their local versions. We show that these coding models can be used to classify error-correction codes and accommodate different computation and communication settings depending on the data type, side channels, and pre-/postprocessing. We believe the coding hierarchy could also inspire new coding models and error-correction methods.

quant-ph↗

arXiv2024

Experimental simulation of quantum superchannels

Simulating quantum physical processes has been one of the major motivations for quantum information science. Quantum channels, which are completely positive and trace preserving processes, are the standard mathematical language to describe quantum evolution, while in recent years quantum superchannels have emerged as the substantial extension. Superchannels capture effects of quantum memory and non-Markovianality more precisely, and have found broad applications in universal models, algorithm, metrology, discrimination tasks, as examples. Here, we report an experimental simulation of qubit superchannels in a nuclear magnetic resonance (NMR) system with high accuracy, based on a recently developed quantum algorithm for superchannel simulation. Our algorithm applies to arbitrary target superchannels, and our experiment shows the high quality of NMR simulators for near-term usage. Our approach can also be adapted to other experimental systems and demonstrates prospects for more applications of superchannels.

quant-ph↗

arXiv2022

Flexible learning of quantum states with generative query neural networks

Deep neural networks are a powerful tool for the characterization of quantum states. Existing networks are typically trained with experimental data gathered from the specific quantum state that needs to be characterized. But is it possible to train a neural network offline and to make predictions about quantum states other than the ones used for the training? Here we introduce a model of network that can be trained with classically simulated data from a fiducial set of states and measurements, and can later be used to characterize quantum states that share structural similarities with the states in the fiducial set. With little guidance of quantum physics, the network builds its own data-driven representation of quantum states, and then uses it to predict the outcome statistics of quantum measurements that have not been performed yet. The state representation produced by the network can also be used for tasks beyond the prediction of outcome statistics, including clustering of quantum states and identification of different phases of matter. Our network model provides a flexible approach that can be applied to online learning scenarios, where predictions must be generated as soon as experimental data become available, and to blind learning scenarios where the learner has only access to an encrypted description of the quantum hardware.

quant-ph↗

arXiv2021

Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes

In this work, we develop the theory of quasi-exact fault-tolerant quantum (QEQ) computation, which uses qubits encoded into quasi-exact quantum error-correction codes ("quasi codes"). By definition, a quasi code is a parametric approximate code that can become exact by tuning its parameters. The model of QEQ computation lies in between the two well-known ones: the usual noisy quantum computation without error correction and the usual fault-tolerant quantum computation, but closer to the later. Many notions of exact quantum codes need to be adjusted for the quasi setting. Here we develop quasi error-correction theory using quantum instrument, the notions of quasi universality, quasi code distances, and quasi thresholds, etc. We find a wide class of quasi codes which are called valence-bond-solid codes, and we use them as concrete examples to demonstrate QEQ computation.

quant-ph↗

arXiv2020

Quasi-exact quantum computation

We study quasi-exact quantum error correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding exact codes, serving as its fixed points. The computation with a quasi-exact code cannot realize any logical gate to arbitrary accuracy. To overcome this, the notion of quasi-exact universality is proposed, which makes quasi-exact quantum computation a feasible model especially for executing moderate-size algorithms. We find that the incompatibility between universality and transversality of the set of logical gates does not persist in the quasi-exact scenario. A class of covariant quasi-exact codes is defined which proves to support transversal and quasi-exact universal set of logical gates for $SU(d)$. This work opens the possibility of quantum computation with quasi-exact universality, transversality, and fault tolerance.

quant-ph↗

arXiv2020

Choi states, symmetry-based quantum gate teleportation, and stored-program quantum computing

The stored-program architecture is canonical in classical computing, while its power has not been fully recognized for the quantum case. We study quantum information processing with stored quantum program states, i.e., using qubits instead of bits to encode quantum operations. We develop a stored-program model based on Choi states, following from channel-state duality, and a symmetry-based generalization of deterministic gate teleportation. Our model enriches the family of universal models for quantum computing, and can also be employed for tasks including quantum simulation and communication.

quant-ph↗

arXiv2019

A local model of quantum Turing machines

The model of local Turing machines is introduced, including classical and quantum ones, in the framework of matrix-product states. The locality refers to the fact that at any instance of the computation the heads of a Turing machine have definite locations. The local Turing machines are shown to be equivalent to the corresponding circuit models and standard models of Turing machines by simulation methods. This work reveals the fundamental connection between tensor-network states and information processing.

quant-ph↗

arXiv2019

Classes of topological qubits from low-dimensional quantum spin systems

Topological phases of matter is a natural place for encoding robust qubits for quantum computation. In this work we extend the newly introduced class of qubits based on valence-bond solid models with SPT (symmetry-protected topological) order to more general cases. Furthermore, we define and compare various classes of topological qubits encoded in the bulk ground states of topological systems, including SSB (spontaneous symmetry-breaking), TOP (topological), SET (symmetry-enriched topological), SPT, and subsystem SPT classes. We focus on several features for qubits to be robust, including error sets, logical support, code distance and shape of logical gates. In particular, when a global U(1) symmetry is present and preserved, we find a twist operator that extracts the SPT order plays the role of a topological logical operator, which is suitable for global implementation.

quant-ph↗

arXiv2019

Quantum Computing with sine-Gordon Qubits

A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field theories such as sine-Gordon field theory can be employed to describe a qubit. Primary logical gates are from twist, pump, glue, and shuffle operations that can be realized in principle by tuning parameters of the systems. Our scheme demonstrates the power of 1D quantum systems for robust quantum computing.

quant-ph↗

arXiv2019

A computationally universal phase of quantum matter

We provide the first example of a symmetry protected quantum phase that has universal computational power. Throughout this phase, which lives in spatial dimension two, the ground state is a universal resource for measurement based quantum computation.

quant-ph↗

arXiv2018

Quantum computation by teleportation and symmetry

A preliminary overview of measurement-based quantum computation in the setting of symmetry and topological phases of quantum matter is given. The underlying mechanism for universal quantum computation by teleportation or symmetry are analyzed, with the emphasis on the relation with tensor-network states in the presence of various symmetries. Perspectives are also given for the role of symmetry and phases of quantum matter in measurement-based quantum computation and fault tolerance.

quant-ph↗

arXiv2018

Topological qubits from valence bond solids

Topological qubits based on $SU(N)$-symmetric valence-bond solid models are constructed. A logical topological qubit is the ground subspace with two-fold degeneracy, which is due to the spontaneous breaking of a global parity symmetry. A logical $Z$-rotation by angle $\frac{2π}{N}$, for any integer $N > 2$, is provided by a global twist operation, which is of topological nature and protected by the energy gap. A general concatenation scheme with standard quantum error-correction codes is also proposed, which can lead to better codes. Generic error-correction properties of symmetry-protected topological order are also demonstrated.

quant-ph↗

arXiv2017

Computational Power of Symmetry-Protected Topological Phases

We consider ground states of quantum spin chains with symmetry-protected topological (SPT) order as resources for measurement-based quantum computation (MBQC). We show that, for a wide range of SPT phases, the computational power of ground states is uniform throughout each phase. This computational power, defined as the Lie group of executable gates in MBQC, is determined by the same algebraic information that labels the SPT phase itself. We prove that these Lie groups always contain a full set of single-qubit gates, thereby affirming the long-standing conjecture that general SPT phases can serve as computationally useful phases of matter.

quant-ph↗

arXiv2017

Experimental quantum channel simulation

Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported quantum channel simulator consists of four single-qubit gates and one controlled-NOT gate. All types of quantum channels can be decomposed by the algorithm and implemented on this device. We deploy our system to simulate various quantum channels, such as quantum-noise channels and weak quantum measurement. Our results advance experimental quantum channel simulation, which is integral to the goal of quantum information processing.

quant-ph↗

arXiv2017

Qudit quantum computation on matrix product states with global symmetry

Resource states that contain nontrivial symmetry-protected topological order are identified for universal single-qudit measurement-based quantum computation. Our resource states fall into two classes: one as the qudit generalizations of the 1D qubit cluster state, and the other as the higher-symmetry generalizations of the spin-1 Affleck-Kennedy-Lieb-Tasaki (AKLT) state, namely, with unitary, orthogonal, or symplectic symmetry. The symmetry in cluster states protects information propagation (identity gate), while the higher symmetry in AKLT-type states enables nontrivial gate computation. This work demonstrates a close connection between measurement-based quantum computation and symmetry-protected topological order.

quant-ph↗

arXiv2016

Convex decomposition of dimension-altering quantum channels

Quantum channels, which are completely positive and trace preserving mappings, can alter the dimension of a system; e.g., a quantum channel from a qubit to a qutrit. We study the convex set properties of dimension-altering quantum channels, and particularly the channel decomposition problem in terms of convex sum of extreme channels. We provide various quantum circuit representations of extreme and generalized extreme channels, which can be employed in an optimization to approximately decompose an arbitrary channel. Numerical simulations of low-dimensional channels are performed to demonstrate our channel decomposition scheme.

quant-ph↗