12 citations · 57 across the 13 of their papers we have counts for
16 papers
ArcTN: Efficient Tensor-Network Contraction Planning for Quantum Circuit Simulation
Zhengyi Liu, Li Liu, Songtao Liu +7
Tensor-network simulation of quantum circuits depends on contraction orders with low computational cost and small intermediate tensors, found without excessive planning time. We pr…
Fast Template Matching for Quantum Circuits Using Hypergraph
Xin Hong, Jintao Yu, Runhong He +3
Quantum circuit optimization is a key step toward the efficient execution of quantum algorithms. Template matching has emerged as one of the dominant approaches for simplifying qua…
XBDD: A Highly Optimized ROBDD with Per-Edge Variable-Flip Maps
Yinglong Gan, Jintao Yu, Shenggang Ying +2
The Reduced Ordered Binary Decision Diagram (ROBDD) is a canonical representation of Boolean functions and is widely used in tasks such as equivalence checking and satisfiability c…
Oracle Synthesis Based on X-Map Decision Diagrams
Xin Hong, Kezhen Zhang, Aochu Dai +3
Quantum oracles act as reversible black-box operators that encode classical Boolean functions into quantum states, enabling efficient function evaluation in quantum superposition.…
Advancing Quantum State Preparation Using Decision Diagram with Local Invertible Maps
Xin Hong, Aochu Dai, Chenjian Li +3
Quantum state preparation (QSP) is a fundamental task in quantum computing and quantum information processing. It is critical to the execution of many quantum algorithms, including…
Utilizing Quantum Processor for the Analysis of Strongly Correlated Materials
Hengyue Li, Yusheng Yang, Pin Lv +4
This study introduces a systematic approach for analyzing strongly correlated systems by adapting the conventional quantum cluster method to a quantum circuit model. We have develo…
isQ: Towards a Practical Software Stack for Quantum Programming
Jingzhe Guo, Huazhe Lou, Riling Li +5
We introduce isQ, a new software stack for quantum programming in an imperative programming language, also named isQ. The aim of isQ is to make the programmers write quantum progra…
A Logic for Recursive Quantum Programs
Zhaowei Xu, Mingsheng Ying, Shenggang Ying
Most modern (classical) programming languages support recursion. Recursion has also been successfully applied to the design of several quantum algorithms and introduced in a couple…
Quantum Coupling and Strassen Theorem
Li Zhou, Shenggang Ying, Nengkun Yu +1
We introduce a quantum generalisation of the notion of coupling in probability theory. Several interesting examples and basic properties of quantum couplings are presented. In part…
Quantum Earth mover's distance, No-go Quantum Kantorovich-Rubinstein theorem, and Quantum Marginal Problem
Nengkun Yu, Li Zhou, Shenggang Ying +1
The earth mover's distance is a measure of the distance between two probabilistic measures. It plays a fundamental role in mathematics and computer science. The Kantorovich-Rubinst…
Quantum Privacy-Preserving Perceptron
Shenggang Ying, Mingsheng Ying, Yuan Feng
With the extensive applications of machine learning, the issue of private or sensitive data in the training examples becomes more and more serious: during the training process, per…
Quantum Privacy-Preserving Data Analytics
Shenggang Ying, Mingsheng Ying, Yuan Feng
Data analytics (such as association rule mining and decision tree mining) can discover useful statistical knowledge from a big data set. But protecting the privacy of the data prov…
Quantum Privacy-Preserving Data Mining
Shenggang Ying, Mingsheng Ying, Yuan Feng
Data mining is a key technology in big data analytics and it can discover understandable knowledge (patterns) hidden in large data sets. Association rule is one of the most useful…
Hardy is (almost) everywhere: nonlocality without inequalities for almost all entangled multipartite states
Samson Abramsky, Carmen M. Constantin, Shenggang Ying
We show that all -qubit entangled states, with the exception of tensor products of single-qubit and bipartite maximally-entangled states, admit Hardy-type proofs of non-locality…
Reachability Analysis of Quantum Markov Decision Processes
Shenggang Ying, Mingsheng Ying
We introduce the notion of quantum Markov decision process (qMDP) as a semantic model of nondeterministic and concurrent quantum programs. It is shown by examples that qMDPs can be…
Reachability Probabilities of Quantum Markov Chains
Shenggang Ying, Yuan Feng, Nengkun Yu +1
This paper studies three kinds of long-term behaviours, namely reachability, repeated reachability and persistence, of quantum Markov chains (qMCs). As a stepping-stone, we introdu…