A5071969266- Quantum Computing Algorithms and Architecture
- Formal Methods in Verification
- Machine Learning and Algorithms
- Computability, Logic, AI Algorithms
- Quantum Mechanics and Applications
- Quantum Information and Cryptography
- Low-power high-performance VLSI design
- Model Reduction and Neural Networks
- Advanced biosensing and bioanalysis techniques
- Software Testing and Debugging Techniques
- Bayesian Modeling and Causal Inference
- Software Reliability and Analysis Research
- MicroRNA in disease regulation
- Real-Time Systems Scheduling
- Zebrafish Biomedical Research Applications
- Blockchain Technology Applications and Security
- Advanced Memory and Neural Computing
- Receptor Mechanisms and Signaling
- Radiation Effects in Electronics
Leiden University
2024
Shanghai Key Laboratory of Trustworthy Computing
2021-2022
East China Normal University
2021-2022
Suzhou University of Science and Technology
2018
Quantum circuit compilation comprises many computationally hard reasoning tasks that nonetheless lie inside #$\mathbf{P}$ and its decision counterpart in $\mathbf{PP}$. The classical simulation of general quantum circuits is a core example. We show for the first time strong universal can be efficiently tackled through weighted model counting by providing linear encoding Clifford+T circuits. To achieve this, we exploit stabilizer formalism Knill, Gottesmann, Aaronson fact states form basis...
Verifying equivalence between two quantum circuits is a hard problem, that nonetheless crucial in compiling and optimizing algorithms for real-world devices. This paper gives Turing reduction of the (universal) problem to weighted model counting (WMC). Our starting point folklore theorem showing checking can be done so-called Pauli-basis. We combine this insight with WMC encoding circuit simulation, which we extend support Toffoli gate. Finally, prove weights computed by counter indeed...
This tutorial introduces quantum computing with a focus on the applicability of formal methods in this relatively new domain. We describe circuits and convey an understanding their inherent combinatorial nature exponential blow-up that makes them hard to analyze. Then, we show how weighted model counting (\#SAT) can be used solve analysis tasks for circuits. is aimed at everyone community interest computing. Familiarity not required, but basic linear algebra knowledge (particularly matrix...
Verifying quantum systems has attracted a lot of interest in the last decades. In this paper, we study quantitative model-checking continuous-time Markov chains (quantum CTMCs). The branching-time properties CTMCs are specified by continuous stochastic logic (CSL), which is famous for verifying real-time systems, including classical CTMCs. core checking CSL formulas lies tackling multiphase until formulas. We develop an algebraic method using proper projection, matrix exponentiation, and...
Verifying quantum systems has attracted a lot of interests in the last decades. In this paper, we initialised model checking continuous-time Markov chain (QCTMC). As real-time system, specify temporal properties on QCTMC by signal logic (STL). To effectively check atomic propositions STL, develop state-of-art real root isolation algorithm under Schanuel's conjecture; further, general STL formula interval operations with bottom-up fashion, whose query complexity turns out to be linear size...
Fidelity is one of the most widely used quantities in quantum information that measure distance states through a noisy channel. In this paper, we introduce analogy computation tree logic (CTL) called QCTL, which concerns fidelity instead probability probabilistic CTL, over Markov chains (QMCs). Noisy channels are modelled by super-operators, specified QCTL formulas; initial density operators, left parametric given QMC. The problem to compute minimumfidelity all for conservation. We achieve...