Related papers: On the Hardness of Analyzing Quantum Programs Quan…
A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…
In support of the growing interest in quantum computing experimentation, programmers need new tools to write quantum algorithms as program code. Compared to debugging classical programs, debugging quantum programs is difficult because…
Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for…
Quantum query complexity has several nice properties with respect to composition. First, bounded-error quantum query algorithms can be composed without incurring log factors through error reduction (exactness). Second, through careful…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…
Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called the lambda-q calculus that addresses the fundamental…
Accurate models for open quantum systems -- quantum states that have non-trivial interactions with their environment -- may aid in the advancement of a diverse array of fields, including quantum computation, informatics, and the prediction…
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…
Computational methods are the most effective tools we have besides scientific experiments to explore the properties of complex biological systems. Progress is slowing because digital silicon computers have reached their limits in terms of…
Quantum computation is a topic of significant recent interest, with practical advances coming from both research and industry. A major challenge in quantum programming is dealing with errors (quantum noise) during execution. Because quantum…
Physical processes in the quantum regime possess non-classical properties of quantum mechanics. However, methods for quantitatively identifying such processes are still lacking. Accordingly, in this study, we develop a framework for…
Recent advances in the development of commercial quantum annealers such as the D-Wave 2X allow solving NP-hard optimization problems that can be expressed as quadratic unconstrained binary programs. However, the relatively small number of…
The incorporation of quantum ansatz with machine learning classification models demonstrates the ability to extract patterns from data for classification tasks. However, taking advantage of the enhanced computational power of quantum…
We propose an approach to quantum computing in which quantum gate strengths are parametrized by quantum degrees of freedom, and the capability of the quantum computer to perform desired tasks is monitored and gradually improved by…
Current state-of-the-art quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent cost Hamiltonian suitable for the quantum device. Implementing…
When scheduling quantum operations, a shorter overall execution time of the resulting schedule yields a better throughput and higher fidelity output. In this paper, we demonstrate that quantum operation scheduling can be interpreted as a…
Quantum computing has demonstrated the potential to solve computationally intensive problems more efficiently than classical methods. Many software engineering tasks, such as test case selection, static analysis, code clone detection, and…
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…
Various benchmarking metrics have been developed to quantify the performance of quantum computing hardware and help evaluate development. However, it is not always necessary to know the metric values precisely. This is especially true for…
Quantum counting is the task of determining the dimension of the subspace of states that are accepted by a quantum verifier circuit. It is the quantum analog of counting the number of valid solutions to NP problems -- a problem well-studied…