G. Florio, D. Picca
Quantum computation has received great attention in recent years for its possible application to difficult problem in classical calculation. Despite the experimental problems of implementing quantum devices, theoretical physicists have tried to conceive some implementations for quantum algorithms. We present here some explicit schemes for executing elementary arithmetic operations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most difficult (time and space consuming) part of Shor's quantum factorising algorithm. We show that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorised.
A Feasible Design of Elementary Quantum Arithmetic Logic Units for Near-Term Quantum Computers
本文针对近期量子计算机量子比特连接受限的问题，设计了仅用Pauli-X、CNOT和CSX门且双量子比特门限于最近邻的可行QALU（含加减乘除及补码运算），推进了可扩展高效的量子算术。
We describe generalizations of the Pauli group, the Clifford group and stabilizer states for qudits in a Hilbert space of arbitrary dimension d. We examine a link with modular arithmetic, which yields an efficient way of representing the Pauli group and the Clifford group with matrices over the integers modulo d. We further show how a Clifford operation can be efficiently decomposed into one and two-qudit operations. We also focus in detail on standard basis expansions of stabilizer states.
Universality and classification of elementary thermal operations
该研究刻画了两类基本热操作的强、弱普适性，给出对应普适情形下的热操作模拟算法，证明非确定性协议复现效果更优，并将其与图随机游走关联。
In some quantum algorithms, arithmetic operations are of utmost importance for resource estimation. In binary quantum systems, some efficient implementation of arithmetic operations like, addition/subtraction, multiplication/division, square root, exponential and arcsine etc. have been realized, where resources are reported as a number of Toffoli gates or T gates with ancilla. Recently it has been demonstrated that intermediate qutrits can be used in place of ancilla, allowing us to operate efficiently in the ancilla-free frontier zone. In this article, we have incorporated intermediate qutrit…
In the framework of a model for quantum computer media, a nondigital implementation of the arithmetic of the real numbers is described. For this model, an elementary storage "cell" is an ensemble of qubits (quantum bits). It is found that to store an arbitrary real number it is sufficient to use four of these ensembles and the arithmetic operations can be implemented by fixed quantum circuits.
Quantum theory is based on a mathematical structure totally different from conventional arithmetic. Due to the symmetric nature of bosonic particles, annihilation or creation of single particles translates a quantum state depending on how many bosons are already in the given quantum system. This proportionality results in a variety of non-classical features of quantum mechanics including the bosonic commutation relation. The annihilation and creation operations have recently been implemented in photonic systems. However, this feature of quantum mechanics does not preclude the possibility of re…
Robust Quantum Arithmetic Operations with Intermediate Qutrits in the NISQ-era
本文提出在NISQ时代利用中间qutrit方法实现无需T门和ancilla的量子算术运算，有效降低门数量和电路深度，并证明尽管设计易受错误影响，但电路深度的减少显著降低了错误概率。
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula (operation) can be decided (realized, calculated. Arithmetic defined by universal qm-arithmetical algorithm called qm-arithmetic one-to-one corresponds to decidable part of the usual arithmetic. We prove that in the qm-arithmetic the undecidable arithmetical formulas (operations) cannot exist (cannot be consistently defined). Or, we prove that qm-arithmetic has no …
We propose an approach to factorize the time-evolution operator of a quantum system through a (finite) sequence of elementary operations that are time-ordered. Our proposal borrows from previous approaches based on Lie algebra techniques and other factorization procedures, and requires a set of optimization operations that provide the final result. Concretely, the algorithm produces at each step three optimal quantities, namely the optimal duration of the desired unitary operation, the optimal functional dependence of the driving function on the optimal time, and the optimal elementary Hermiti…
Catalysis in Action via Elementary Thermal Operations
本文在基本热操作框架下研究催化动力学，提出新工具刻画 qutrit 系统状态转换，发现小型催化剂可显著扩大可达状态集并缩小与通用热操作的差距，同时通过时间分辨演化揭示自由能交换机制。
Multipartite pure states are equivalent under Stochastic Local Operations and Classical Communication (SLOCC) whenever they can be mapped into one another by Invertible Local Operations. It is shown that this is equivalent to the inter-convertibility through finite sequences of Elementary Local Operations. A multipartite version of the Gauss-Jordan elimination strategy is then obtained, enabling the analytical SLOCC-classification of previously unknown examples. It is argued that the problem of SLOCC-classification is equivalent to the problem of classifying the Multipartite Fully Reduced Form…
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…
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…
Quantum Circuit Implementation of Two Matrix Product Operations and Elementary Column Transformations
本文针对Hadamard积、Kronecker积和初等列变换设计了基于酉变换和辅助量子测量的高效量子电路方案，显著降低了计算深度、量子门使用量及能耗。
The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are examined. The capabilities of QFT-based addition and multiplication are improved with some modifications. The proposed operations are compared with the nearest quantum arithmetic operations. Furthermore, novel QFT-based subtraction, division and exponentiation operations are presented. The proposed arithmetic operations can perform nonmodular operations on all sig…
In this paper we give a complete axiomatisation of qubit ZX-calculus via elementary transformations which are basic operations in linear algebra. This formalism has two main advantages. First, all the operations of the phases are algebraic ones without trigonometry functions involved, thus paved the way for generalising complete axiomatisation of qubit ZX-calculus to qudit ZX-calculus and ZX-calculus over commutative semirings. Second, we characterise elementary transformations in terms of ZX diagrams, so a lot of linear algebra stuff can be done purely diagrammatically.
PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations
PauliEngine通过高效的二进制辛表示和位运算，提供高效的Pauli字符串运算、交换子、符号相位跟踪及结构变换，实现量子软件的高性能符号运算。
To what extent do thermodynamic resource theories capture physically relevant constraints? Inspired by quantum computation, we define a set of elementary thermodynamic gates that only act on 2 energy levels of a system at a time. We show that this theory is well reproduced by a Jaynes-Cummings interaction in rotating wave approximation and draw a connection to standard descriptions of thermalisation. We then prove that elementary thermal operations present tighter constraints on the allowed transformations than thermal operations. Mathematically, this illustrates the failure at finite temperat…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。