In the paper an approach is presented allowing to model quantum logic circuits by electronic gates for discrete spatially modulated electromagnetic signals. The designed circuitry is for modeling low scale quantum nets of general design and quantum devices based only on superposition principle of their work.
We describe a practical method of constructing quantum combinational logic circuits with basic quantum logic gates such as NOT and general $n$-bit Toffoli gates. This method is useful to find the quantum circuits for evaluating logic functions in the form most appropriate for implementation on a given quantum computer. The rules to get the most efficient circuit are utilized best with the aid of a Karnaugh map. It is explained which rules of using a Karnaugh map are changed due to the difference between the quantum and classical logic circuits.
We analyse the design and optimisation of quantum logic circuits suitable for the experimental demonstration of a three-qubit quantum computation prototype based on optically-controlled, solid-state quantum logic gates. In these gates, the interaction between two qubits carried by the electron-spin of donors is mediated by the optical excitation of a control particle placed in their proximity. First, we use a geometrical approach for analysing the entangling characteristics of these quantum gates. Then, using a genetic programming algorithm, we develop circuits for the refined Deutsch-Jozsa al…
We report the observation of Electromagnetically Induced Transparency (EIT) of a mechanical field, where a superconducting artificial atom is coupled to a 1D-transmission line for surface acoustic waves. An electromagnetic microwave drive is used as the control field, rendering the superconducting transmon qubit transparent to the acoustic probe beam. The strong frequency dependence of the acoustic coupling enables EIT in a ladder configuration due to the suppressed relaxation of the upper level. Our results show that superconducting circuits can be engineered to interact with acoustic fields …
We propose a new scheme of measurement-based quantum computation (MBQC) using an error-correcting code against photon-loss in circuit quantum electrodynamics. We describe a specific protocol of logical single-qubit gates given by sequential cavity measurements for logical MBQC and a generalised Schrödinger cat state is used for a continuous-variable (CV) logical qubit captured in a microwave cavity. It is assumed that a three CV-qudit entangled state is initially prepared in three jointed cavities and the microwave qudit states are individually controlled, operated, and measured through a read…
Recent research in multi-valued logic for quantum computing has shown practical advantages for scaling up a quantum computer. Multivalued quantum systems have also been used in the framework of quantum cryptography, and the concept of a qudit cluster state has been proposed by generalizing the qubit cluster state. An evolutionary algorithm based synthesizer for ternary quantum circuits has recently been presented, as well as a synthesis method based on matrix factorization.In this paper, a recursive synthesis method for ternary quantum circuits based on the Cosine-Sine unitary matrix decomposi…
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 arbitrary one-qutrit gates. It is primitive, efficient and easy to implement. Based on Cartan decomposition, we also give the one-qutrit elementary gates. Then the synthesis of some important ternary gates is investigated and the scheme of physical implementation for these ternary gates is discussed. Finally we extend these elementary gates to more general qudit ca…
A breadth-first search method for determining optimal 3-line circuits composed of quantum NOT, CNOT, controlled-V and controlled-V+ (NCV) gates is introduced. Results are presented for simple gate count and for technology motivated cost metrics. The optimal NCV circuits are also compared to NCV circuits derived from optimal NOT, CNOT and Toffoli (NCT) gate circuits. The work presented here provides basic results and motivation for continued study of the direct synthesis of NCV circuits, and establishes relations between function realizations in different circuit cost metrics.
We propose the generalized controlled X (GCX) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and show that it is feasible with current technology. With these elementary gates many important qudit quantum gates can be synthesized conveniently. We provide efficient methods for the synthesis of various kinds of controlled qudit gates and greatly simplify the synthesis of existing generic multi-valued quantum circuits. Moreover, we generalize the quantum Sha…
Electromagnetically induced transparency (EIT) is a signature of quantum interference in an atomic three-level system. By driving the dressed cavity-qubit states of a two-dimensional circuit QED system, we generate a set of polariton states in the nesting regime. The lowest three energy levels are utilized to form the $Λ$-type system. EIT is observed and verified by Akaike's information criterion based testing. Negative group velocities up to $-0.52\pm0.09$ km/s are obtained based on the dispersion relation in the EIT transmission spectrum.
A logical system derived from linear logic and called QMLL is introduced and shown able to capture all unitary quantum circuits. Conversely, any proof is shown to compute, through a concrete GoI interpretation, some quantum circuits. The system QMLL, which enjoys cut-elimination, is obtained by endowing multiplicative linear logic with a quantum modality.
Here we show that to quantize any lumped element circuit, the circuit geometry must be included in a mathematical model of either the circuit fluxes or the circuit charges. By geometry of the circuit, we refer to the so-called parasitic inductances and capacitances that arise from the details of the circuit layout, which are well known to create noise in classical circuits. In contrast, the classical lumped element model describes only the topology of the circuit, which defines how different finite element variables are connected to one another by circuit components. By geometry we also refer …
In this paper we show that there is a direct correspondence between quantum Boolean operations and certain forms of classical (non-quantum) logic known as Reed-Muller expansions. This allows us to readily convert Boolean circuits into their quantum equivalents. A direct result of this is that the problem of synthesis and optimization of quantum Boolean logic can be tackled within the field of Reed-Muller logic.
The exponential speed up of quantum algorithms and the fundamental limits of current CMOS process for future design technology have directed attentions toward quantum circuits. In this paper, the matrix specification of a broad category of quantum circuits, i.e. CNOT-based circuits, are investigated. We prove that the matrix elements of CNOT-based circuits can only be zeros or ones. In addition, the columns or rows of such a matrix have exactly one element with the value of 1. Furthermore, we show that these specifications can be used to synthesize CNOT-based quantum circuits. In other words, …
Quantum error correction and fault-tolerant quantum computation are two fundamental concepts which make quantum computing feasible. While providing a theoretical means with which to ensure the arbitrary accuracy of any quantum circuit, fault-tolerant error correction is predicated upon the robust preparation of logical states. An optimal direct circuit and a more complex fault-tolerant circuit for the preparation of the [[7,1,3]] Steane logical-zero are simulated in the presence of discrete quantum errors to quantify the regime within which fault-tolerant preparation of logical states is prefe…
Synthesis of quaternary quantum circuits involves basic quaternary gates and logic operations in the quaternary quantum domain. In this paper, we propose new projection operations and quaternary logic gates for synthesizing quaternary logic functions. We also demonstrate the realization of the proposed gates using basic quantum quaternary operations. We then employ our synthesis method to design of quaternary adder and some benchmark circuits. Our results in terms of circuit cost, are better than the existing works.
Optimized Compilation of Logical Clifford Circuits
Fraunhofer IIS, Fraunhofer Institute for Integrated Circuits IIS(弗劳恩霍夫集成电路研究所);University of Würzburg(维尔茨堡大学);Friedrich-Alexander-Universität Erlangen-Nürnberg(埃尔朗根-纽伦堡弗里德里希·阿历克西斯大学)
Tohoku University(东北大学);Portland State University(波特兰州立大学)
It has been experimentally proven that realizing universal quantum gates using higher-radices logic is practically and technologically possible. We developed a Parallel Genetic Algorithm that synthesizes Boolean reversible circuits realized with a variety of quantum gates on qudits with various radices. In order to allow synthesizing circuits of medium sizes in the higher radix quantum space we performed the experiments using a GPU accelerated Genetic Algorithm. Using the accelerated GA we compare heuristic improvements to the mutation process based on cost minimization, on the adaptive cost o…
Single flux quantum (SFQ) logic is a promising candidate to replace the CMOS logic for high speed and low power applications due to its superiority in providing high performance and energy efficient circuits. However, developing effective Electronic Design Automation (EDA) tools, which cater to special characteristics and requirements of SFQ circuits such as depth minimization and path balancing, are essential to automate the whole process of designing large SFQ circuits. In this paper, a novel technology mapping tool, called SFQmap, is presented, which provides optimization methods for minimi…
The article is a short opinionated review of the quantum treatment of electromagnetic circuits, with no pretension to exhaustiveness. This review, which is an updated and modernized version of a previous set of Les Houches School lecture notes, has 3 main parts. The first part describes how to construct a Hamiltonian for a general circuit, which can include dissipative elements. The second part describes the quantization of the circuit, with an emphasis on the quantum treatment of dissipation. The final part focuses on the Josephson non-linear element and the main linear building blocks from w…
In his 2003 paper "Towards an algebraic theory of Boolean circuits", Lafont notes that the class of reversible circuits over a set of k truth values is finitely generated when k is odd. He cites a private communication for the proof. The purpose of this short note is to make the content of that communication available.
The study of quantum heat transport in superconducting circuits is significant for further understanding the connection between quantum mechanics and thermodynamics, and for possible applications for quantum information. The first experimental realisations of devices demonstrating photonic heat transport mediated by a qubit have already been designed and measured. Motivated by the analysis of such experimental results, and for future experimental designs, we numerically evaluate the photonic heat transport of qubit-resonator devices in the linear circuit regime through electromagnetic simulati…
We present a multilayer surface-electrode ion trap with embedded 3D microwave circuitry for implementing entangling quantum logic gates. We discuss the electromagnetic full-wave simulation procedure that has led to the trap design and the characterization of the resulting microwave field-pattern using a single ion as a local field probe. The results agree with simulations within the uncertainty; compared to previous traps, this design reduces detrimental AC Zeeman shifts by three orders of magnitude. The design presented here can be viewed as an entangling gate component in a library for surfa…
The multiplicative depth of a logic network over the gate basis $\{\land, \oplus, \neg\}$ is the largest number of $\land$ gates on any path from a primary input to a primary output in the network. We describe a dynamic programming based logic synthesis algorithm to reduce the multiplicative depth in logic networks. It makes use of cut enumeration, tree balancing, and exclusive sum-of-products (ESOP) representations. Our algorithm has applications to cryptography and quantum computing, as a reduction in the multiplicative depth directly translates to a lower $T$-depth of the corresponding quan…
Due to the unreliability and limited capacity of existing quantum computer prototypes, quantum circuit simulation continues to be a vital tool for validating next generation quantum computers and for studying variational quantum algorithms, which are among the leading candidates for useful quantum computation. Existing quantum circuit simulators do not address the common traits of variational algorithms, namely: 1) their ability to work with noisy qubits and operations, 2) their repeated execution of the same circuits but with different parameters, and 3) the fact that they sample from circuit…
Logical devices based on electrical currents are ubiquitous in modern society. However, digital logic does have some drawbacks such as a relatively high power consumption. It is therefore of great interest to seek alternative means to build logical circuits that can either work as stand-alone devices or in conjunction with more traditional electronic circuits. One direction that holds great promise is the use of heat currents for logical components. In the present paper, we discuss a recent abstract proposal for a quantum thermal transistor and provide a concrete design of such a device using …
We design logic circuits based on the notion of zero forcing on graphs; each gate of the circuits is a gadget in which zero forcing is performed. We show that such circuits can evaluate every monotone Boolean function. By using two vertices to encode each logical bit, we obtain universal computation. We also highlight a phenomenon of "back forcing" as a property of each function. Such a phenomenon occurs in a circuit when the input of gates which have been already used at a given time step is further modified by a computation actually performed at a later stage. Finally, we point out that zero…
A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons in Turaev-Viro quantum error correcting codes can be moved over a distance of order the code distance, and thus braided, by a constant depth local unitary quantum circuit followed by a permutation of qubits. Our gates are protected in the sense that the length of error strings do not grow by more than a constant factor. When applied to the Fibonacci code, ou…
This paper presents a physical mapping tool for quantum circuits, which generates the optimal Universal Logic Block (ULB) that can perform any logical fault-tolerant (FT) quantum operations with the minimum latency. The operation scheduling, placement, and qubit routing problems tackled by the quantum physical mapper are highly dependent on one another. More precisely, the scheduling solution affects the quality of the achievable placement solution due to resource pressures that may be created as a result of operation scheduling whereas the operation placement and qubit routing solutions influ…