Coherent spaces spanned by a finite number of coherent states, are introduced. Their coherence properties are studied, using the Dirac contour representation. It is shown that the corresponding projectors resolve the identity, and that they transform into projectors of the same type, under displacement transformations, and also under time evolution. The set of these spaces, with the logical OR and AND operations is a distributive lattice, and with the logical XOR and AND operations is a Boolean ring (Stone\rq{}s formalism). Applications of this Boolean ring into classical CNOT gates with $n$-ary variables, and also quantum CNOT gates with coherent states, are discussed.
We explicitly derive a connection between quantum circuits utilising IBM's quantum gate set and multivariate quadratic polynomials over integers modulo 8. We demonstrate that the action of a quantum circuit over input qubits can be written as generalized Walsh-Hadamard transform. Here, we derive the polynomials corresponding to implementations of the Swap gate and Toffoli gate using IBM-Q gate set.
We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. The construction of the Hamilton operator for a quantum gate is also described with the Hamilton operator expressed as spin system. Computer algebra implementations are provided.
Robust Device-Independent Certification of Boolean-Phase Gates
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics（南京航空航天大学计算机科学与技术学院）；Faculty of Physics, University of Belgrade（贝尔格莱德大学物理学院）
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different designs, where the logical outputs are encoded either at fixed energy and spatial positioning of the quantum states, or at different energies. We use these results to construct quantum Boolean adders involving a minimal number of quantum states with the two designs. We also establish a matrix algebra giving an analogy between classical Boolean logic gates and …
To build a general-purpose quantum computer, it is crucial for the quantum devices to implement classical boolean logic. A straightforward realization of quantum boolean logic is to use auxiliary qubits as intermediate storage. This inefficient implementation causes a large number of auxiliary qubits to be used. In this paper, we have derived a systematic way of realizing any general m-to-n bit combinational boolean logic using elementary quantum gates. Our approach transforms the m-to-n bit classical mapping into a t-bit unitary quantum operation with minimum number of auxiliary qubits, then …
In this paper we propose a new approach to quantum neural networks. Our multi-layer architecture avoids the use of measurements that usually emulate the non-linear activation functions which are characteristic of the classical neural networks. Despite this, our proposed architecture is still able to learn any Boolean function. This ability arises from the correspondence that exists between a Boolean function and a particular quantum circuit made out of multi-controlled NOT gates. This correspondence is built via a polynomial representation of the function called the algebraic normal form. We u…
We develop a computation model for solving Boolean networks that implements wires through quantum ground-state computation and implements gates through identities following from angular momentum algebra and statistics. The gates are static in the sense that they contribute Hamiltonian 0 and hold as constants of the motion; only the wires are dynamic. Just as a spin 1/2 makes an ideal 1-bit memory element, a spin 1 makes an ideal 3-bit gate. Such gates cost no computation time: relaxing the wires alone solves the network. We compare computation time with that of an easier Boolean network where …
We describe a high-speed physical random number generator based on a hybrid Boolean network with autonomous and clocked logic gates, realized on a reconfigurable chip. The autonomous logic gates are arranged in a bidirectional ring topology and generate broadband chaos. The clocked logic gates receive input from the autonomous logic gates so that random numbers are generated physically that pass standard randomness tests without further post-processing. The large number of logic gates on reconfigurable chips allows for parallel generation of random numbers, as demonstrated by our implementatio…
We develop a computation model for solving Boolean networks by implementing wires through quantum ground-mode computation and gates through identities following from angular momentum algebra and statistics. Gates are represented by three-dimensional (triplet) symmetries due to particle indistinguishability and are identically satisfied throughout computation being constants of the motion. The relaxation of the wires yields the network solutions. Such gates cost no computation time, which is comparable with that of an easier Boolean network where all the gate constraints implemented as constant…
We present a constructive SAT-based algorithm to determine the multiplicative complexity of a Boolean function, i.e., the smallest number of AND gates in any logic network that consists of 2-input AND gates, 2-input XOR gates, and inverters. In order to speed-up solving time, we make use of several symmetry breaking constraints; these exploit properties of XAGs that may be useful beyond the proposed SAT-based algorithm. We further propose a heuristic post-optimization algorithm to reduce the number of XOR gates once the optimum number of AND gates has been obtained, which also makes use of SAT…
A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental two-bit gate for quantum computation. This gate plays a central role in networks for quantum error correction.
We propose a new way of implementing several elementary quantum gates for qubits in the coherent state basis. The operations are probabilistic and employ single photon subtractions as the driving force. Our schemes for single-qubit phase gate and two-qubit controlled phase gate are capable of achieving arbitrarily large phase shifts with currently available resources, which makes them suitable for the near-future tests of quantum information processing with superposed coherent states.
We discuss and experimentally demonstrate a probabilistic Hadamard gate for coherent state qubits. The scheme is based on linear optical components, non-classical resources and the joint projective action of a photon counter and a homodyne detector. We experimentally characterize the gate for the coherent states of the computational basis by full tomographic reconstruction of the transformed output states. Based on the parameters of the experiment we simulate the fidelity for all coherent state qubits on the Bloch sphere.
We propose a quantum state transfer from an atomic qubit to a cat-like qubit by means of one degenerate Raman interaction and one Hadamard gate operation for coherent states. We show that the coefficients of the atomic qubit can be mapped onto coherent state qubit, with an effective qubit state transfer.
We generalize quantum circuits for the Toffoli gate presented by Selinger and Jones for functionally controlled NOT gates, i.e., $X$ gates controlled by arbitrary $n$-variable Boolean functions. Our constructions target the gate set consisting of Clifford gates and single qubit rotations by arbitrary angles. Our constructions use the Walsh-Hadamard spectrum of Boolean functions and build on the work by Schuch and Siewert and Welch et al. We present quantum circuits for the case where the target qubit is in an arbitrary state as well as the special case where the target is in a known state. Add…
In this paper we explore the possibility of fundamental tests for coherent state optical quantum computing gates [T. C. Ralph, et. al, Phys. Rev. A \textbf{68}, 042319 (2003)] using sophisticated but not unrealistic quantum states. The major resource required in these gates are state diagonal to the basis states. We use the recent observation that a squeezed single photon state ($\hat{S}(r) \ket{1}$) approximates well an odd superposition of coherent states ($\ketα - \ket{-α}$) to address the diagonal resource problem. The approximation only holds for relatively small $α$ and hence these gates…
Entangling gates in trapped-ion quantum computing have primarily targeted stationary ions with initial motional distributions that are thermal and close to the ground state. However, future systems will likely incur significant non-thermal excitation due to, e.g., ion transport, longer operational times, and increased spatial extent of the trap array. In this paper, we analyze the impact of such coherent motional excitation on entangling-gate error by performing simulations of Molmer-Sorenson (MS) gates on a pair of trapped-ion qubits with both thermal and coherent excitation present in a shar…
For years, the quantum/reversible circuit community has been convinced that: a) the addition of auxiliary qubits is instrumental in constructing a smaller quantum circuit; and, b) the introduction of quantum gates inside reversible circuits may result in more efficient designs. This paper presents a systematic approach to optimizing reversible (and quantum) circuits via the introduction of auxiliary qubits and quantum gates inside circuit designs. This advances our understanding of what may be achieved with a) and b).
To generate arbitrary one- and two-qubit gates, the universal decompositions are usually used in quantum computing, and the universality of these decompositions has been demonstrated. However, in realistic experiments, gate errors may affect the universality of the universal decompositions. Here, we focus on the single-qubit-gate decomposition scheme and study the coherent-error effects on universality. We prove that, in the parameter space which we studied, some kinds of coherent errors will not affect the original universality, but some others will destroy it. We provide the definition and a…
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…
We discuss and implement experimentally a method for characterizing quantum gates operating on superpositions of coherent states. The peculiarity of this encoding of qubits is to work with a non-orthogonal basis, and therefore some technical limitations prevent us from using standard methods, such as process tomography. We adopt a different technique, that relies on some a-priori knowledge about the physics underlying the functioning of the device. A parameter characterizing the global quality of the quantum gate is obtained by \virtually" processing an entangled state.
We analyze the nonlinear optical response of a six-level atomic system under a configuration of electromagnetically induced transparency. The giant fifth-order nonlinearity generated in such a system with a relatively large cross-phase modulation effect can produce efficient three-way entanglement and may be used for realizing a three-qubit quantum phase gate. We demonstrate that such phase gate can be transferred to a Toffoli gate, facilitating practical applications in quantum information and computation.
Exterior calculus with its three operations meet, join and hodge star complement, is used for the representation of fermion-hole systems and for fermionic analogues of logical gates. Two different schemes that implement fermionic quantum computation, are proposed. The first scheme compares fermionic gates with Boolean gates, and leads to novel electronic devices that simulate fermionic gates. The second scheme usesa well known map between fermionic and multi-qubit systems, to simulate fermionic gates within multi-qubit systems.
We demonstrate a simple pulse shaping technique designed to improve the fidelity of spin-dependent force operations commonly used to implement entangling gates in trapped-ion systems. This extension of the Mølmer-Sørensen gate can theoretically suppress the effects of certain frequency and timing errors to any desired order and is demonstrated through Walsh modulation of a two-qubit entangling gate on trapped atomic ions. The technique is applicable to any system of qubits coupled through collective harmonic oscillator modes.
Rabi nutations of a single nuclear spin in a solid have been observed. The experiments were carried out on a single electron and a single 13C nuclear spin of a single nitrogen vacancy defect center in diamond. The system was used for implementation of quantum logical NOT and a conditional two-qubit gate (CROT). Density matrix tomography of the CROT gate shows that the gate fidelity achieved in our experiments is up to 0.9, good enough to be used in quantum algorithms.
We present a constructive method to create quantum circuits that implement oracles $|x\rangle|y\rangle|0\rangle^k \mapsto |x\rangle|y \oplus f(x)\rangle|0\rangle^k$ for $n$-variable Boolean functions $f$ with low $T$-count. In our method $f$ is given as a 2-regular Boolean logic network over the gate basis $\{\land, \oplus, 1\}$. Our construction leads to circuits with a $T$-count that is at most four times the number of AND nodes in the network. In addition, we propose a SAT-based method that allows us to trade qubits for $T$ gates, and explore the space/complexity trade-off of quantum circui…
We introduce a class of quantum adiabatic evolutions that we claim may be interpreted as the equivalents of the unitary gates of the quantum gate model. We argue that these gates form a universal set and may therefore be used as building blocks in the construction of arbitrary `adiabatic circuits', analogously to the manner in which gates are used in the circuit model. One implication of the above construction is that arbitrary classical boolean circuits as well as gate model circuits may be directly translated to adiabatic algorithms with no additional resources or complexities. We show that …
Two-qubit gates are important components of quantum computing. However, unwanted interactions between qubits (so-called parasitic gates) can be particularly problematic and degrade the performance of quantum applications. In this work, we present two software methods to mitigate parasitic two-qubit gate errors. The first approach is built upon the KAK decomposition and keeps the original unitary decomposition for the error-free native two-qubit gate. It counteracts a parasitic two-qubit gate by only applying single-qubit rotations and therefore has no two-qubit gate overhead. We show the optim…
Boolean and quantum circuits have commonalities and differences. To formalize the syntactical commonality we introduce syntactic circuits where the gates are black boxes. Syntactic circuits support various semantics. One semantics is provided by Boolean circuits, another by quantum circuits. Quantum semantics is a generalization of Boolean but, because of entanglement, the generalization is not straightforward. We consider only unitary quantum circuits here.
Experimental realizations of two qubit entangling gates with trapped ions typically rely on addressing spectroscopically resolved motional sidebands, limiting gate speed to the secular frequency. Fast entangling gates using ultrafast pulsed lasers overcome this speed limit. This approach is based on state-dependent photon recoil kicks from a sequence of counter-propagating, resonant, ultrafast pulse pairs, which can allow sub-microsecond gate speeds. Here we demonstrate a key component of the ultrafast gate protocol, the coherent excitation of a 171Yb+ ion across the 2S1/2-2P1/2 transition wit…
We introduce a new gate that transfers an arbitrary state of a qubit into a superposition of two quasi-orthogonal coherent states of a cavity mode, with opposite phases. This qcMAP gate is based on conditional qubit and cavity operations exploiting the energy level dispersive shifts, in the regime where they are much stronger than the cavity and qubit linewidths. The generation of multi-component superpositions of quasi-orthogonal coherent states, non-local entangled states of two resonators and multi-qubit GHZ states can be efficiently achieved by this gate.
A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision diagrams and introduce operators to manipulate the developed representation model. Furthermore, a recursive functional bi-decomposition approach is proposed to automatically synthesize a given function. While Boolean reversible logic is particularly addressed, our framework constructs intermediate quantum states that may be in superposition, hence we combine techniques from reversible Boolean logic and quantum computation. The proposed approach results in quadra…
In this work, we consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates $γ_k(t)$ (via time-dependent spectral density of incoherent photons) for generation of single-qubit gates for a two-level open quantum system which evolves according to the Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equation with time-dependent coefficients determined by these coherent and incohere…
Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits and devices. Here we propose to perform randomized benchmarking in a coherent way, where superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked, and in terms of efficiency and scalability. We show that e.g. universal gate sets, the set of $n-$qudit Pauli operators or more general sets including arbitrary …
A major challenge in operating multi-qubit quantum processors is to mitigate multi-qubit coherent errors. For superconducting circuits, besides crosstalk originating from imperfect isolation of control lines, dispersive coupling between qubits is a major source of multi-qubit coherent errors. We benchmark phase errors in a controlled-phase gate due to dispersive coupling of either of the qubits involved in the gate to one or more spectator qubits. We measure the associated gate infidelity using quantum process tomography. In addition, we point out that, due to coupling of the gate qubits to a …
We propose and demonstrate a method to characterize a gated InGaAs single-photon detector (SPD). Ultrashort weak coherent pulses, from a mode-locked sub-picosecond pulsed laser, were used to measure photon counts, at varying arrival times relative to the start of the SPD gate voltage. The uneven detection probabilities within the gate window were used to estimate the afterpulse probability with respect to various detector parameters: excess bias, width of gate window and hold-off time. We estimated a lifetime of 2.1 microseconds for the half-life of trapped carriers, using a power-law fit to t…
A classical logic gate connecting input and output light pulses is demonstrated. The gate operation is based on three steps: First, two incoming light pulses are stored in a Bose-Einstein condensate, second, atomic four-wave mixing generates a new matter wave, and third, the light pulses are retrieved. In the presence of the new matter wave, the retrieval generates a new optical wave. The latter will only be generated if both input light pulses are applied, thus realizing an AND gate. Finally, we show that the gate operation is phase coherent, an essential prerequisite for a quantum logic gate…
Solid state quantum processors based on spins in silicon quantum dots are emerging as a powerful platform for quantum information processing. High fidelity single- and two-qubit gates have recently been demonstrated and large extendable qubit arrays are now routinely fabricated. However, two-qubit gates are mediated through nearest-neighbor exchange interactions, which require direct wavefunction overlap. This limits the overall connectivity of these devices and is a major hurdle to realizing error correction, quantum random access memory, and multi-qubit quantum algorithms. To extend the conn…
Trapped ions are one of the most promising platforms for quantum computing due to the longest qubit coherence times and the highest gate fidelities. However, scaling the number of ions (qubits) in a linear Coulomb crystal is the key difficulty on the way to multi-qubit systems. One of the promising pathways to scale the number of qubits is to implement the pulsed non-adiabatic gates based on the sequence of State Dependent Kicks (SDKs). We have analytically and numerically studied the influence of coherent effects in the SDK sequence and, correspondingly, have deduced the influence of the indi…
Quantum walk with coherent multiple translations induces fast quantum gate operations
Shanghai Jiao Tong University（上海交通大学）；Northwest Normal University（西北师范大学）；Shandong Normal University（山东师范大学）；Shanghai Research Center for Quantum Sciences（上海量子科学研究中心）
