Related papers: Warp-Drive Quantum Computation
As quantum processing units grow in size and precision we enter the stage where quantum algorithms can be tested on actual quantum devices. To implement a given quantum circuit on a given quantum device, one has to express the circuit in…
Solving real-world optimization problems with quantum computing requires choosing between a large number of options concerning formulation, encoding, algorithm and hardware. Finding good solution paths is challenging for end users and…
Quantum computing is a promising candidate for accelerating machine learning tasks. Limited by the control accuracy of current quantum hardware, reducing the consumption of quantum resources is the key to achieving quantum advantage. Here,…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
Compilation and optimization of quantum circuits are critical components in the execution of algorithms on quantum computers. These components must successfully balance two competing priorities: minimizing the number of expensive resources,…
The paper examines the prominent algorithm D-MORPH to search for the optimal control of a quantum system in order to implement desired unitary evolution of the quantum system at the final time, and reveals new mathematical expressions for…
One of the principal obstacles on the way to quantum computers is the lack of distinguished basis in the space of unitary evolutions and thus the lack of the commonly accepted set of basic operations (universal gates). A natural choice,…
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…
Quantum approaches to combinatorial optimization problems (COPs) are often limited by the resource demands of Quadratic Unconstrained Binary Optimization (QUBO) encodings, which enlarge circuits through penalty terms and increase qubit and…
Quantum computing has garnered attention for its potential to solve complex computational problems with considerable speedup. Despite notable advancements in the field, achieving meaningful scalability and noise control in quantum hardware…
A quantum computer based on an asymmetric coupled dot system has been proposed and shown to operate as the controlled-NOT-gate. The basic idea is (1) the electron is localized in one of the asymmetric coupled dots. (2)The electron transfer…
We propose a method for quantum computation which uses control of spin-orbit coupling in a linear array of single electron quantum dots. Quantum gates are carried out by pulsing the exchange interaction between neighboring electron spins,…
Optimizing the mRNA codon has an essential impact on gene expression for a specific target protein. It is an NP-hard problem; thus, exact solutions to such optimization problems become computationally intractable for realistic problem sizes…
Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a…
While many classical algorithms rely on Laplace transforms, it has remained an open question whether these operations could be implemented efficiently on quantum computers. In this work, we introduce the Quantum Laplace Transform (QLT),…
Quantum optimal control plays a crucial role in the development of quantum technologies, particularly in the design and implementation of fast and accurate gates for quantum computing. Here, we present a method to synthesize gates using the…
We present a method for optimizing quantum circuits architecture. The method is based on the notion of "quantum comb", which describes a circuit board in which one can insert variable subcircuits. The method allows one to efficiently…
Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to…
Quantum optimization, a key application of quantum computing, has traditionally been stymied by the linearly increasing complexity of gradient calculations with an increasing number of parameters. This work bridges the gap between Koopman…
Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…