Related papers: Efficient Inversion of Unknown Unitary Operations …
Rational functions are exceptionally powerful tools in scientific computing, yet their abilities to advance quantum algorithms remain largely untapped. In this paper, we introduce effective implementations of rational transformations of a…
We present a new algorithm for reducing an arbitrary unitary matrix into a sequence of elementary operations (operations such as controlled-nots and qubit rotations). Such a sequence of operations can be used to manipulate an array of…
Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work has constructed unitary designs and pseudorandom unitaries…
Quantum computers have the opportunity to be transformative for a variety of computational tasks. Recently, there have been proposals to use the unsimulatably of large quantum devices to perform regression, classification, and other machine…
Modern computation relies crucially on modular architectures, breaking a complex algorithm into self-contained subroutines. A client can then call upon a remote server to implement parts of the computation independently via an application…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
By means of a simple example it is demonstrated that the task of finding and identifying certain patterns in an otherwise (macroscopically) unstructured picture (data set) can be accomplished efficiently by a quantum computer. Employing the…
We examine how to distinguish between unitary operators, when the exact form of the possible operators is not known. Instead we are supplied with "programs" in the form of unitary transforms, which can be used as references for identifying…
Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…
In recent years quantum simulation has made great strides culminating in experiments that operate in a regime that existing supercomputers cannot easily simulate. Although this raises the possibility that special purpose analog quantum…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Faster algorithms, novel cryptographic mechanisms, and alternative methods of communication become possible when the model underlying information and computation changes from a classical mechanical model to a quantum mechanical one. Quantum…
Quantum-inspired algorithms can deliver substantial speedups over classical state-of-the-art methods by executing quantum algorithms with tensor networks on conventional hardware. Unlike circuit models restricted to unitary gates, tensor…
We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body…
Quantum computing uses the physical principles of very small systems to develop computing platforms which can solve problems that are intractable on conventional supercomputers. There are challenges not only in building the required…
Quantum computers are capable of efficiently contracting unitary tensor networks, a task that is likely to remain difficult for classical computers. For instance, networks based on matrix product states or the multi-scale entanglement…
The efficient validation of quantum devices is critical for emerging technological applications. In a wide class of use-cases the precise engineering of a Hamiltonian is required both for the implementation of gate-based quantum information…
Realizing non-unitary transformations on unitary-gate based quantum devices is critically important for simulating a variety of physical problems including open quantum systems and subnormalized quantum states. We present a dilation based…
This paper introduces a novel approach to implementing non-unitary linear transformations of basis on quantum computational platforms, a significant leap beyond the conventional unitary methods. By integrating Singular Value Decomposition…
A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are…