SearcharxivSearch

arXiv subjects

Guilu Long

Publications and source records attributed to Guilu Long.

At least 19 recordsLinked to original sources

Trainable Quantum Channels as Computational Primitives for Quantum Learning

Variational quantum learning is traditionally constrained to unitary dynamics, often treating quantum channels as detrimental noise. In this work, we reformulate the quantum channels as trainable computational primitives and establish a non-unitary quantum machine learning framework grounded in open-system dynamics. We demonstrate that the outputs of channel-enhanced quantum models form a structured superposition of multiple functional components. Each component is governed by an effective observable whose spectrum can be adaptively modulated during training, a significant departure from the spectral invariance in unitary transformations. Moreover, the proposed framework generalizes conventional unitary quantum models by retaining them as a special case while introducing additional non-unitary degrees of freedom. Furthermore, we reveal that trainable quantum channels enrich the optimization geometry through ensemble-averaged gradient and additional optimization directions induced by the Kraus operators. Extensive experiments on classification tasks using trainable amplitude-damping and phase-damping channels confirm enhanced optimization dynamics and predictive performance. In addition, we experimentally validate the proposed framework through hardware inference using ten-qubit quantum models implemented on the superconducting quantum processor, confirming its practical feasibility and hardware compatibility. Our work provides a principled approach for leveraging quantum channels as trainable resources and advances the design of high-performance quantum learning architectures.

quant-ph

Accurate and Scalable Simulation of Cavity-Based Networks in Modular Quantum Architectures

Cavity-mediated interconnects are a promising platform for scaling modular quantum computers by enabling high-fidelity inter-chip quantum state transmission and entanglement generation. In this work, we first model the dynamics of deterministic inter-chip quantum state transfer using the Stimulated Raman Adiabatic Passage (STIRAP) protocol, analyzing fidelity loss mechanisms under experimentally achievable qubit-cavity coupling and decoherence parameters. We then extend the NetSquid simulator, typically used for simulating long-range quantum communication networks, to support cavity-based communication channels for mediating inter-chip state transfer and entanglement generation. We model cavities as amplitude damping channels parameterized by physical system characteristics; cavity decay rate k and qubit-cavity coupling strength g, and analyze the impact of intrinsic qubit decoherence factors dictated by T1 and T2 times. Our simulations accurately represent the system's dynamics in both strong and weak coupling regimes, and identify critical trade-offs between fidelity, latency, and noise factors. The proposed framework supports faithful modeling and scalable simulation of modular architectures, and provides insights into design optimization for practical quantum network implementations.

quant-ph

A Time-Symmetric Quantum Algorithm for Direct Eigenstate Determination

Time symmetry in quantum mechanics, where the current quantum state is determined jointly by both the past and the future, offers a more comprehensive description of physical phenomena. This symmetry facilitates both forward and backward time evolution, providing a computational advantage over methods that rely on a fixed time direction. In this work, we present a nonvariational and \textit{time-symmetric quantum algorithm} for addressing the eigenvalue problem of the Hamiltonian, leveraging the coherence between forward and backward time evolution. Our approach enables the simultaneous determination of both the ground state and the highest excited state, as well as the direct identification of arbitrary eigenstates of the Hamiltonian. Unlike existing methods, our algorithm eliminates the need for prior computation of lower eigenstates, allowing for the direct extraction of any eigenstate and energy bandwidth while avoiding error accumulation. Its non-variational nature ensures convergence to target states without encountering the barren plateau problem. We demonstrate the feasibility of implementing the non-unitary evolution using both the linear combination of unitaries and quantum Monte Carlo methods. Our algorithm is applied to compute the energy bandwidth and spectrum of various molecular systems, as well as to identify topological states in condensed matter systems, including the Kane-Mele model and the Su-Schrieffer-Heeger model. We anticipate that this algorithm will provide an efficient solution for eigenvalue problems, particularly in distinguishing quantum phases and calculating energy bands.

quant-ph

Accelerating quantum adiabatic evolution with $\pi$-pulse sequences

In quantum information processing, the development of fast and robust control schemes remains a central challenge. Although quantum adiabatic evolution is inherently robust against control errors, it typically demands long evolution times. In this work, we propose to achieve rapid adiabatic evolution, in which nonadiabatic transitions induced by fast changes in the system Hamiltonian are mitigated by flipping the nonadiabatic transition matrix using $\pi$ pulses. This enables a faster realization of adiabatic evolution while preserving its robustness. We demonstrate the effectiveness of our scheme in both two-level and three-level systems. Numerical simulations show that, for the same evolution duration, our scheme achieves higher fidelity and significantly suppresses nonadiabatic transitions compared to the traditional STIRAP protocol.

quant-ph

Speeding up adiabatic holonomic quantum gates via $\pi$-pulse modulation

Holonomic quantum computation (HQC) offers an inherently robust approach to quantum gate implementation by exploiting quantum holonomies. While adiabatic HQC benefits from robustness against certain control errors, its long runtime limits practical utility due to increased exposure to environmental noise. Nonadiabatic HQC addresses this issue by enabling faster gate operations but compromises robustness. In this work, we propose a scheme for fast holonomic quantum gates based on the $\pi$-pulse method, which accelerates adiabatic evolution while preserving its robustness. By guiding the system Hamiltonian along geodesic paths in the parameter space and applying phase-modulating $\pi$ pulses at discrete points, we realize a universal set of holonomic gates beyond the conventional adiabatic limit. Our scheme allows for arbitrary single-qubit and two-qubit controlled gates within a single-loop evolution and provides additional tunable parameters for flexible gate design. These results demonstrate a promising path toward high-fidelity, fast, and robust quantum computation.

quant-ph

Modeling Quantum Links for the Exploration of Distributed Quantum Computing Systems

Quantum computing offers the potential to solve certain complex problems, yet, scaling monolithic processors remains a major challenge. Modular and distributed architectures are proposed to build large-scale quantum systems while bringing the security advantages of quantum communication. At present, this requires accurate and computationally efficient models of quantum links across different scales to advance system design and guide experimental prototyping. In this work, we review protocols and models for estimating latency, losses, and fidelity in quantum communication primitives relying on quantum state distribution via microwave photons. We also propose a scalable simulation framework to support the design and evaluation of future distributed quantum computing systems.

quant-ph

MindSpore Quantum: A User-Friendly, High-Performance, and AI-Compatible Quantum Computing Framework

We introduce MindSpore Quantum, a pioneering hybrid quantum-classical framework with a primary focus on the design and implementation of noisy intermediate-scale quantum (NISQ) algorithms. Leveraging the robust support of MindSpore, an advanced open-source deep learning training/inference framework, MindSpore Quantum exhibits exceptional efficiency in the design and training of variational quantum algorithms on both CPU and GPU platforms, delivering remarkable performance. Furthermore, this framework places a strong emphasis on enhancing the operational efficiency of quantum algorithms when executed on real quantum hardware. This encompasses the development of algorithms for quantum circuit compilation and qubit mapping, crucial components for achieving optimal performance on quantum processors. In addition to the core framework, we introduce QuPack, a meticulously crafted quantum computing acceleration engine. QuPack significantly accelerates the simulation speed of MindSpore Quantum, particularly in variational quantum eigensolver (VQE), quantum approximate optimization algorithm (QAOA), and tensor network simulations, providing astonishing speed. This combination of cutting-edge technologies empowers researchers and practitioners to explore the frontiers of quantum computing with unprecedented efficiency and performance.

quant-ph

Quantum Resonant Dimensionality Reduction and Its Application in Quantum Machine Learning

Quantum computing is a promising candidate for accelerating machine learning tasks. Limited by the control accuracy of current quantum hardware, reducing the consumption of quantum resources is the key to achieving quantum advantage. Here, we propose a quantum resonant dimension reduction (QRDR) algorithm based on the quantum resonant transition to reduce the dimension of input data and accelerate the quantum machine learning algorithms. After QRDR, the dimension of input data $N$ can be reduced into desired scale $R$, and the effective information of the original data will be preserved correspondingly, which will reduce the computational complexity of subsequent quantum machine learning algorithms or quantum storage. QRDR operates with polylogarithmic time complexity and reduces the error dependency from the order of $1/\epsilon^3$ to the order of $1/\epsilon$, compared to existing algorithms. We demonstrate the performance of our algorithm combining with two types of quantum classifiers, quantum support vector machines and quantum convolutional neural networks, for classifying underwater detection targets and quantum many-body phase respectively. The simulation results indicate that reduced data improved the processing efficiency and accuracy following the application of QRDR. As quantum machine learning continues to advance, our algorithm has the potential to be utilized in a variety of computing fields.

quant-ph

One-photon-interference quantum secure direct communication

Quantum secure direct communication (QSDC) is a quantum communication paradigm that transmits confidential messages directly using quantum states. Measurement-device-independent (MDI) QSDC protocols can eliminate the security loopholes associated with measurement devices. To enhance the practicality and performance of MDI-QSDC protocols, we propose a one-photon-interference MDI QSDC (OPI-QSDC) protocol which transcends the need for quantum memory, ideal single-photon sources, or entangled light sources. The security of our OPI-QSDC protocol has also been analyzed using quantum wiretap channel theory. Furthermore, our protocol could double the distance of usual prepare-and-measure protocols, since quantum states sending from adjacent nodes are connected with single-photon interference, which demonstrates its potential to extend the communication distance for point-to-point QSDC.

quant-ph

Mixed-encoding one-photon-interference quantum secure direct communication

Quantum secure direct communication (QSDC) guarantees both the security and reliability of information transmission using quantum states. One-photon-interference QSDC (OPI-QSDC) is a technique that enhances the transmission distance and ensures secure point-to-point information transmission, but it requires complex phase locking technology. This paper proposes a mixed-encoding one-photon-interference QSDC (MO-QSDC) protocol that removes the need for phase locking technology. Numerical simulations demonstrate that the MO-QSDC protocol could also beat the PLOB bound.

quant-ph

Protecting logical qubits with dynamical decoupling

Demonstrating that logical qubits outperform their physical counterparts is a milestone for achieving reliable quantum computation. Here, we propose to protect logical qubits with a novel dynamical decoupling scheme that implements iSWAP gates on nearest-neighbor physical qubits, and experimentally demonstrate the scheme on superconducting transmon qubits. In our scheme, each logical qubit only requires two physical qubits. A universal set of quantum gates on the logical qubits can be achieved such that each logical gate comprises only one or two physical gates. Our experiments reveal that the coherence time of a logical qubit is extended by up to 366% when compared to the better-performing physical qubit. Moreover, to the best of our knowledge, we demonstrate for the first time that multiple logical qubits outperform their physical counterparts in superconducting qubits. We illustrate a set of universal gates through a logical Ramsey experiment and the creation of a logical Bell state. Given its scalable nature, our scheme holds promise as a component for future reliable quantum computation.

quant-ph

Investigation of a non-Hermitian edge burst with time-dependent perturbation theory

Edge burst is a phenomenon in non-Hermitian quantum dynamics discovered by a recent numerical study [W.-T. Xue, et al, Phys. Rev. Lett 2, 128.120401(2022)]. It finds that a large proportion of particle loss occurs at the system boundary in a class of non-Hermitian quantum walk. In this paper, we investigate the evolution of real-space wave functions for this lattice system. We find the wave function of the edge site is distinct from the bulk sites. Using time-dependent perturbation theory, we derive the analytical expression of the real-space wave functions and find that the different evolution behaviors between the edge and bulk sites are due to their different nearest-neighbor site configurations. We also find the edge wave function primarily results from the transition of the two nearest-neighbor non-decay sites. Besides, the numerical diagonalization shows the edge wave function is mainly propagated by a group of eigen-modes with a relatively large imaginary part. Our work provides an analytical method for studying non-Hermitian quantum dynamical problems.

quant-ph

High speed free-space optical communication using standard fiber communication component without optical amplification

Free-space optical communication (FSO) can achieve fast, secure and license-free communication without need for physical cables, making it a cost-effective, energy-efficient and flexible solution when the fiber connection is unavailable. To establish FSO connection on-demand, it is essential to build portable FSO devices with compact structure and light weight. Here, we develop a miniaturized FSO system and realize 9.16 Gbps FSO between two nodes that is 1 km apart, using a commercial single-mode-fiber-coupled optical transceiver module without optical amplification. Using our 4-stage acquisition, pointing and tracking (APT) systems, the tracking error is within 3 {\mu}rad and results an average link loss of 13.7 dB, which is the key for this high-bandwidth FSO demonstration without optical amplification. Our FSO link has been tested up to 4 km, with link loss of 18 dB that is limited by the foggy weather during the test. Longer FSO distances can be expected with better weather condition and optical amplification. With single FSO device weight of only 9.5 kg, this result arouses massive applications of field-deployable high-speed wireless communication.

eess.SP

Dynamics simulation and numerical analysis of arbitrary time-dependent $\mathcal{PT}$-symmetric system based on density operators

$\mathcal{PT}$-symmetric system has attracted extensive attention in recent years because of its unique properties and applications. How to simulate $\mathcal{PT}$-symmetric system in traditional quantum mechanical system has not only fundamental theoretical significance but also practical value. We propose a dynamics simulation scheme of arbitrary time-dependent $\mathcal{PT}$-symmetric system based on density operators, and the results are compatible with previous methods based on pure-state vectors. Based on the above, we are able to study the influence of quantum noises on the simulation results with the technique of vectorization of density operators and matrixization of superoperators (VDMS), and we show the depolarizing (Dep) noise is the most fatal and should be avoided as much as possible. Meanwhile, we also give a numerical analysis. We find that the problem of chronological product usually has to be solved not only in the numerical calculation, but also even in the experiment, because the dilated higher-dimensional Hamiltonian is usually time-dependent. Through theoretical analysis and numerical calculation, we find that on the premise of meeting the goal of calculation accuracy and saving computing resources, the time step of calculation and the cut-off term of Magnus series have to be carefully balanced.

quant-ph

A full circuit-based quantum algorithm for excited-states in quantum chemistry

Utilizing quantum computer to investigate quantum chemistry is an important research field nowadays. In addition to the ground-state problems that have been widely studied, the determination of excited-states plays a crucial role in the prediction and modeling of chemical reactions and other physical processes. Here, we propose a non-variational full circuit-based quantum algorithm for obtaining the excited-state spectrum of a quantum chemistry Hamiltonian. Compared with previous classical-quantum hybrid variational algorithms, our method eliminates the classical optimization process, reduces the resource cost caused by the interaction between different systems, and achieves faster convergence rate and stronger robustness against noise without barren plateau. The parameter updating for determining the next energy-level is naturally dependent on the energy measurement outputs of the previous energy-level and can be realized by only modifying the state preparation process of ancillary system, introducing little additional resource overhead. Numerical simulations of the algorithm with hydrogen, LiH, H2O and NH3 molecules are presented. Furthermore, we offer an experimental demonstration of the algorithm on a superconducting quantum computing platform, and the results show a good agreement with theoretical expectations. The algorithm can be widely applied to various Hamiltonian spectrum determination problems on the fault-tolerant quantum computers.

quant-ph

Stable States with Non-Zero Entropy under Broken $\mathcal{PT}$-Symmetry

The $\mathcal{PT}$-symmetric non-Hermitian systems have been widely studied and explored both in theory and in experiment these years due to various interesting features. In this work, we focus on the dynamical features of a triple-qubit system, one of which evolves under local $\mathcal{PT}$-symmetric Hamiltonian. A new kind of abnormal dynamic pattern in the entropy evolution process is identified, which presents a parameter-dependent stable state, determined by the non-Hermiticity of Hamiltonian in the broken phase of $\mathcal{PT}$-symmetry. The entanglement and mutual information of a two-body subsystem can increase beyond the initial values, which do not exist in the Hermitian and two-qubit $\mathcal{PT}$-symmetric systems. Moreover, an experimental demonstration of the stable states in non-Hermitian system with non-zero entropy and entanglement is realized on a four-qubit quantum simulator with nuclear spins. Our work reveals the distinctive dynamic features in the triple-qubit $\mathcal{PT}$-symmetric system and paves the way for practical quantum simulation of multi-party non-Hermitian system on quantum computers.

quant-ph

Generic Security Analysis Framework for Quantum Secure Direct Communication

Quantum secure direct communication provides a direct means of conveying secret information via quantum states among legitimate users. The past two decades have witnessed its great strides both theoretically and experimentally. However, the security analysis of it still stays in its infant. Some practical problems in this field to be solved urgently, such as detector efficiency mismatch, side-channel effect and source imperfection, are propelling the birth of a more impeccable solution. In this paper, we establish a new framework of the security analysis driven by numerics where all the practical problems may be taken into account naturally. We apply this framework to several variations of the DL04 protocol considering real-world experimental conditions. Also, we propose two optimizing methods to process the numerical part of the framework so as to meet different requirements in practice. With these properties considered, we predict the robust framework would open up a broad avenue of the development in the field.

quant-ph

Robust Preparation of Many-body Ground States in Jaynes-Cummings Lattices

Strongly-correlated polaritons in Jaynes-Cummings (JC) lattices can exhibit quantum phase transitions between the Mott-insulating and superfluid phases at integer fillings. The prerequisite to observe such phase transitions is to pump polariton excitations into a JC lattice and prepare them into appropriate ground states. Despite previous efforts, it is still challenging to generate many-body states with high accuracy. Here we present an approach for the robust preparation of many-body ground states of polaritons in finite-sized JC lattices by optimized nonlinear ramping. We apply a Landau-Zener type of estimation to this finite-sized system and derive the optimal ramping index for selected ramping trajectories, which can greatly improve the fidelity of the prepared states. With numerical simulation, we show that by choosing an appropriate ramping trajectory, the fidelity in this approach can remain close to unity in almost the entire parameter space. This approach can shed light on high-fidelity state preparation in quantum simulators and advance the implementation of quantum simulation with practical devices.

quant-ph