Nengkun Yu
YOU?
Author Swipe
View article: Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains
Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains Open
Verifying quantum systems has attracted a lot of interest in the last decades.In this paper, we study the quantitative model-checking of quantum continuous-time Markov chains (quantum CTMCs). The branching-time properties of quantum CTMCs …
View article: Scalable Equivalence Checking and Verification of Shallow Quantum Circuits
Scalable Equivalence Checking and Verification of Shallow Quantum Circuits Open
This paper concerns the problem of checking whether two shallow (i.e., constant-depth) quantum circuits perform equivalent computations. Equivalence checking is a fundamental correctness question—needed, for example, to ensure that transfo…
View article: Adaptivity is not helpful for Pauli channel learning
Adaptivity is not helpful for Pauli channel learning Open
We prove that adaptive strategies offer no advantage over non-adaptive ones for learning and testing Pauli channels using entangled inputs. This key observation allows us to characterize the query complexity for several fundamental tasks b…
View article: Towards Efficient Verification of Computation in Quantum Devices
Towards Efficient Verification of Computation in Quantum Devices Open
Designing quantum processors is a complex task that demands advanced verification methods to ensure their correct functionality. However, traditional methods of comprehensively verifying quantum devices, such as quantum process tomography,…
View article: Entanglement Certification by Measuring Nonlocality
Entanglement Certification by Measuring Nonlocality Open
Reliable verification of entanglement is a central requirement for quantum networks. This paper presents a practical verification approach based on violations of the Clauser-Horne-Shimony-Holt (CHSH) inequality. We derive tight mathematica…
View article: A Logic for Approximate Quantitative Reasoning about Quantum Circuits
A Logic for Approximate Quantitative Reasoning about Quantum Circuits Open
Reasoning about quantum programs remains a fundamental challenge, regardless of the programming model or computational paradigm. Despite extensive research, existing verification techniques are insufficient -- even for quantum circuits, a …
View article: Tight Bound for Quantum Unitary Time-Reversal
Tight Bound for Quantum Unitary Time-Reversal Open
Time-reversal of unitary evolution is fundamental in quantum information processing. Many scenarios, particularly those in quantum learning and metrology, assume free access to the time-reverse of an unknown unitary. In this paper, we sett…
View article: Pauli measurements are not optimal for single-copy tomography
Pauli measurements are not optimal for single-copy tomography Open
Quantum state tomography is a fundamental problem in quantum computing. Given $n$ copies of an unknown $N$-qubit state $ρ\in \mathbb{C}^{d \times d},d=2^N$, the goal is to learn the state up to an accuracy $ε$ in trace distance, with at le…
View article: What if you have only one copy? Low-depth quantum circuits have no advantage in decision problems!
What if you have only one copy? Low-depth quantum circuits have no advantage in decision problems! Open
The conventional approach to understanding the characteristics of an unknown quantum state involves having numerous identical independent copies of the system in that state. However, we demonstrate that gleaning insights into specific prop…
View article: Optimal implementation of quantum gates with two controls
Optimal implementation of quantum gates with two controls Open
We give a detailed proof of a well-known theorem in quantum computing. The theorem characterizes the number of two-qubit gates that is necessary for implementing three-qubit quantum gates with two controls. For example, the theorem implies…
View article: Adaptivity is not helpful for Pauli channel learning
Adaptivity is not helpful for Pauli channel learning Open
We prove that adaptive strategies offer no advantage over non-adaptive ones for learning and testing Pauli channels using entangled inputs. This key observation allows us to characterize the query complexity for several fundamental tasks b…
View article: Approximate Relational Reasoning for Quantum Programs
Approximate Relational Reasoning for Quantum Programs Open
Quantum computation is inevitably subject to imperfections in its implementation. These imperfections arise from various sources, including environmental noise at the hardware level and the introduction of approximate implementations by qu…
View article: Learning marginals suffices!
Learning marginals suffices! Open
Beyond computer science, quantum complexity theory can potentially revolutionize multiple branches of physics, ranging from quantum many-body systems to quantum field theory. In this paper, we investigate the relationship between the sampl…
View article: Accelerating Voting by Quantum Computation
Accelerating Voting by Quantum Computation Open
Studying the computational complexity and designing fast algorithms for determining winners under voting rules are classical and fundamental questions in computational social choice. In this paper, we accelerate voting by leveraging quantu…
View article: The QQUIC Transport Protocol: Quantum-Assisted UDP Internet Connections
The QQUIC Transport Protocol: Quantum-Assisted UDP Internet Connections Open
Quantum key distribution, initialized in 1984, is a commercialized secure communication method that enables two parties to produce a shared random secret key using quantum mechanics. We propose a QQUIC (Quantum-assisted Quick UDP Internet …
View article: Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem
Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem Open
The quantum coupling of two given quantum states denotes the set of bipartite states whose marginal states are these given two states. In this paper, we provide tight inequalities to describe the structure of quantum coupling. These inequa…
View article: Sample optimal tomography of quantum Markov chains
Sample optimal tomography of quantum Markov chains Open
A state on a tripartite quantum system $\mathcal{H}_{A}\otimes \mathcal{H}_{B}\otimes\mathcal{H}_{C} $ forms a Markov chain, i.e., quantum conditional independence, if it can be reconstructed from its marginal on $\mathcal{H}_{A}\otimes \m…
View article: Comments on and Corrections to “When Is the Chernoff Exponent for Quantum Operations Finite?”
Comments on and Corrections to “When Is the Chernoff Exponent for Quantum Operations Finite?” Open
In the above article [1] , we add some missing citations in the Notations and Preliminaries section. The new Notations and Preliminaries section is as follows.
View article: On incorrectness logic for Quantum programs
On incorrectness logic for Quantum programs Open
Bug-catching is important for developing quantum programs. Motivated by the incorrectness logic for classical programs, we propose an incorrectness logic towards a logical foundation for static bug-catching in quantum programming. The vali…
View article: A Probabilistic Logic for Verifying Continuous-time Markov Chains
A Probabilistic Logic for Verifying Continuous-time Markov Chains Open
A continuous-time Markov chain (CTMC) execution is a continuous class of probability distributions over states. This paper proposes a probabilistic linear-time temporal logic, namely continuous-time linear logic (CLL), to reason about the …
View article: Quantum Max-Flow Min-Cut theorem
Quantum Max-Flow Min-Cut theorem Open
The max-flow min-cut theorem is a cornerstone result in combinatorial optimization. Calegari et al. (arXiv:0802.3208) initialized the study of quantum max-flow min-cut conjecture, which connects the rank of a tensor network and the min-cut…
View article: Model Checking Quantum Continuous-Time Markov Chains
Model Checking Quantum Continuous-Time Markov Chains Open
Verifying quantum systems has attracted a lot of interests in the last decades. In this paper, we initialised the model checking of quantum continuous-time Markov chain (QCTMC). As a real-time system, we specify the temporal properties on …
View article: A Quantum Interpretation of Bunched Logic for Quantum Separation Logic
A Quantum Interpretation of Bunched Logic for Quantum Separation Logic Open
We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states. In our model, the separating conjunction of BI describes separable quantum states. We develop a program logic w…
View article: LOCC protocols with bounded width per round optimize convex functions
LOCC protocols with bounded width per round optimize convex functions Open
We start with the task of discriminating finitely many multipartite quantum states using LOCC protocols, with the goal to optimize the probability of correctly identifying the state. We provide two different methods to show that finitely m…
View article: Protocols for Packet Quantum Network Intercommunication
Protocols for Packet Quantum Network Intercommunication Open
A quantum network, which involves multiple parties pinging each other with quantum messages, could revolutionize communication, computing and basic sciences. The future internet will be a global system of various packet switching quantum a…
View article: Discrimination of quantum states under locality constraints in the many-copy setting
Discrimination of quantum states under locality constraints in the many-copy setting Open
We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state against its orthogonal complement state via the local oper…
View article: Projection-based runtime assertions for testing and debugging Quantum programs
Projection-based runtime assertions for testing and debugging Quantum programs Open
In this paper, we propose Proq, a runtime assertion scheme for testing and debugging quantum programs on a quantum computer. The predicates in Proq are represented by projections (or equivalently, closed subspaces of the state space), foll…
View article: Sample optimal Quantum identity testing via Pauli Measurements
Sample optimal Quantum identity testing via Pauli Measurements Open
In this paper, we show that $Θ(\mathrm{poly}(n)\cdot\frac{4^n}{ε^2})$ is the sample complexity of testing whether two $n$-qubit quantum states $ρ$ and $σ$ are identical or $ε$-far in trace distance using two-outcome Pauli measurements.
View article: Sample efficient tomography via Pauli Measurements
Sample efficient tomography via Pauli Measurements Open
Pauli Measurements are the most important measurements in both theoretical and experimental aspects of quantum information science. In this paper, we explore the power of Pauli measurements in the state tomography related problems. Firstly…
View article: Experimental Quantification of Coherence of a Tunable Quantum Detector
Experimental Quantification of Coherence of a Tunable Quantum Detector Open
Quantum coherence is a fundamental resource that quantum technologies exploit to achieve performance beyond that of classical devices. A necessary prerequisite to achieve this advantage is the ability of measurement devices to detect coher…