Related papers: Synthesis of Ternary Quantum Logic Circuits by Dec…
Quantum circuit synthesis is the process in which an arbitrary unitary operation is decomposed into a sequence of gates from a universal set, typically one which a quantum computer can implement both efficiently and fault-tolerantly. As…
The leading paradigm for performing computation on quantum memories can be encapsulated as distill-then-synthesize. Initially, one performs several rounds of distillation to create high-fidelity magic states that provide one good T gate, an…
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…
We present a synthesis framework to map logic networks into quantum circuits for quantum computing. The synthesis framework is based on LUT networks (lookup-table networks), which play a key role in conventional logic synthesis.…
We present a simple algorithm that implements an arbitrary $n$-qubit unitary operator using a Clifford+T circuit with T-count $O(2^{4n/3} n^{2/3})$. This improves upon the previous best known upper bound of $O(2^{3n/2} n)$, while the best…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
Uncomputation is an essential part of reversible computing and plays a vital role in quantum computing. Using this technique, memory resources can be safely deallocated without performing a nonreversible deletion process. For the case of…
Decoupling systems into independently evolving components has a long history of simplifying seemingly complex systems. They enable a better understanding of the underlying dynamics and causal structures while providing more efficient means…
We show that quantum computation circuits with coherent states as the logical qubits can be constructed using very simple linear networks, conditional measurements and coherent superposition resource states.
We introduce the flag decomposition as a central tool for unitary synthesis. It lets us carve out a diagonal unitary with $2^n$ degrees of freedom in such a way that the remaining flag circuit is parametrized by the optimal number of…
We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to…
Quantum computation is conventionally performed using quantum operations acting on two-level quantum bits, or qubits. Qubits in modern quantum computers suffer from inevitable detrimental interactions with the environment that cause errors…
As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence…
While a couple of impressive quantum technologies have been proposed, they have several intrinsic limitations which must be considered by circuit designers to produce realizable circuits. Limited interaction distance between gate qubits is…
Quantum computation using electron spins in three coupled dot with different size is proposed. By using the energy selectivity of both photon assisted tunneling and spin rotation of electrons, logic gates are realized by static and…
Given an arbitrary $2^w \times 2^w$ unitary matrix $U$, a powerful matrix decomposition can be applied, leading to four different syntheses of a $w$-qubit quantum circuit performing the unitary transformation. The demonstration is based on…
Quantum error-correcting code for higher dimensional systems can, in general, be directly constructed from the codes for qubit systems. What remains unknown is whether there exist efficient code design techniques for higher dimensional…
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…
Representations of quantum computations are almost always based on a tensor product $\otimes$-structure. This coincides with what we are able to execute in our experiments, as well as what we observe in Nature, but it makes certain familiar…
Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network…