activity
20242026
most citedSymbolic Analysis of Grover Search Algorithm via Chain-of-Thought Reasoning and Quantum-Native Tokenization

2 citations · 2 across the 9 of their papers we have counts for

collaborators
Showing quant-phShow all

10 papers · 1 filter

quant-ph2026

Quantum-Resistant Quantum Teleportation

Xin Jin, Nitish Kumar Chandra, Mohadeseh Azari +4

We propose a quantum-resistant quantum teleportation (QRQT) framework protected by post-quantum cryptography (PQC) to secure the classical correction channel, which is vulnerable t…

quant-ph2025

Provably Efficient Quantum Algorithms for Solving Nonlinear Differential Equations Using Multiple Bosonic Modes Coupled with Qubits

Yu Gan, Hirad Alipanah, Jinglei Cheng +7

Quantum computers have long been expected to efficiently solve complex classical differential equations. Most digital, fault-tolerant approaches use Carleman linearization to map n…

quant-ph2025

Optimizing Compilation for Distributed Quantum Computing via Clustering and Annealing

Ruilin Zhou, Jinglei Cheng, Yuhang Gan +2

Efficiently mapping quantum programs onto Distributed quantum computing (DQC) are challenging, particularly when considering the heterogeneous quantum processing units (QPUs) with…

quant-ph2025

Symbolic Analysis of Grover Search Algorithm via Chain-of-Thought Reasoning and Quantum-Native Tokenization

Min Chen, Jinglei Cheng, Pingzhi Li +3

Understanding the high-level conceptual structure of quantum algorithms from their low-level circuit representations is a critical task for verification, debugging, and education.…

quant-ph2025

Quantum repeaters enhanced by vacuum beam guides

Yu Gan, Mohadeseh Azari, Nitish Kumar Chandra +4

The development of large-scale quantum communication networks faces critical challenges due to photon loss and decoherence in optical fiber channels. These fundamentally limit tran…

quant-ph2025

Towards identifying possible fault-tolerant advantage of quantum linear system algorithms in terms of space, time and energy

Yue Tu, Mark Dubynskyi, Mohammadhossein Mohammadisiahroudi +5

Quantum computing, a prominent non-Von Neumann paradigm beyond Moore's law, can offer superpolynomial speedups for certain problems. Yet its advantages in efficiency for tasks like…