Search Results for author:
Found 14 papers, 5 papers with code
Detecting Violations of Differential Privacy for Quantum Algorithms
Quantum algorithms for solving a wide range of practical problems have been proposed in the last ten years, such as data search and analysis, product recommendation, and credit scoring.
Differentiable Quantum Programming with Unbounded Loops
The emergence of variational quantum applications has led to the development of automatic differentiation techniques in quantum computing.
Verifying Fairness in Quantum Machine Learning
In this work, we define a formal framework for the fairness verification and analysis of quantum machine learning decision models, where we adopt one of the most popular notions of fairness in the literature based on the intuition -- any two similar individuals must be treated similarly and are thus unbiased.
Software Pipelining for Quantum Loop Programs
We propose a method for performing software pipelining on quantum for-loop programs, exploiting parallelism in and across iterations.
Quantum Algorithm for Lexicographically Minimal String Rotation
Lexicographically minimal string rotation (LMSR) is a problem to find the minimal one among all rotations of a string in the lexicographical order, which is widely used in equality checking of graphs, polygons, automata and chemical structures.
Quantum Physics Computational Complexity Data Structures and Algorithms
A Tensor Network based Decision Diagram for Representation of Quantum Circuits
Tensor networks have been successfully applied in simulation of quantum physical systems for decades.
Quantum Physics Data Structures and Algorithms
Robustness Verification of Quantum Classifiers
Our approach is implemented on Google's TensorFlow Quantum and can verify the robustness of quantum machine learning algorithms with respect to a small disturbance of noises, derived from the surrounding environment.
Proq: Projection-based Runtime Assertions for Debugging on a Quantum Computer
In this paper, we propose Proq, a runtime assertion scheme for testing and debugging quantum programs on a quantum computer.
Equivalence Checking of Quantum Finite-State Machines
In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them.
Formal Languages and Automata Theory Quantum Physics
Equivalence Checking of Sequential Quantum Circuits
This difficulty is resolved by our main theorem showing that equivalence checking of two quantum Mealy machines can be done with input sequences that are taken from some chosen basis (which are finite) and have a length quadratic in the dimensions of the state Hilbert spaces of the machines.
Quantum Physics
Quantum Supremacy Circuit Simulation on Sunway TaihuLight
We design a large-scale simulator of universal random quantum circuits, often called 'quantum supremacy circuits', and implement it on Sunway TaihuLight.
Quantum Physics
Quantum Privacy-Preserving Perceptron
Secondly when updating the current classifier, private random noise is used to protect the original data.
Quantum Privacy-Preserving Data Mining
Data mining is a key technology in big data analytics and it can discover understandable knowledge (patterns) hidden in large data sets.
Hoare Logic for Quantum Programs
Hoare logic is a foundation of axiomatic semantics of classical programs and it provides effective proof techniques for reasoning about correctness of classical programs.
Quantum Physics
