Related papers: Efficient quantum circuits for dense and non-unita…
In a previous paper, we described a computer program called Qubiter which can decompose an arbitrary unitary matrix into elementary operations of the type used in quantum computation. In this paper, we describe a method of reducing the…
Simple, precise, and robust control is demanded for operating a large quantum information processor. However, existing routes to high-fidelity quantum control rely heavily on arbitrary waveform generators that are difficult to scale up.…
Quantum circuit simulation is a challenging computational problem crucial for quantum computing research and development. The predominant approaches in this area center on tensor networks, prized for their better concurrency and less…
Quantum-circuit optimization is essential for any practical realization of quantum computation, in order to beat decoherence. We present a scheme for implementing the final stage in the compilation of quantum circuits, i.e., for finding the…
We show that certain computational algorithms can be simulated on a quantum computer with exponential efficiency and be insensitive to phase errors. Our explicit algorithm simulates accurately the classical chaotic dynamics for…
We consider quantum circuits composed of single-qubit operations and global entangling gates generated by Ising-type Hamiltonians. It is shown that such circuits can implement a large class of unitary operators commonly used in quantum…
We describe rules to simplify quantum circuits at their boundaries, i.e. at state preparation and measurement. There, any strictly incoherent operation may be pushed into a pre- or post-processing of classical data. The rules can greatly…
Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum (NISQ)…
The random matrix ensembles are applied to the quantum chaotic systems. The quantum systems are studied using the finite dimensional real, complex and quaternion Hilbert spaces of the eigenfunctions. The linear operators describing the…
Quantum circuits which perform integer arithmetic could potentially outperform their classical counterparts. In this paper, a quantum circuit is considered which performs a specific computational pattern on classically represented integers…
We demonstrate quantum algorithms to implement pseudo-random operators that closely reproduce statistical properties of random matrices from the three universal classes: unitary, symmetric, and symplectic. Modified versions of the…
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum…
The multisilce method is an important algorithm for electron diffraction and image simulations in transmission electron microscopy. We have proposed a quantum algorithm of the multislice method based on quantum circuit model previously. In…
Quantum computing is arguably one of the most revolutionary and disruptive technologies of this century. Due to the ever-increasing number of potential applications as well as the continuing rise in complexity, the development, simulation,…
Running quantum algorithms often involves implementing complex quantum circuits with such a large number of multi-qubit gates that the challenge of tackling practical applications appears daunting. To date, no experiments have successfully…
We introduce a hybrid quantum-classical framework for efficiently implementing approximate unitary dilations of non-unitary operators with enhanced noise resilience. The method embeds a target non-unitary operator into a subblock of a…
Recent years have seen unprecedented advance in the design and control of quantum computers. Nonetheless, their applicability is still restricted and access remains expensive. Therefore, a substantial amount of quantum algorithms research…
We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures -- we refer to it as entanglement circulation. The procedure involves optimization…
From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either…
Optimization of circuits is an essential task for both quantum and classical computers to improve their efficiency. In contrast, classical logic optimization is known to be difficult, and a lot of heuristic approaches have been developed so…