SearcharxivSearch

arXiv subjects

Xian Lu

Publications and source records attributed to Xian Lu.

5 recordsLinked to original sources

Aicir: A Full-Stack Quantum Circuit Simulator with AscendNPU Support

Quantum computing is a promising way to study problems that are difficult for classical methods, but current quantum hardware still faces limits in scale, noise, and fidelity. Running quantum algorithms on physical machines can also be costly. Quantum circuit simulators therefore remain important because they let researchers design and test algorithms on classical computers before using quantum hardware. Most high-performance simulators provide GPU backends, while few offer native support for NPUs. This gap limits the computing platforms available for quantum-algorithm research. We developed Aicir to provide a full-stack quantum circuit simulator with a native Huawei Ascend NPU backend. Aicir connects circuit construction, several state representations, measurement, differentiation, variational algorithms, quantum machine learning, and quantum architecture search through one programming model. It also supports noise simulation, tensor-network and matrix-product-state engines, and distributed state simulation. On the NPU, paired real tensors, fixed-rank gate views, and hardware-specific formulas keep the tested simulation paths on the device. The same representation lets Aicir partition a state across $2^{p}$ NPUs while retaining reverse-mode differentiation. We validated native execution with CPU fallback disabled and checked distributed communication and gradients on 2, 4, and 8 NPUs. For the tested fused layered circuits, Aicir's CPU runtime is within $0.97$--$1.28\times$ that of Qiskit Aer and $0.76$--$1.10\times$ that of Cirq. These results place its CPU execution in the same range as established simulators for this workload, while the NPU tests establish correct native execution rather than CPU-to-NPU speedup.

quant-ph

Quantum Computing for MIMO Beam Selection Problem: Model and Optical Experimental Solution

Massive multiple-input multiple-output (MIMO) has gained widespread popularity in recent years due to its ability to increase data rates, improve signal quality, and provide better coverage in challenging environments. In this paper, we investigate the MIMO beam selection (MBS) problem, which is proven to be NP-hard and computationally intractable. To deal with this problem, quantum computing that can provide faster and more efficient solutions to large-scale combinatorial optimization is considered. MBS is formulated in a quadratic unbounded binary optimization form and solved with Coherent Ising Machine (CIM) physical machine. We compare the performance of our solution with two classic heuristics, simulated annealing and Tabu search. The results demonstrate an average performance improvement by a factor of 261.23 and 20.6, respectively, which shows that CIM-based solution performs significantly better in terms of selecting the optimal subset of beams. This work shows great promise for practical 5G operation and promotes the application of quantum computing in solving computationally hard problems in communication.

cs.NI

Correlation Measurement of an unknown state with Weak Coupling

Traditionally, quantum state correlation can be obtained with calculations on a state density matrix already known. Here, we propose a model with which correlations of unknown quantum states can be obtained. There are no needs of classical communication in the course of coupling, optimization and complicated calculations. All we need are weak coupling and ancillary systems. We detail the model on the state in which particles belong to the different owners. A concisely example is elaborated in the last part of this paper.

quant-ph

Lower bound of local quantum uncertainty for high-dimensional bipartite quantum systems

Quantum correlations are of fundamental importance in quantum phenomena and quantum information processing studies. The measure of quantum correlations is one central issue. The recently proposed measure of quantum correlations, the local quantum uncertainty (LQU), satisfies the full physical requirements of a measure of quantum correlations. In this work, by using operator relaxation, a closed form lower bound of the LQU for arbitrary-dimensional bipartite quantum states is derived. We have compared the lower bound and the optimized LQU for several typical quantum states.

quant-ph

Turing machines based on unsharp quantum logic

In this paper, we consider Turing machines based on unsharp quantum logic. For a lattice-ordered quantum multiple-valued (MV) algebra E, we introduce E-valued non-deterministic Turing machines (ENTMs) and E-valued deterministic Turing machines (EDTMs). We discuss different E-valued recursively enumerable languages from width-first and depth-first recognition. We find that width-first recognition is equal to or less than depth-first recognition in general. The equivalence requires an underlying E value lattice to degenerate into an MV algebra. We also study variants of ENTMs. ENTMs with a classical initial state and ENTMs with a classical final state have the same power as ENTMs with quantum initial and final states. In particular, the latter can be simulated by ENTMs with classical transitions under a certain condition. Using these findings, we prove that ENTMs are not equivalent to EDTMs and that ENTMs are more powerful than EDTMs. This is a notable difference from the classical Turing machines.

cs.LO