arXiv subjects

Bei Zeng

Publications and source records attributed to Bei Zeng.

At least 19 recordsLinked to original sources

arXiv2026

Finite Classification of Transversal Diagonal Gates Beyond Stabilizer Codes

We establish that transversal diagonal gates on exact qubit codes of distance at least two can be exhaustively classified within a finite search space. Although code-preserving physical gates can have continuous phases, any projective logical action induced by a transversal diagonal gate can always be realized by a physical gate of finite order. Crucially, we prove that this physical order has an upper bound determined solely by the code parameters. This order bound enables the subset-sum-linear-programming (SSLP) framework introduced in arXiv:2504.20847 to exhaustively enumerate all candidate discrete symmetries, after which the Knill-Laflamme equations determine the remaining continuous code parameters. Applying this method to the nontrivial diagonal sector of exact $((6,2,3))$ codes, SSLP yields $66$ candidate symmetry classes, of which exactly $15$ are realizable, supporting full projective diagonal logical cyclic groups of orders $2$, $3$, and $5$. In particular, for order $5$, the code is unique up to local unitaries and qubit permutations, equivalent to the code constructed in arXiv:2504.20847. This code also attains the minimum length $n=6$ among exact $((n, 2, \ge 3))$ codes whose full projective transversal group cannot be conjugated into the projective Clifford group.

quant-ph↗

arXiv2026

Quartic Certificates for Pure-State Tomography with Pauli Measurements

Full Pauli-basis tomography of an arbitrary $n$-qubit state uses the expectation values of all nonidentity Pauli observables. For multiqubit systems, prior knowledge that the state is pure allows some of these observables to be omitted while retaining uniqueness. We study two resulting notions of uniqueness: whether every pure state is uniquely determined among pure states (UDP), and whether every pure state is uniquely determined among all states, including mixed states (UDA). We derive quartic uniqueness certificates from the fourth elementary symmetric polynomial of operators in the real span of the omitted Pauli observables. An exact quartic identity shows that, for $n$-qubit systems with $n\geq 3$, every pure state is UDA whenever the omitted Pauli observables contain no four distinct operators that commute pairwise and multiply to $\pm I$. For three qubits, this condition is also necessary for UDP, yielding an exact characterization of both UDP and UDA. We further prove that UDP and UDA coincide for any number of qubits whenever the omitted Pauli observables commute pairwise. These results provide directly checkable structural criteria for certifying pure-state tomography from restricted Pauli measurements.

quant-ph↗

arXiv2026

Geometry of Knill-Laflamme Coefficients for Pauli Error Detection

Knill-Laflamme coefficients characterize exact quantum error detection through scalar compressions of error operators to the code space. For prescribed Pauli observables and a fixed code dimension, attainable coefficient vectors form a joint higher-rank numerical range, whose Euclidean norm image is the signature spectrum. We study how operator representation, code dimension, and detection constraints govern this geometry. Our main theorem identifies representation multiplicity as sufficient to lift active expectation data to exact scalar compressions: a lift exists whenever each occupied block has multiplicity at least the code dimension times the rank of the corresponding active state. When multiplicity suffices to realize all active states, the coefficient range is the full active expectation body and is therefore convex and connected, with a closed interval as its signature spectrum. This framework unifies commuting Pauli families, where sufficient common-eigenspace degeneracy yields polytopes, and subsystem stabilizer codes, where protected logical subsystems supply multiplicity spaces for noncommuting gauge observables. Explicit examples show how increasing the code dimension can make a range shrink, collapse, or become empty, while increasing multiplicity can turn a Bloch sphere into a filled ball. In the subsystem setting, parent-Hamiltonian constructions realize exact detecting codes as degenerate ground spaces, selecting distinguished vectors and continuous paths within these ranges. A final three-qubit example shows additional noncommuting detection constraints reduce a tetrahedral range to its barycenter and four vertices, producing a disconnected signature spectrum. The results provide a structural framework for Knill-Laflamme coefficient geometry and motivate sharper criteria for connected coefficient ranges and interval signature spectra under structured error models.

quant-ph↗

arXiv2026

Variance Geometry of Exact Pauli-Detecting Codes: Continuous Landscapes Beyond Stabilizers

Exact quantum codes detecting a prescribed set of Pauli errors are approached through algebraic constructions--stabilizer, codeword-stabilized, permutation-invariant, topological, and related families. Geometrically, exact Pauli detection is governed by joint higher-rank numerical ranges of these Pauli operators, whose structure for rank $\geq 2$ is largely uncharted. From this viewpoint, we show that such codes often form connected continuous families rather than collections of disjoint solution regions. These families are characterized by a single scalar derived from the Knill-Laflamme conditions: denoted $λ^*$, it is the Euclidean norm of the signature vector of Pauli expectation values on the maximally mixed code state, and provides a one-parameter summary of the code's joint Pauli variance profile. Within these continuous landscapes, stabilizer codes occupy only discrete, measure-zero subsets of the attainable $λ^*$-spectrum, exposing a largely unexplored continuum of genuinely nonadditive exact codes. We establish this picture by analyzing the geometry of higher-rank operator compressions, and extend it to symmetry-restricted settings where cyclic and permutation symmetries are imposed on both the error model and the code projector. Small-system cases reveal interval, singleton, and empty regimes through eigenvalue interlacing and symmetry-sector decompositions; larger systems are treated numerically via Stiefel-manifold optimization and symmetry-adapted parameterizations. In every unrestricted and symmetry-compatible case analyzed, the attainable $λ^*$-spectrum forms a single closed interval whenever nonempty--although a general proof remains open. These results place stabilizer, symmetric, and nonadditive code families within a unified higher-rank variance framework, suggesting a continuous geometric perspective on the landscape of exact quantum codes.

quant-ph↗

arXiv2026

Co-Designing Quantum Codes with Transversal Diagonal Gates via Multi-Agent Systems

Exact scientific discovery requires more than heuristic search: candidate constructions must be turned into exact objects and checked independently. We address this gap by extending TeXRA with an independent Lean 4 verification layer, turning it into a human-guided multi-agent platform for exact scientific discovery. The platform couples symbolic synthesis, combinatorial and linear-programming search, exact reconstruction of numerical candidates, and formal verification in Lean. We apply this platform to nonadditive quantum error-correcting codes with prescribed transversal diagonal gates within the subset-sum linear-programming (SSLP) framework. In the distance-2 regime where logical states occupy distinct residue classes, the platform yields a Lean-certified catalogue of 14,116 codes for $K\in\{2,3,4\}$ and up to six physical qubits, realizing cyclic logical orders 2 through 18, from which we extract closed-form infinite families. We also construct a residue-degenerate $((6,4,2))$ code implementing the logical controlled-phase gate $\mathrm{diag}(1,1,1,i)$. At distance 3, we resolve the transversal-$T$ problem for $((7,2,3))$ codes within the complementary binary-dihedral $\mathrm{BD}_{16}$ setting: among the 12 candidates surviving the SSLP filters, 10 admit exact realizations and 2 are excluded by no-go proofs. All accepted constructions, families, and no-go results are formalized and checked in Lean, illustrating how AI-assisted workflows can bridge search, exact reconstruction, and formal proof in the physical sciences.

quant-ph↗

arXiv2025

Non-Markovian Exceptional Points by Interpolating Quantum Channels

Exceptional points (EPs) are special points in non-Hermitian systems where both eigenvalues and eigenvectors coalesce. In open quantum systems, these points are typically analyzed using effective non-Hermitian Hamiltonians or Liouvillian superoperators. While quantum channels offer the most general framework for describing state evolution in such systems, the existence and properties of EPs within this setting remain largely unexplored. In this work, we present a general strategy for generating quantum EPs for a single-qubit setting. We show that quantum channels can be separated into two distinct phases, with the transition between them marked by the presence of an EP. Based on this, we propose a systematic method to realize EPs by interpolating between quantum channels representing different phases. Experimentally, we implement these interpolated channels on a nuclear magnetic resonance (NMR) quantum computer and confirm the emergence of second-order EPs with high fidelity. Extending the interpolation to three channels further reveals third-order EPs. Our results establish quantum channel interpolation as a versatile framework for generating EPs and provide a general description of EPs in open quantum systems.

quant-ph↗

arXiv2025

Transversal Gates in Nonadditive Quantum Codes

Transversal gates play a crucial role in suppressing error propagation in fault-tolerant quantum computation, yet they are intrinsically constrained: any nontrivial code encoding a single logical qubit admits only a finite subgroup of $\mathrm{SU}(2)$ as its transversal operations. We introduce a systematic framework for searching codes with specified transversal groups by parametrizing their logical subspaces on the Stiefel manifold and minimizing a composite loss that enforces both the Knill-Laflamme conditions and a target transversal-group structure. Applying this method, we uncover a new $((6,2,3))$ code admitting a transversal $Z\bigl(\tfrac{2π}{5}\bigr)$ gate (transversal group $\mathrm{C}_{10}$), the smallest known distance $3$ code supporting non-Clifford transversal gates, as well as several new $((7,2,3))$ codes realizing the binary icosahedral group $2I$. We further propose the \emph{Subset-Sum-Linear-Programming} (SS-LP) construction for codes with transversal \emph{diagonal} gates, which dramatically shrinks the search space by reducing to integer partitions subject to linear constraints. In a more constrained form, the method also applies directly to the binary-dihedral groups $\mathrm{BD}_{2m}$. Specializing to $n=7$, the SS-LP method yields codes for all $\mathrm{BD}_{2m}$ with $2m\le 36$, including the first $((7,2,3))$ examples supporting transversal $T$ gate ($\mathrm{BD}_{16}$) and $\sqrt{T}$ gate ($\mathrm{BD}_{32}$), improving on the previous smallest examples $((11,2,3))$ and $((19,2,3))$. Extending the SS-LP approach to $((8,2,3))$, we construct new codes for $2m>36$, including one supporting a transversal $T^{1/4}$ gate ($\mathrm{BD}_{64}$). These results reveal a far richer landscape of nonadditive codes than previously recognized and underscore a deeper connection between quantum error correction and the algebraic constraints on transversal gate groups.

quant-ph↗

arXiv2024

Investigating Pure State Uniqueness in Tomography via Optimization

Quantum state tomography (QST) is crucial for understanding and characterizing quantum systems through measurement data. Traditional QST methods face scalability challenges, requiring $\mathcal{O}(d^2)$ measurements for a general $d$-dimensional state. This complexity can be substantially reduced to $\mathcal{O}(d)$ in pure state tomography, indicating that full measurements are unnecessary for pure states. In this paper, we investigate the conditions under which a given pure state can be uniquely determined by a subset of full measurements, focusing on the concepts of uniquely determined among pure states (UDP) and uniquely determined among all states (UDA). The UDP determination inherently involves non-convexity challenges, while the UDA determination, though convex, becomes computationally intensive for high-dimensional systems. To address these issues, we develop a unified framework based on the Augmented Lagrangian Method (ALM). Specifically, our theorem on the existence of low-rank solutions in QST allows us to reformulate the UDA problem with low-rank constraints, thereby reducing the number of variables involved. Our approach entails parameterizing quantum states and employing ALM to handle the constrained non-convex optimization tasks associated with UDP and low-rank UDA determinations. Numerical experiments conducted on qutrit systems and four-qubit symmetric states not only validate theoretical findings but also reveal the complete distribution of quantum states across three uniqueness categories: (A) UDA, (B) UDP but not UDA, and (C) neither UDP nor UDA. This work provides a practical approach for determining state uniqueness, advancing our understanding of quantum state reconstruction.

quant-ph↗

arXiv2024

Characterizing Quantum Codes via the Coefficients in Knill-Laflamme Conditions

Quantum error correction (QEC) is essential for protecting quantum information against noise, yet understanding the structure of the Knill-Laflamme (KL) coefficients $λ_{ij}$ from the condition $PE_i^\dagger E_j P = λ_{ij} P$ remains challenging, particularly for nonadditive codes. In this work, we introduce the signature vector $\vecλ(P)$, composed of the off-diagonal KL coefficients $λ_{ij}$, where each coefficient corresponds to equivalence classes of errors counted only once. We define its Euclidean norm $λ^*(P)$ as a scalar measure representing the total strength of error correlations within the code subspace defined by the projector $P$. We parameterize $P$ on a Stiefel manifold and formulate an optimization problem based on the KL conditions to systematically explore possible values of $λ^*$. Moreover, we show that, for $((n,K,d))$ codes, $λ^*$ is invariant under local unitary transformations. Applying our approach to the $((6, 2, 3))$ quantum code, we find that $λ^*_{\text{min}} = \sqrt{0.6}$ and $λ^*_{\text{max}} = 1$, with $λ^* = 1$ corresponding to a known degenerate stabilizer code. We construct continuous families of new nonadditive codes parameterized by vectors in $\mathbb{R}^5$, with $λ^*$ varying over the interval $[\sqrt{0.6}, 1]$. For the $((7, 2, 3))$ code, we identify $λ^*_{\text{min}} = 0$ (corresponding to the non-degenerate Steane code) and $λ^*_{\text{max}} = \sqrt{7}$ (corresponding to the permutation-invariant code by Pollatsek and Ruskai), and we demonstrate continuous paths connecting these extremes via cyclic codes characterized solely by $λ^*$. Our findings provide new insights into the structure of quantum codes, advance the theoretical foundations of QEC, and open new avenues for investigating intricate relationships between code subspaces and error correlations.

quant-ph↗

arXiv2024

Quantifying subspace entanglement with geometric measures

Determining whether a subspace spanned by certain quantum states is entangled and its entanglement dimensionality remains a fundamental challenge in quantum information science. This paper introduces a geometric measure of $r$-bounded rank, $E_r(\mathcal{S})$, for a given subspace $\mathcal{S}$. Derived from the established geometric measure of entanglement, this measure is specifically designed to assess the entanglement within $\mathcal{S}$. It not only serves as a tool for determining the entanglement dimensionality but also illuminates the subspace's capacity to preserve such entanglement. By employing developed non-convex optimization techniques utilized in machine learning area, we can accurately calculate $E_r(\mathcal{S})$ within the manifold optimization framework. Our approach demonstrates notable advantages over existing hierarchical methods, PPT relaxation techniques, and the seesaw strategy, particularly by combining computational efficiency with broad applicability. More importantly, it paves the way for high-dimensional entanglement certification, which is crucial for numerous quantum information tasks. We showcase its effectiveness in validating high-dimensional entangled subspaces in bipartite systems, determining the border rank of multipartite pure states, and identifying genuinely or completely entangled subspaces.

quant-ph↗

arXiv2024

Demonstration of a variational quantum eigensolver with a solid-state spin system under ambient conditions

Quantum simulators offer the potential to utilize the quantum nature of a physical system to study another physical system. In contrast to conventional simulation, which experiences an exponential increase in computational complexity, quantum simulation cost increases only linearly with increasing size of the problem, rendering it a promising tool for applications in quantum chemistry. The variational-quantum-eigensolver algorithm is a particularly promising application for investigating molecular electronic structures. For its experimental implementation, spin-based solid-state qubits have the advantage of long decoherence time and high-fidelity quantum gates, which can lead to high accuracy in the ground-state finding. This study uses the nitrogen-vacancy-center system in diamond to implement the variational-quantum-eigensolver algorithm and successfully finds the eigenvalue of a specific Hamiltonian without the need for error-mitigation techniques. With a fidelity of 98.9% between the converged state and the ideal eigenstate, the demonstration provides an important step toward realizing a scalable quantum simulator in solid-state spin systems.

quant-ph↗

arXiv2024

Cloud-based Semi-Quantum Money

In the 1970s, Wiesner introduced the concept of quantum money, where quantum states generated according to specific rules function as currency. These states circulate among users with quantum resources through quantum channels or face-to-face interactions. Quantum mechanics grants quantum money physical-level unforgeability but also makes minting, storing, and circulating it significantly challenging. Currently, quantum computers capable of minting and preserving quantum money have not yet emerged, and existing quantum channels are not stable enough to support the efficient transmission of quantum states for quantum money, limiting its practicality. Semi-quantum money schemes support fully classical transactions and complete classical banks, reducing dependence on quantum resources and enhancing feasibility. To further minimize the system's reliance on quantum resources, we propose a cloud-based semi-quantum money (CSQM) scheme. This scheme relies only on semi-honest third-party quantum clouds, while the rest of the system remains entirely classical. We also discuss estimating the computational power required by the quantum cloud for the scheme and conduct a security analysis.

quant-ph↗

arXiv2024

Unified Framework for Calculating Convex Roof Resource Measures

Quantum resource theories (QRTs) provide a comprehensive and practical framework for the analysis of diverse quantum phenomena. A fundamental task within QRTs is the quantification of resources inherent in a given quantum state. In this letter, we introduce a unified computational framework for a class of widely utilized quantum resource measures, derived from convex roof extensions. We establish that the computation of these convex roof resource measures can be reformulated as an optimization problem over a Stiefel manifold, which can be further unconstrained through polar projection. Compared to existing methods employing semi-definite programming (SDP), gradient-based techniques or seesaw strategy, our approach not only demonstrates superior computational efficiency but also maintains applicability across various scenarios within a streamlined workflow. We substantiate the efficacy of our method by applying it to several key quantum resources, including entanglement, coherence, and magic states. Moreover, our methodology can be readily extended to other convex roof quantities beyond the domain of resource theories, suggesting broad applicability in the realm of quantum information theory.

quant-ph↗

arXiv2024

Dual-Capability Machine Learning Models for Quantum Hamiltonian Parameter Estimation and Dynamics Prediction

Recent advancements in quantum hardware and classical computing simulations have significantly enhanced the accessibility of quantum system data, leading to an increased demand for precise descriptions and predictions of these systems. Accurate prediction of quantum Hamiltonian dynamics and identification of Hamiltonian parameters are crucial for advancements in quantum simulations, error correction, and control protocols. This study introduces a machine learning model with dual capabilities: it can deduce time-dependent Hamiltonian parameters from observed changes in local observables within quantum many-body systems, and it can predict the evolution of these observables based on Hamiltonian parameters. Our model's validity was confirmed through theoretical simulations across various scenarios and further validated by two experiments. Initially, the model was applied to a Nuclear Magnetic Resonance quantum computer, where it accurately predicted the dynamics of local observables. The model was then tested on a superconducting quantum computer with initially unknown Hamiltonian parameters, successfully inferring them. Our approach aims to enhance various quantum computing tasks, including parameter estimation, noise characterization, feedback processes, and quantum control optimization.

quant-ph↗

arXiv2024

Quantum Graph Optimization Algorithm

Quadratic unconstrained binary optimization (QUBO) tasks are very important in chemistry, finance, job scheduling, and so on, which can be represented using graph structures, with the variables as nodes and the interaction between them as edges. Variational quantum algorithms, especially the Quantum Approximate Optimization Algorithm (QAOA) and its variants, present a promising way, potentially exceeding the capabilities of classical algorithms, for addressing QUBO tasks. However, the possibility of using message-passing machines, inspired by classical graph neural networks, to enhance the power and performance of these quantum algorithms for QUBO tasks was not investigated. This study introduces a novel variational quantum graph optimization algorithm that integrates the message-passing mechanism, which demonstrates significant improvements in performance for solving QUBO problems in terms of resource efficiency and solution precision, compared to QAOA, its variants, and other quantum graph neural networks. Furthermore, in terms of scalability on QUBO tasks, our algorithm shows superior performance compared to QAOA, presenting a substantial advancement in the field of quantum approximate optimization.

quant-ph↗

arXiv2024

A ZX-Calculus Approach for the Construction of Graph Codes

Quantum Error-Correcting Codes (QECCs) play a crucial role in enhancing the robustness of quantum computing and communication systems against errors. Within the realm of QECCs, stabilizer codes, and specifically graph codes, stand out for their distinct attributes and promising utility in quantum technologies. This study underscores the significance of devising expansive QECCs and adopts the ZX-calculus a graphical language adept at quantum computational reasoning-to depict the encoders of graph codes effectively. Through the integration of ZX-calculus with established encoder frameworks, we present a nuanced approach that leverages this graphical representation to facilitate the construction of large-scale QECCs. Our methodology is rigorously applied to examine the intricacies of concatenated graph codes and the development of holographic codes, thus demonstrating the practicality of our graphical approach in addressing complex quantum error correction challenges. This research contributes to the theoretical understanding of quantum error correction and offers practical tools for its application, providing objective advancements in the field of quantum computing.

quant-ph↗

arXiv2024

From Computing to Quantum Mechanics: Accessible and Hands-On Quantum Computing Education for High School Students

This paper outlines an alternative approach to teaching quantum computing at the high school level, tailored for students with limited prior knowledge in advanced mathematics and physics. This approach diverges from traditional methods by building upon foundational concepts in classical computing before gradually introducing quantum mechanics, thereby simplifying the entry into this complex field. The course was initially implemented in a program for gifted high school students under the Hong Kong Education Bureau and received encouraging feedback, indicating its potential effectiveness for a broader student audience. A key element of this approach is the practical application through portable NMR quantum computers, which provides students with hands-on experience. The paper describes the structure of the course, including the organization of the lectures, the integration of the hardware of the portable nuclear magnetic resonance (NMR) quantum computers, the Gemini/Triangulum series, and detailed lecture notes in an appendix. The initial success in the specialized program and ongoing discussions to expand the course to regular high schools in Hong Kong and Shenzhen suggest the viability of this approach for wider educational application. By focusing on accessibility and student engagement, this approach presents a valuable perspective on introducing quantum computing concepts at the high school level, aiming to enhance student understanding and interest in the field.

physics.ed-ph↗

arXiv2024

Variational learning algorithms for quantum query complexity

Quantum query complexity plays an important role in studying quantum algorithms, which captures the most known quantum algorithms, such as search and period finding. A query algorithm applies $U_tO_x\cdots U_1O_xU_0$ to some input state, where $O_x$ is the oracle dependent on some input variable $x$, and $U_i$s are unitary operations that are independent of $x$, followed by some measurements for readout. In this work, we develop variational learning algorithms to study quantum query complexity, by formulating $U_i$s as parameterized quantum circuits and introducing a loss function that is directly given by the error probability of the query algorithm. We apply our method to analyze various cases of quantum query complexity, including a new algorithm solving the Hamming modulo problem with $4$ queries for the case of $5$-bit modulo $5$, answering an open question raised in arXiv:2112.14682, and the result is further confirmed by a Semidefinite Programming (SDP) algorithm. Compared with the SDP algorithm, our method can be readily implemented on the near-term Noisy Intermediate-Scale Quantum (NISQ) devices and is more flexible to be adapted to other cases such as the fractional query models.

quant-ph↗