Related papers: A Synthesis Method for Quaternary Quantum Logic Ci…
Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…
One of the main advantages of an optical approach to quantum computing is the fact that optical fibers can be used to connect the logic and memory devices to form useful circuits, in analogy with the wires of a conventional computer. Here…
A major hurdle to the deployment of quantum linear systems algorithms and recent quantum simulation algorithms lies in the difficulty to find inexpensive reversible circuits for arithmetic using existing hand coded methods. Motivated by…
Constructing general programmable circuits to be able to run any given unitary operator efficiently on a quantum processor is of fundamental importance. We present a new quantum circuit design technique resulting two general programmable…
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…
Quantum computing leverages the unique properties of qubits and quantum parallelism to solve problems intractable for classical systems, offering unparalleled computational potential. However, the optimization of quantum circuits remains…
Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act on a superposition of inputs. These have to be compiled to a…
In this article the elementary gates for ternary quantum logic circuit are studied. We propose the ternary controlled X (TCX) gate or ternary controlled Z (TCZ) gate as two-qutrit elementary gate, which is universal when assisted by…
Compiling quantum circuits into Clifford+$T$ gates is a central task for fault-tolerant quantum computing using stabilizer codes. In the near term, $T$ gates will dominate the cost of fault tolerant implementations, and any reduction in the…
Reversible computation is gaining increasing relevance in the context of several post-CMOS technologies, the most prominent of those being Quantum computing. One of the key theoretical problem pertaining to reversible logic synthesis is the…
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 paper discusses various applications of permutation group theory in the synthesis of reversible logic circuits consisting of Toffoli gates with negative control lines. An asymptotically optimal synthesis algorithm for circuits…
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 describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic…
We perform optimal-control-theory calculations to determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. By considering all possible gate…
We discuss the implementation of quantum algorithms for lattice $\Phi^4$ theory on circuit quantum electrodynamics (cQED) system. The field is represented on qudits in a discretized field amplitude basis. The main advantage of qudit systems…
Quantum algorithms for scientific computing require modules implementing fundamental functions, such as the square root, the logarithm, and others. We require algorithms that have a well-controlled numerical error, that are uniformly…
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…
In the Noisy Intermediate Scale Quantum (NISQ) era, finding implementations of quantum algorithms that minimize the number of expensive and error prone multi-qubit gates is vital to ensure computations produce meaningful outputs. Unitary…
Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom and arbitrarily long coherence time. In Noisy Intermediate-Scale Quantum (NISQ) devices, however, the…