Related papers: Quantum circuit synthesis using Householder transf…
The quantum matter synthesizer (QMS) is a new quantum simulation platform in which individual particles in a lattice can be resolved and re-arranged into arbitrary patterns. The ability to spatially manipulate ultracold atoms and control…
Current noisy intermediate-scale quantum (NISQ) devices can only execute small circuits with shallow depth, as they are still constrained by the presence of noise: quantum gates have error rates and quantum states are fragile due to…
The method is introduced for fast data processing by reducing the probability amplitudes of undesirable elements. The algorithm has a mathematical description and circuit implementation on a quantum processor. The idea is to make a quick…
Quantum circuits consist of gates applied to qubits. Current quantum hardware platforms impose connectivity restrictions on binary CX gates. Hence, Layout Synthesis is an important step to transpile quantum circuits before they can be…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…
We show how techniques from machine learning and optimization can be used to find circuits of photonic quantum computers that perform a desired transformation between input and output states. In the simplest case of a single input state,…
Recently, it is shown that quantum computers can be used for obtaining certain information about the solution of a linear system Ax=b exponentially faster than what is possible with classical computation. Here we first review some key…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
Due to the great difficulty in scalability, quantum computers are limited in the number of qubits during the early stages of the quantum computing regime. In addition to the required qubits for storing the corresponding eigenvector, suppose…
Quantum compilation is the process of decomposing high-level quantum algorithms or arbitrary unitary operations into quantum circuits composed of a specific set of quantum gates. Neutral atom quantum computing platform is a quantum…
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to make the best use of near-term quantum devices. We introduce…
Quantum Layout Synthesis (QLS) maps a logical quantum circuit to a physical quantum platform. Optimal QLS minimizes circuit size and depth, which is essential to reduce the noise on current quantum platforms. Optimal QLS is an NP-hard…
Quantum state preparation is a fundamental component of quantum algorithms, particularly in quantum machine learning and data processing, where classical data must be encoded efficiently into quantum states. Existing amplitude encoding…
We propose the variational quantum singular value decomposition based on encoding the elements of the considered { $N\times N$} matrix into the state of a quantum system of appropriate dimension. This method doesn't use the expansion of…
Quantum compiling aims to construct a quantum circuit V by quantum gates drawn from a native gate alphabet, which is functionally equivalent to the target unitary U. It is a crucial stage for the running of quantum algorithms on noisy…
We devise greedy heuristics tailored for synthesizing quantum circuits that implement a specified set of Pauli rotations. Our heuristics are designed to minimize either the count of entangling gates or the depth of entangling gates, and…
We propose a method of compiling that permits to identify quantum circuits able to simulate arbitrary $n$-qubit unitary operations via the adjustment of angles in single-qubit gates therein. The method of compiling itself extends older…
We give an overview of the circuit optimisation methods used by tket, a compiler system for quantum software developed by Cambridge Quantum Computing Ltd. We focus on a novel technique based around phase gadgets, a family of multi-qubit…
We introduce AQCtensor, a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS). Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum…
Linear Nearest Neighbor (LNN) synthesis in reversible circuits has emerged as an important issue in terms of technological implementation for quantum computation. The objective is to obtain a LNN architecture with minimum gate cost. As…