Jia-Qi Jin, Gui-Lu Long
In this paper, elementary quantum gate operations, such as the phase gate, the controlled-NOT gate, the swap and the Fredkin gate are constructed using joint measurement and pairs of entangled qubit pairs. The relation between the state of the entangled pair and the joint measurement basis is discussed. Some other generalization is also discussed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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…
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…
The basic one-bit gates (X, Y, Z, Hadamard, phase, pi/8) as well as the controlled cnot and Toffoli gates are reformulated in the language of geometric-algebra quantum-like computation. Thus, all the quantum algorithms can be reformulated in purely geometric terms without any need of tensor products.
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 introduce an elementary optical gate for expanding polarization entangled W states, in which every pair of photons are entangled alike. The gate is composed of a pair of 50:50 beamsplitters and ancillary photons in the two-photon Fock state. By seeding one of the photons in an $n$-photon W state into this gate, we obtain an $(n+2)$-photon W state after post-selection. This gate gives a better efficiency and a simpler implementation than previous proposals for $\rm W$-state preparation.
We construct a minimal robust controlled-NOT gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed with the minimal number (N=3) of elementary two-qubit gates and several one-qubit gates. It is noteworthy that all the robust circuits can be mapped to one-qubit circuits robust against a pulse length error. We also prove that a minimal robust SWAP gate cannot be constructed with N=3, but requires N=6 elementary two-qubit gates.
Computations with a future quantum computer will be implemented through the operations by elementary quantum gates. It is now well known that the collection of 1-bit and 2-bit quantum gates are universal for quantum computation, i.e., any n-bit unitary operation can be carried out by concatenations of 1-bit and 2-bit elementary quantum gates. Three contemporary quantum devices--cavity QED, ion traps and quantum dots--have been widely regarded as perhaps the most promising candidates for the construction of elementary quantum gates. In this paper, we describe the physical properties of these de…
We introduce transformation matrix connecting sets of the displaced states with different displacement amplitudes. Arbitrary pure one-mode state can be represented in new basis of the displaced number (Fock) states ( representation) by multiplying the transposed transformation matrix on a column vector of initial state. Analytical expressions of the representation of superposition of vacuum and single photon and two-mode squeezed vacuum (TMSV) are obtained. On the basis of the developed mathematical formalism, we consider the mechanism of interaction between qubits which is based on their disp…
Quantum circuits currently constitute a dominant model for quantum computation. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We pursue circuits without ancilla qubits and as small a number of elementary quantum gates as possible. Our lower bound for worst-case optimal two-qubit circuits calls for at least 17 gates: 15 one-qubit rotations and 2 CNOTs. To this end, we constructively prove a worst-case upper bound of 23 elementary gates, of which at most 4 (CNOT) entail multi-qubit interacti…
We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the so-called cosine-sine matrix decomposition is presented. The result is optimal in the number of elementary one-qubit gates, 4^n, and scales more favorably than the previously reported decompositions requiring 4^n-2^n+1 controlled NOT gates.
The controlled-not gate and the single qubit gates are considered elementary gates in quantum computing. It is natural to ask how many such elementary gates are needed to implement more elaborate gates or circuits. Recall that a controlled-U gate can be realized with two controlled-not gates and four single qubit gates. We prove that this implementation is optimal if and only if the matrix U satisfies the conditions tr U != 0, tr UX != 0, and det U != 1. We also derive optimal implementations in the non-generic cases.
A simple alternative scheme for implementing quantum gates with a single trapped cold two-level ion beyond the Lamb-Dicke (LD) limit is proposed. Basing on the quantum dynamics for the laser-ion interaction described by a generalized Jaynes-Cummings model, one can introduce two kinds of elementary quantum operations i.e., the simple rotation on the bare atomic state, generated by applying a resonant pulse, and the joint operation on the internal and external degrees of the ion, performed by using an off-resonant pulse. Several typical quantum gates, including Hadamard gate, controlled-Z and co…
It is shown that there exists a mapping between the fermions of the Standard Model (SM) represented as braids in the Bilson-Thompson model, and a set of gates which can perform Universal Quantum Computation (UQC). This leads us to conjecture that the "Computational Universe Hypothesis" (CUH) can be given a concrete implementation in a new physical framework where elementary particles and the gauge bosons (which intermediate interactions between fermions) are interpreted as the components of a quantum computational network, with the particles serving as quantum computational gates and the gauge…
Fast elementary gates for universal quantum computation with Kerr parametric oscillator qubits
本文针对KPO量子比特基本门因绝热操作耗时过长导致光子损耗错误的问题，提出基于绝热捷径脉冲形状数值优化的实验可行控制方法，实现高达六倍加速并保持99.9%门保真度。
A Feasible Design of Elementary Quantum Arithmetic Logic Units for Near-Term Quantum Computers
本文针对近期量子计算机量子比特连接受限的问题，设计了仅用Pauli-X、CNOT和CSX门且双量子比特门限于最近邻的可行QALU（含加减乘除及补码运算），推进了可扩展高效的量子算术。
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many bits $n$ (U($2^n$)) can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical AND of all remaining input bits is satisfied. These gates play a central role in …
We propose three core ideas: 1. the wave-particle duality of the qudit quantum space; 2. the classification of all elementary quantum gates by ordered pairs of qudit functionals; 3. a new type of quantum gates called the "quantum wave gates". We first study the quantum functionals whose relation to the quantum states is analogous to that between the momentum and position wavefunctions in fundamental quantum physics: a Fourier transform and an entropic uncertainty principle can be defined between the dual representations. The quantum functionals are not just mathematical constructs but have cle…
Errors in quantum logic gates are usually modeled by quantum process matrices (CPTP maps). But process matrices can be opaque, and unwieldy. We show how to transform a gate's process matrix into an error generator that represents the same information more usefully. We construct a basis of simple and physically intuitive elementary error generators, classify them, and show how to represent any gate's error generator as a mixture of elementary error generators with various rates. Finally, we show how to build a large variety of reduced models for gate errors by combining elementary error generat…
Using a cavity QED setup we show how to implement a particular joint measurement on two atoms in a fault tolerant way. Based on this scheme, we illustrate how to realize quantum communication over a noisy channel when local operations are subject to errors. We also present a scheme to perform and purify a universal two-bit gate.
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger modules, such that the desired unitary matrix expressing the algorithm is directly implemented. We demonstrate this by taking the two-qubit Grover's algorithm implemented in NMR quantum computation, whose pseudopure state is generated by cyclic permutations of the state populations. This is the first exact time-optimal solution, to our knowledge, obtained for …
Equivalence of cost concentration and gradient vanishing for quantum circuits: An elementary proof in the Riemannian formulation
该研究在量子电路优化的黎曼表述中，通过初等推导证明代价函数单门方差与黎曼单门梯度方差严格等价，明确梯度衰减与代价变化相伴，指出贫瘠高原问题无法用无梯度方法规避。
We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity. We use the two-qubit encoding and swapping-based operations to simplify a physical realization of universal quantum computing and add the immunity to a number of errors. This approach allows to implement any encoded single-qubit operation by three elementary gates and the encoded controlled- NOT operation can be performed in a single step. The considerable a…
We present a simple architecture for deterministic quantum circuits operating on single photon qubits. Few resources are necessary to implement two elementary gates and can be recycled for computing with large numbers of qubits. The deterministic realization of some key multi-qubit gates, such as the Fredkin and Toffoli gate, is greatly simplified in this approach.
We concretely construct an extension of the controlled-U gate in qudit from some elementary gates. We also construct unitary transformation in two-qudit by means of the extended controlled-U gate and show the universality of it.
In order to realize a Quantum CPU some schemes for executing fundamental mathematical tasks are needed. In this paper we present some quantum circuits which, using elementary arithmetic operations, allow an approximated calculation of continuous functions. Furthermore, we give an explicit example of our procedure applied to the exponential function.
Linear decomposition of approximate multi-controlled single qubit gates
提出一种无辅助量子比特的近似多控单量子比特门编译方法，通过优化CNOT门数量，将基本门总数降至与32n成正比，显著减少量子计算中的基本操作。
We present an n-bit Toffoli gate quantum circuit based on the realization proposed by Barenco, where some of the Toffoli gates in their construction are replaced with Peres gates. This results in a significant cost reduction. Our main contribution is a quantum circuit which simulates the (m+1)-bit Toffoli gate with 32m-96 elementary quantum gates and one garbage bit which is passed unchanged. This paper is a corrected and expanded version of our recent journal publication.
Recently Levy has shown that quantum computation can be performed using an ABAB.. chain of spin-1/2 systems with nearest-neighbor Heisenberg interactions. Levy notes that all necessary elementary computational `gates' can be achieved by using spin-resonance techniques involving modulating the spin-spin interaction strength at high frequency. Here we note that, as an alternative to that approach, it is possible to perform the elementary gates with simple, non-oscillatory pulses.
In all the various proposals for quantum computers, a common feature is that the quantum circuits are expected to be made of cascades of unitary transformations acting on the quantum states. A framework is proposed to express these elementary quantum gates directly in terms of the control inputs entering into the continuous time forced Schrodinger equation.
A lower bound on the amount of energy needed to carry out an elementary logical operation on a qubit system, with a given accuracy and in a given time, has been recently postulated. This paper is an attempt to formalize this bound and explore the conditions under which it may be expected to hold. This is a work in progress and any contributions will be appreciated.
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit which is optimal in the sense of fully controlled single-qubit gates and yet is equivalent with the multiqubit gate. In the second step of the optimization, superfluous control bits are eliminated, which eventually results in a smaller total number of the elementary gates. In our scheme the number of controlled NOT gates is $O(4^n)$ which coincides with the …
Optimizing quantum circuits with evolutionary algorithms for stable Boolean gates, elementary cellular automata, and highly entangled quantum states
本研究利用进化算法优化量子电路，针对元胞自动机量子实现鲁棒性测试和高纠缠态电路采样两项任务，实现5量子比特纠缠电路构建，揭示电路复杂度与性能的权衡关系。
We present a novel quantum algorithm for solving the unstructured search problem with one marked element. Our algorithm allows generating quantum circuits that use asymptotically fewer additional quantum gates than the famous Grover's algorithm and may be successfully executed on NISQ devices. We prove that our algorithm is optimal in the total number of elementary gates up to a multiplicative constant. As many NP-hard problems are not in fact unstructured, we also describe the \emph{partial uncompute} technique which exploits the oracle structure and allows a significant reduction in the numb…
Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the B gate is the unique gate that can construct a two-qubit universal circuit with only two applications, i.e. this condition is also sufficient in the case of two applications of the elementary two-qubit gate. It is also shown that one half of perfect entanglers can not simulate an arbitrary two-qubit gate with only 3 applications.
Previous schemes of nonadiabatic holonomic quantum computation were focused mainly on realizing a universal set of elementary gates. Multiqubit controlled gates could be built by decomposing them into a series of the universal gates. In this article, we propose an approach for realizing nonadiabatic holonomic multiqubit controlled gates in which a $(n+1)$-qubit controlled-$(\boldsymbol{\mathrm{n}\cdot \mathrmσ})$ gate is realized by $(2n-1)$ basic operations instead of decomposing it into the universal gates, whereas an $(n+1)$-qubit controlled arbitrary rotation gate can be obtained by combin…
Quantum Circuits for Elementary Cellular Automata
该研究确定了22条可通过量子电路模拟的初等元胞自动机规则，且为每条规则设计了门数为O(N)的量子实现电路。
A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into statistically independent reservoirs. The proposed universal quantum gates are constructed with the help of Heisenberg- and Ising-type Hamiltonians acting on these physical qubits. This way it is guaranteed that the relevant error correcting code space is not left at any time even during the application of one of these quantum gates. The proposed entanglement gate is…
We consider a quantum circuit in which shift and rotation operations on qubits are performed by swap gates and controlled swap gates. These operations can be useful for quantum computers performing elementary arithmetic operations such as multiplication and a bit-wise comparison of qubits.
The complexity of a quantum gate, defined as the minimal number of elementary gates to build it, is an important concept in quantum information and computation. It is shown recently that the complexity of quantum gates built from random quantum circuits almost surely grows linearly with the number of building blocks. In this article, we provide two short proofs of this fact. We also discuss a discrete version of quantum circuit complexity growth.
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requires at…
We propose an effective realization of a complete set of elementary quantum gates in the solid-state quantum computer based on the multi-atomic coherent (MAC-) ensembles in the QED cavity. Here, we use the two-ensemble qubit encoding and swapping-based operations that together provide implementation of any encoded single-qubit operation by three elementary gates and the encoded controlled-NOT operation is performed in a single step. This approach simplifies a physical realization of universal quantum computing and adds the immunity to a number of errors. We also demonstrate that the proposed a…
T-count optimization of approximate quantum Fourier transform
本研究提出一种新的近似量子傅里叶变换电路，通过消除Toffoli门并并行排列量子加法器，将T计数和T深度均减半，显著降低容错实现成本。
The implementation of fault-tolerant quantum gates on encoded logic qubits is considered. It is shown that transversal implementation of logic gates based on simple geometric control ideas is problematic for realistic physical systems suffering from imperfections such as qubit inhomogeneity or uncontrollable interactions between qubits. However, this problem can be overcome by formulating the task as an optimal control problem and designing efficient algorithms to solve it. In particular, we can find solutions that implement all of the elementary logic gates in a fixed amount of time with limi…
Optimal joint cutting of two-qubit rotation gates
本文基于虚拟门隐形传态协议提出双量子比特旋转门的最优联合切割方案，显著降低采样开销上界，并证明无需经典通信，同时给出并行旋转门的最优无辅助分解。
In this paper, the problem of synthesizing a general Hermitian quantum gate into a set of primary quantum gates is addressed. To this end, an extended version of the Jacobi approach for calculating the eigenvalues of Hermitian matrices in linear algebra is considered as the basis of the proposed synthesis method. The quantum circuit synthesis method derived from the Jacobi approach and its optimization challenges are described. It is shown that the proposed method results in multiple-control rotation gates around the y axis, multiple-control phase shift gates, multiple-control NOT gates and a …
Quantum Circuit Implementation of Two Matrix Product Operations and Elementary Column Transformations
本文针对Hadamard积、Kronecker积和初等列变换设计了基于酉变换和辅助量子测量的高效量子电路方案，显著降低了计算深度、量子门使用量及能耗。
Quantum circuit compilation with constant overhead
该研究提出利用适应性编译方法，将多项式规模量子电路的编译开销从对数级别降至常数，实现最优的逆多项式误差近似。
We investigate the counterparts of random walk in universal quantum computing and their implementation using standard quantum circuits. Quantum walk have been recently well investigated for traversing graphs with certain oracles. We focus our study on traversing a 1-D graph, namely a circle, and show how to implement discrete circular quantum walk in quantum circuits built with universal CNOT and single quit gates. We review elementary quantum gates and circuit decomposition and propose a a generalized version of the all CNOT based quantum discrete circular walk. We simulated these circuits on…
Accurate quantum control is a key technology for realizing quantum information processing, such as quantum communication and quantum computation. In reality, a quantum state under control suffers from undesirable effects caused by systematic errors. A composite pulse (CP) is used to eliminate the effects of systematic errors during control. One qubit control, which is the most fundamental in quantum control, is typically affected by two errors: pulse length error (PLE) and off-resonance error (ORE). In this study, we focus on ORE-robust CPs and systematically construct ORE-robust symmetric CPs…
While recent breakthroughs in quantum computing promise the nascence of the quantum information age, quantum states remain delicate to control. Moreover, the required energy budget for large scale quantum applications has only sparely been considered. Addressing either of these issues necessitates a careful study of the most energetically efficient implementation of elementary quantum operations. In the present analysis, we show that this optimal control problem can be solved within the powerful framework of quantum speed limits. To this end, we derive state-independent lower bounds on the ene…
We report the realization of an elementary quantum processor based on a linear crystal of trapped ions. Each ion serves as a quantum bit (qubit) to store the quantum information in long lived electronic states. We present the realization of single-qubit and of universal two-qubit logic gates. The qwo-qubit operation relies on the coupling of the ions through their collective quantized motion. A detailed description of the setup and the methods is included.
Construction of Boolean Logic Gates Using QFT-Based Adder Architecture
本研究利用基于量子傅里叶变换的加法器电路，通过预处理和后处理构造了五种布尔逻辑门的量子可逆对应物，在输入增加时减少了量子比特数。
We suggest an efficient scheme for quantum computation with linear optical elements utilizing "linked" photon states. The linked states are designed according to the particular quantum circuit one wishes to process. Once a linked-state has been successfully prepared, the computation is pursued deterministically by a sequence of teleportation steps. The present scheme enables a significant reduction of the average number of elementary gates per logical gate to about 20-30 CZ_{9/16} gates.
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any n-qubit gate. In 1995, the universality of the set of one-qubit gates and controlled NOT gate was shown by Barenco et al. using QR decomposition of unitary matrices. Almost ten years later the decomposition was improved to include essentially fewer elementary gates. In addition, the cosine-sine matrix decomposition was applied to efficientl…
We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we recover and generalize the simulability of Valiant's match-gates by invoking the solvability of the free-fermion eight-vertex model. Our mappings furthermore provide a systematic formalism to obtain simple quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. For example, we present an efficient quantum algo…
Despite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation and optimization techniques that massively reduce the entangling-gate counts. We exploit the well-studied non-quantum optimization algorithms to achieve up to 24\% savings over the state of the art for several small-molecule simulations, with no loss of accuracy or hidden costs. Our methodologies straightforwardly generalize to wider classes of near-term simu…
Quantum computation is a continuously growing research area which is based on nature and resources of quantum mechanics, as superposition and entanglement. In its quantum circuits version, the use of convenient and appropriate gates is essential. But while those gates adopt convenient forms for computational algorithms, their design depends on specific quantum systems and stu? being used. These gates need manage quantum systems based on physical interactions ruled by quantum Hamiltonians. With this, gates design is restricted to properties and limitations of interactions and physical elements …
Universality of a standard two-qubit gate by catalytic embedding
通过催化嵌套，研究发现受控-V门可实现通用量子计算，以最小开销模拟标准门集并提供合成算法。
Clifford synthesis via generalized S and CZ gates
本文展示通过最多2n个多量子比特联合测量实现任意n量子比特克莱因群单元ary，且测量可分成两个互不干扰的集合，为实现克莱因群单元ary提供了灵活的空间时间权衡。
A short and elementary proof of the joint convexity of relative entropy is presented, using nothing beyond linear algebra. The key ingredients are an easily verified integral representation and the strategy used to prove the Cauchy-Schwarz inequality in elementary courses. Several consequences are proved in a way which allow an elementary proof of strong subadditivity in a few more lines. Some expository material on Schwarz inequalities for operators and the Holevo bound for partial measurements is also included.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。