SearcharxivSearch

arXiv subjects

Zeng-Bing Chen

Publications and source records attributed to Zeng-Bing Chen.

At least 19 recordsLinked to original sources

The Inverse Eigenvalue Problem for Partial Transposes of Two-Qubit States

For a bipartite state $ρ$, information about the spectrum of its partial transpose $ρ^{Γ_B}$ can be inferred from measurements on multiple copies of $ρ$, without full state tomography. This raises a natural question: which eigenvalue lists can arise as $\operatorname{spec}(ρ^{Γ_B})$ for a density operator $ρ$? We completely solve this inverse eigenvalue problem for two qubits. Every nonnegative trace-one spectrum is realized as $\operatorname{spec}(ρ^{Γ_B})$ by some PPT state $ρ$, whereas an ordered candidate eigenvalue list $(x,y,z,-q)$, with $x\ge y\ge z\ge0$, $q>0$, and $x+y+z-q=1$, is realized by an NPT state iff $q\le y$ and $qy\le xz$. Sufficiency in the latter case is established by an explicit $X$ state whose quantum steering ellipsoid has center $c=(y-q)/(1-z)$ and normalized volume $V/V_{\max}(c)=qy/(xz)$, providing a geometric interpretation of the inequalities $q\le y$ and $qy\le xz$ as the allowed ellipsoid-center region and the fixed-center volume bound. Beyond this geometric picture, the two-qubit inverse theorem also yields exact negativity bounds from the two lowest nontrivial PT moments. Given fixed values of $p_2=Tr[(ρ^{Γ_B})^2]$ and $p_3=Tr[(ρ^{Γ_B})^3]$, we determine the exact minimum and maximum negativity over all two-qubit states subject to these moment constraints. When no PPT state is consistent with the pair $(p_2,p_3)$, the minimum is attained either at $x=y$ or $qy=xz$, while the maximum is attained either at $y=z$ or $q=y$. Finally, we show how the two-qubit inequalities persist as necessary constraints for the inverse eigenvalue problem in qubit--qudit systems.

quant-ph

Local Universality and Structural Certificates for Minimal Fixed-Depth Two-Qutrit Gate Decomposition

We study a dimension-saturating fixed-core ansatz in which four copies of a fixed, non-tunable two-qutrit core $K\in SU(9)$ are interleaved with five adjustable local layers from $L=SU(3)\otimes SU(3)$. Since $\dim SU(9)=80$ and $5\dim L=80$, this is the shortest fixed-core architecture not excluded by parameter counting. We formulate the smooth map $Φ_K:L^5\to SU(9)$ and use its right-trivialized differential to give verifiable certificates for local universality. We construct an explicit Clifford-word core whose Pauli-label splitting makes the identity-point differential an exact isometry, and we classify all 2304 symplectic actions satisfying the same splitting criterion. We also prove a structural obstruction for an important symmetry class: every complex-symmetric core $K=K^{T}$, including every core generated by a time-independent real-symmetric Hamiltonian in the chosen computational basis, has identity-point differential rank at most 78; hence any full-rank certificate for such a core must occur away from that point. We then assess a hardware-motivated superconducting core generated by a noncommuting, temporally asymmetric drive. Direct calculation verifies $K_{\rm sc}\neq K_{\rm sc}^{\mathsf T}$, and the core achieves $F_{\rm avg}\ge 0.999$ for all 1000 Haar-random targets tested under the stated restart protocol. We also report favorable sampled Jacobian-rank, structured-target, and robustness diagnostics. These results establish local universality at the parameter-counting-minimal, dimension-saturating depth, with an exact Clifford certificate complemented by a hardware-motivated numerical case study. Throughout, we separate exact local certificates from numerical evidence for broader synthesis performance.

quant-ph

Scalable and Highly Fault-Tolerant Circular Quantum Byzantine Agreement

Quantum Byzantine agreement (QBA), a cornerstone of quantum blockchain, offers inherent advantages in security and fault tolerance over classical protocols, guaranteed by the laws of quantum mechanics. However, existing multiparty QBA protocols face challenges for large-scale deployment due to exponential communication complexity or reliance on complex multi-particle entanglement. To address this, we propose a multiparty circular QBA protocol that adopts a semi-decentralized architecture, leveraging circular message gathering and quantum digital signatures to achieve quadratic communication complexity and enhanced fault tolerance. Our protocol is experimentally feasible, requiring only weak coherent states, and is compatible with existing star-shaped quantum networks. Simulations conducted on a global satellite-to-ground network demonstrate that the protocol sustains high consensus rates among multiple users, even when employing different key generation protocols under realistic conditions. This work presents a scalable framework for large-scale QBA networks, establishing the foundation for a practical quantum blockchain that enables secure and fault-tolerant decentralized services.

quant-ph

Experimental asymmetric relativistic zero-knowledge proofs with unconditional security

Zero-knowledge proofs (ZKPs) are widely applied in digital economies, such as cryptocurrencies and smart contracts, for establishing trust and privacy between untrusted parties. Classical ZKPs rely on computational assumptions and are vulnerable to quantum attacks. While a recent advance suggests quantum-sound symmetric relativistic ZKPs for the graph three-coloring problem without computational assumptions, the high round complexity, which leads to unachievable runtime and overall randomness cost, renders them impractical for real-life deployment. To overcome this, we develop an efficient asymmetric relativistic ZKP protocol using relativistic bit commitments, and prove its quantum soundness by relating it to the nonlocal Clauser-Horne-Shimony-Holt (CHSH) game. Our protocol achieves a linear relationship between the round complexity and the number of edges, and thus significantly improves practical feasibility. In addition, we implement a proof-of-principle experiment which completes all interactive rounds in about 0.22 seconds and requires an overall randomness cost of 430.81 MB. Our work illustrates the powerful potential of integrating special relativity with quantum theory in trustless cryptography, paving the way for robust applications against quantum attacks in distrustful Internet environments.

quant-ph

Experimentally validated quantum-secure federated learning over a multi-user quantum network

Federated learning enables decentralized, privacy-preserving training but remains vulnerable to privacy leakage in the quantum era. Quantum federated learning (QFL) offers a promising path towards enhanced security and efficiency. However, a practical and experimentally validated QFL protocol utilizing near-term quantum techniques to address data privacy has been lacking. Here we present QuNetQFL, a QFL protocol implemented on quantum networks, in which local model updates are masked with distributed quantum secret keys, offering information-theoretic security during aggregation. We experimentally validate the protocol on a four-client quantum network and benchmark its performance using the generated keys on quantum and real-world datasets. Adding a single quantum client significantly improves global accuracy for classifying multipartite entangled and non-stabilizer quantum datasets. For language tasks, we apply QuNetQFL to sentiment analysis by federated fine-tuning of a hybrid classical-quantum language model, achieving comparable and robust performance in simulation and on real quantum hardware. Large-scale simulations further demonstrate scalability to 200 clients for handwritten-digit recognition, with rapid convergence and a $75\%$ reduction in communication cost via model compression. Our work establishes a practical and scalable route to quantum-secure federated learning for the emerging quantum internet.

quant-ph

Repeater-like asynchronous measurement-device-independent quantum conference key agreement

Quantum conference key agreement enables secure communication among multiple parties by leveraging multipartite entanglement, which is expected to play a crucial role in future quantum networks. However, its practical implementation has been severely limited by the experimental complexity and low efficiency associated with the requirement for synchronous detection of multipartite entangled states. In this work, we propose a measurement-device-independent quantum conference key agreement protocol that employs asynchronous Greenberger-Horne-Zeilinger state measurement. Our protocol enables a linear scaling of the conference key rate among multiple parties, demonstrating performance comparable to that of the single-repeater scheme in quantum networks. Additionally, we achieve intercity transmission distances with composable security under finite-key conditions. By adopting the generalized asynchronous pairing strategy, our approach eliminates the need for complex global phase locking techniques. Furthermore, by integrating asynchronous pairing with ring-interference network structure, our method provides insights for various quantum tasks beyond quantum communication, including multiparty computing and quantum repeaters.

quant-ph

Experimental Coherent One-Way Quantum Key Distribution with Simplicity and Practical Security

Coherent one-way quantum key distribution (COW-QKD) has been widely investigated, and even been deployed in real-world quantum network. However, the proposal of the zero-error attack has critically undermined its security guarantees, and existing experimental implementations have not yet established security against coherent attacks. In this work, we propose and experimentally demonstrate an information-theoretically secure COW-QKD protocol that can resist source side-channel attacks, with secure transmission distances up to 100 km. Our system achieves a secure key rate on the order of kilobits per second over 50 km in the finite-size regime, sufficient for real-time secure voice communication across metropolitan networks. Furthermore, we demonstrate the encrypted transmission of a logo with information-theoretic security over 100 km of optical fiber. These results confirm that COW-QKD can simultaneously provide simplicity and security, establishing it as a strong candidate for deployment in small-scale quantum networks.

quant-ph

Experimental Efficient Source-Independent Quantum Conference Key Agreement

Multipartite entanglement enables secure group key distribution among multiple users while providing immunity against hacking attacks targeting source devices, thereby realizing source-independent quantum conference key agreement (SI-QCKA). However, previous experimental demonstrations of SI-QCKA have encountered substantial technical challenges, primarily due to the low efficiency and scalability limitations inherent in the generation and distribution of multipartite entanglement. Here, we experimentally demonstrate a scalable and efficient SI-QCKA protocol using polarization-entangled photon pairs in a three-user star network, where Greenberger-Horne-Zeilinger correlations are realized via a post-matching method. We achieve a secure group key rate of $2.11 \times 10^{4}$ bits/s under the single-user channel transmission of 1.64 $\times$ $10^{-1}$ in a symmetric channel loss network. Additionally, we conduct six sets of experiments to investigate the impact of varying channel transmission and random basis selection probabilities on secure key rates. Our work establishes an efficient pathway for SI-QCKA and demonstrates potential scalability for future large-scale multi-user quantum networks.

quant-ph

Experimental Efficient Source-Independent Quantum Secret Sharing against Coherent Attacks

Source-independent quantum secret sharing (SI QSS), while essential for secure multiuser cryptographic operations in quantum networks, faces significant implementation challenges stemming from the inherent complexity of generating and distributing multipartite entangled states. Recently, a resource-efficient SI QSS protocol utilizing entangled photon pairs combined with a postmatching method has been proposed to address this limitation. In this Letter, we report an experimental demonstration of this protocol using high-fidelity polarization-entangled photon pairs in a star topology. For a three-user network, we obtain secure key rates of 21.18, 4.69, and 1.71 kbps under single-user channel losses of 7.6, 10.9, and 12.9 dB respectively. Furthermore, under conditions of equal channel loss per user, we achieve secure key rates of 6.97, 6.46, and 5.88 kbps for three-, four-, and five-user scenarios respectively. These results demonstrate the advantageous independence of the key rate from the number of users. Our work paves the way for large-scale deployment of SI QSS in multiuser quantum networks.

quant-ph

Weakly-Driven Quantum Walks for Memory-Constrained Pauli Channel Learning

Accurate characterization of quantum noise, exemplified by the Pauli channel, is a cornerstone for building fault-tolerant quantum computers. A recent protocol (PRX Quantum 6, 020323 (2025)) combining channel concatenation and quantum memory has achieved an exponential reduction in measurement complexity for Pauli channel estimation. This efficiency, however, hinges on using logarithmic quantum memory to suppress hypothesis test errors. In this work, we introduce a mechanism termed the ``weakly-driven quantum walk'' to mitigate the demand for high-quality quantum memory. By exploiting the distinct dynamical properties of quantum walks under biased versus unbiased driving, our algorithm lowers the quantum memory overhead to a constant order while preserving the exponential advantage in measurement complexity. By analogy with weak measurement, our introduced concept of ``weak driving'' preserves pointer coherence even when driven by classical probabilistic information, a principle that may inspire new approaches to similar quantum algorithm design and quantum sensing of weak signals in resource-constrained scenarios.

quant-ph

Information-theoretically secure quantum timestamping with one-time universal hashing

Accurate and tamper-resistant timestamps are essential for applications demanding verifiable chronological ordering, such as legal documentation and digital intellectual property protection. Classical timestamp protocols rely on computational assumptions for security, rendering them vulnerable to quantum attacks, which is a critical limitation given the rapid progress in quantum computing. To address this, we propose an information-theoretically secure quantum timestamping protocol based on one-time universal hashing with quantum keys. Our protocol simultaneously achieves information-theoretic security and high efficiency, enabling secure timestamping for arbitrarily long documents. Simulations demonstrate a generation rate exceeding 100 timestamps per second over intercity distances. In addition, our protocol only requires weak coherent states, making it practical for large-scale deployment. This work advances the field of quantum timestamping and contributes to the broader development of quantum cryptography and the future quantum internet.

quant-ph

Hybrid Quantum-inspired Resnet and Densenet for Pattern Recognition

In this paper, we propose two hybrid quantum-inspired neural networks with adaptive residual and dense connections respectively for pattern recognition. We explain the frameworks of the symmetrical circuit models in the quantum-inspired layers in our hybrid models. We also illustrate the potential superiority of our hybrid models to prevent gradient explosion owing to the sine and cosine functions in the quantum-inspired layers. Groups of numerical experiments on generalization power showcase that our hybrid models are comparable to the pure classical models with different noisy datasets utilized. Furthermore, the comparison between our hybrid models and a state-of-the-art hybrid quantum-classical convolutional network demonstrates 3%-4% higher accuracy of our hybrid densely-connected model than the hybrid quantum-classical network. Additionally, compared with other two hybrid quantum-inspired residual networks, our hybrid models showcase a little higher accuracy on image datasets with asymmetrical noises. Simultaneously, in terms of groups of robustness experiments, the outcomes demonstrate that our two hybrid models outperform pure classical models notably in resistance to adversarial parameter attacks with various asymmetrical noises. They also indicate the slight superiority of our densely-connected hybrid model over the hybrid quantum-classical network to both symmetrical and asymmetrical attacks. Meanwhile, the accuracy of our two hybrid models is a little bit higher than that of the two hybrid quantum-inspired residual networks. In addition, an ablation study indicate that the recognition accuracy of our two hybrid models is 2%-3% higher than that of the traditional quantum-inspired neural network without residual or dense connection. Eventually, we discuss the application scenarios of our hybrid models by analyzing their computational complexity.

cs.LG

Universal Entanglement and an Information-Complete Quantum Theory

The most challenging problem of modern physics is how to reconcile quantum theory and general relativity, namely, to find a consistent quantum theory in which gravity is quantized. This Progress Report focuses on such a tentative theory called the information-complete quantum theory (ICQT), in which (1) spacetime (gravity) as a physical quantum system plays a central role for formulating the theory, and (2) there are no any classical systems and concepts. Here universal spacetime-matter entanglement "glues" spacetime and matter (matter fermions and their gauge fields) as an indivisible trinity, encodes information-complete physical predictions of the world, and is as universal as universal gravitation. After summarizing the basic theoretic structure of the ICQT, conceptual advances achieved so far and some new issues within the ICQT are considered. While such a theory integrating quantum gravity is of fundamental interest to a wider audience, its relevance to quantum information technologies is discussed, with emphasis on its potential impacts on quantum computing and quantum communication.

physics.gen-ph

Quantum Entanglement Dynamics of Spacetime and Matter

It was known long ago that quantum theory and general relativity are in sharp conflict in their foundations. Their fundamental inconsistencies render a consistent theory of quantum gravity the most challenging problem in physics. Here we propose an information-complete quantum field theory (ICQFT), which describes elementary fermions, their gauge fields, and gravity (together, called the trinary fields) as an elementary trinity without any conceptual inconsistency of existing theories. The ICQFT unifies matter and spacetime (gravity) as information via spacetime-matter entanglement, which encodes complete physical predictions of the theory and leads to a compelling solution to the problem of time. We consider two particular forms of spacetime-matter entangled states and their physical consequences. One of them results in a universal relation between entanglement entropy and geometry (area and volume), allowing us to determine the cosmological constant term in the classical Einstein equation. Based on a quantum-information definition of dark energy, our Universe is not strictly holographic. We predict the interior quantum state of a Schwarzschild black hole to be maximally information-complete. As a concrete quantum formulation of gravity coupled with matter, the ICQFT is quantum entanglement dynamics for spacetime and matter and eliminates the conceptual obstacles of existing quantum gravity theory.

gr-qc

Multi-field quantum conferencing overcomes the network capacity limit

Quantum conferencing enables multiple nodes within a quantum network to share a secure group key for private message broadcasting. The key rate, however, is limited by the repeaterless capacity to distribute multiparticle entangled states across the network. Currently, in the finite-size regime, no feasible schemes utilizing existing experimental techniques can overcome the fundamental rate-distance limit of quantum conferencing in quantum networks without repeaters. Here, we propose a practical, multi-field scheme that breaks this limit, involving virtually establishing Greenberger-Horne-Zeilinger states through post-measurement coincidence matching. This proposal features a measurement-device-independent characteristic and can directly scale to support any number of users. Simulations show that the fundamental limitation on the group key rate can be overcome in a reasonable running time of sending $10^{14}$ pulses. We predict that it offers an efficient design for long-distance broadcast communication in future quantum networks.

quant-ph

Asynchronous Quantum Repeater using Multiple Quantum Memory

A full-fledged quantum network relies on the formation of entangled links between remote location with the help of quantum repeaters. The famous Duan-Lukin-Cirac-Zoller quantum repeater protocol is based on long distance single-photon interference, which not only requires high phase stability but also cannot generate maximally entangled state. Here, we propose a quantum repeater protocol using the idea of post-matching, which retains the same efficiency as the single-photon interference protocol, reduces the phase-stability requirement and can generate maximally entangled state in principle. We also outline an implementation of our scheme based on the Kerr nonlinear resonator. Numerical simulations show that our protocol has its superiority by comparing with existing protocols under a generic noise model and show the feasibility of building a large-scale quantum communication network with our scheme. We believe our work represents a crucial step towards the construction of a fully-connected quantum network.

quant-ph

Continuous-variable quantum digital signatures that can withstand coherent attacks

Quantum digital signatures (QDSs), which utilize correlated bit strings among sender and recipients, guarantee the authenticity, integrity, and nonrepudiation of classical messages based on quantum laws. Continuous-variable (CV) quantum protocol with heterodyne and homodyne measurement has obvious advantages of low-cost implementation and easy wavelength division multiplexing. However, security analyses in previous researches are limited to the proof against collective attacks in finite-size scenarios. Moreover, existing multibit CV QDS schemes have primarily focused on adapting single-bit protocols for simplicity of security proof, often sacrificing signature efficiency. Here, we introduce a CV QDS protocol designed to withstand general coherent attacks through the use of a cutting-edge fidelity test function, while achieving high signature efficiency by employing a refined one-time universal hashing signing technique. Our protocol is proved to be robust against finite-size effects and excess noise in quantum channels. In simulation, results demonstrate a significant reduction of eight orders of magnitude in signature length for a megabit message signing task compared with existing CV QDS protocols and this advantage expands as the message size grows. Our work offers a solution with enhanced security and efficiency, paving the way for large-scale deployment of CV QDSs in future quantum networks.

quant-ph

Experimental coherent-state quantum secret sharing with finite pulses

Quantum secret sharing (QSS) plays a significant role in multiparty quantum communication and is a crucial component of future quantum multiparty computing networks. Therefore, it is highly valuable to develop a QSS protocol that offers both information-theoretic security and validation in real optical systems under a finite-key regime. In this work, we propose a three-user QSS protocol based on phase-encoding technology. By adopting symmetric procedures for the two players, our protocol resolves the security loopholes introduced by asymmetric basis choice without prior knowledge of the identity of the malicious player. Kato's concentration inequality is exploited to provide security against coherent attacks with the finite-key effect. Moreover, the practicality of our protocol has been validated under a 30-dB channel loss with a transmission distance of 5-km fiber. Our protocol achieves secure key rates ranging from 432 to 192 bps by choosing different pulse intensities and basis selection probabilities. Offering enhanced security and practicality, our protocol stands as an essential element for the realization of quantum multiparty computing networks.

quant-ph