Related papers: Asymptotically Optimal Circuit Depth for Quantum S…
The Variational Quantum Eigensolver (VQE) is a method of choice to solve the electronic structure problem for molecules on near-term gate-based quantum computers. However, the circuit depth is expected to grow significantly with problem…
State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state…
Although many of works have been done in multivalued quantum logic synthesis, the question whether multivalued quantum circuits are more efficient than the conventional binary quantum circuits is still open. In this article we devote to the…
Parallel computation enables multiple processors to execute different parts of a task simultaneously, improving processing speed and efficiency. In quantum computing, parallel gate implementation involves executing gates independently in…
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,…
Quantum algorithms for unstructured search problems rely on the preparation of a uniform superposition, traditionally achieved through Hadamard gates. However, this incidentally creates an auxiliary search space consisting of nonsensical…
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,…
Quantum circuit complexity is a fundamental concept whose importance permeates quantum information, computation, many-body physics and high-energy physics. While extensively studied in closed systems, its characterization and behaviors in…
To ensure resilience against the unavoidable noise in quantum computers, quantum information needs to be encoded using an error-correcting code, and circuits must have a particular structure to be fault-tolerant. Compilation of…
We show how to explicitly construct an $O(nd)$ size and constant quantum depth circuit which encodes any given $n$-qubit stabilizer code with $d$ generators. Our construction is derived using the graphic description for stabilizer codes and…
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations…
The amplitude encoding of an arbitrary $n$-qubit state vector requires $\Omega(2^n)$ gate operations, owing to the exponential dimension of the Hilbert space. We can, however, form dimensionality-reduced representations of quantum states…
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…
We present an algorithm for building a circuit that approximates single qubit unitaries with precision {\epsilon} using O(log(1/{\epsilon})) Clifford and T gates and employing up to two ancillary qubits. The algorithm for computing our…
Any potential application of quantum computing, once encoded as a quantum circuit, needs to be compiled in order to be executed on a quantum computer. Deciding which qubit technology, which device, which compiler, and which corresponding…
Future quantum computers capable of solving relevant problems will require a large number of qubits that can be operated reliably. However, the requirements of having a large qubit count and operating with high-fidelity are typically…
With recent advancements in quantum computing technology, optimizing quantum circuits and ensuring reliable quantum state preparation have become increasingly vital. Traditional methods often demand extensive expertise and manual…
The ability to fault-tolerantly prepare CAT states, also known as multi-qubit GHZ states, is an important primitive for quantum error correction. It is required for Shor-style syndrome extraction, and can also be used as a subroutine for…
Achieving practical quantum advantage on near-term noisy hardware is a central goal of quantum computation. However, without efficient pre-execution diagnostics, circuit design and scheme selection often rely on costly hardware-in-the-loop…
In this paper, I take a step toward answering the following question: for m different small circuits that compute m orthogonal n qubit states, is there a small circuit that will map m computational basis states to these m states without any…