Related papers: Constant Time Quantum search Algorithm Over A Data…
Quantum simulation is a potentially powerful application of quantum computing, holding the promise to be able to emulate interesting quantum systems beyond the reach of classical computing methods. Despite such promising applications, and…
We introduce a novel quantum algorithm for the lattice Boltzmann method (LBM) based on the one-step simplified LBM. The structure of the algorithm allows for more flexibility in modelling different physics in contrast to earlier quantum…
Quantum simulation is one of the key applications of quantum computing, which accelerates research and development in the fields such as chemistry and material science. The recent development of noisy intermediate-scale quantum (NISQ)…
The rapid development of quantum computing (QC) in the NISQ era urgently demands a low-level benchmark suite and insightful evaluation metrics for characterizing the properties of prototype NISQ devices, the efficiency of QC programming…
In this work, we study quantum computing algorithms for accelerating causal inference. Specifically, we consider the formalism of causal hypothesis testing presented in [\textit{Nat Commun} 10, 1472 (2019)]. We develop a quantum circuit…
One of the greatest challenges for current quantum computing hardware is how to obtain reliable results from noisy devices. A recent paper [A. Kandala et al., Nature 567, 491 (2019)] described a method for injecting noise by stretching gate…
Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are…
The Quantum Skip Gate (QSG) is a unitary circuit primitive that coherently superposes the execution and omission of an expensive quantum subroutine based on the outcome of a cheaper preceding subroutine, without mid-circuit measurement or…
Quantum computers are on the verge of becoming a commercially available reality. They represent a paradigm shift in computing, with a steep learning gradient. The creation of games is a way to ease the transition for beginners. We present a…
As research on building scalable quantum computers advances, it is important to be able to certify their correctness. Due to the exponential hardness of classically simulating quantum computation, straight-forward verification through…
The optimal runtime of a quantum computer searching a database is typically cited as the square root of the number of items in the database, which is famously achieved by Grover's algorithm. With parallel oracles, however, it is possible to…
A recent experiment testing the necessity of complex numbers in the standard formulation of quantum theory is recreated using IBM quantum computers. To motivate the experiment, we present a basic construction for real-valued quantum theory.…
The study of quantum channels is the fundamental field and promises wide range of applications, because any physical process can be represented as a quantum channel transforming an initial state into a final state. Inspired by the method…
A Quantum Computer is a new type of computer which can solve problems such as factoring and database search very efficiently. The usefulness of a quantum computer is limited by the effect of two different types of errors, decoherence and…
Quantum network coding has been proposed to improve resource utilization to support distributed computation but has not yet been put in to practice. We investigate a particular implementation of quantum network coding using…
Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…
Quantum walk has emerged as an essential tool for searching marked vertices on various graphs. Recent advances in the discrete-time quantum walk search algorithm have enabled it to effectively handle multiple marked vertices, expanding its…
Quantum computing (QC) provides a promising avenue toward enabling quantum chemistry calculations, which are classically impossible due to a computational complexity that increases exponentially with system size. As fully fault-tolerant…
We demonstrate an implementation of a quantum search algorithm on a two qubit NMR quantum computer based on cytosine.
Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a…