A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
The paper is devoted to the problem of describing operations like AND, OR, XOR in quantum computing by using quantum gates through both the superposition and the phase factor connected by the phase kick-back formation. The main result is exposed in Section 2. Start from the input state \(|\psi_0\rangle=|0\rangle^{\otimes 4}|1\rangle \), and use the componentwise Hadamard transform to arrive at the state \(|\psi_1\rangle= \sum_{x\in\{0,1\}} \frac{|x\rangle}{2^4}\left[ \frac{|0\rangle-|1\rangle}{\sqrt{2}}\right]\). The main idea is next to use the kick-back formation operator \(U_f |x\rangle|y\rangle = |x\rangle|y \oplus f(x)\rangle\) to obtain the state \(|\psi_2\rangle=\sum_{x\in\{0,1\}} \frac{(-1)^{f(x)}|x\rangle}{2^4}\left[ \frac{|0\rangle-|1\rangle}{\sqrt{2}}\right]\). The last phase is to apply again the componentwise Hadamard transform to arrive at the state \(\psi_3=\pm|f(0,0)f(0,1)f(1,0)f(1,1)\rangle\left[ \frac{|0\rangle-|1\rangle}{\sqrt{2}}\right]\). The authors apply this to the Boolean function \(f_1(x,y) = x \wedge y\) and obtain the recognition of AND on quantum-gated computers. This technique can be applied to other Boolean functions like \(f_6(x,y) = \mathrm{XOR}(x,y)\), \(f_7(x,y) = \mathrm{OR}(x,y)\).
- Physics' evolution toward computing
- A quantum algorithm for finding minimal exclusive-or expressions for incompletely specified Boolean functions
- An exact quantum algorithm for testing Boolean functions with one uncomplemented product of two variables
- A quantum multiply-accumulator
- Hybrid GF(2) -- Boolean expressions for quantum computing circuits
- A classical limit of Grover's algorithm induced by dephasing: coherence versus entanglement
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2025824 (Why is no real title available?)
- scientific article; zbMATH DE number 799789 (Why is no real title available?)
- Physics' evolution toward computing
- Quantum algorithms revisited
- Quantum Complexity Theory
- Quantum complexity theory
- Quantum cryptography, quantum communication, and quantum computer in a noisy environment
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- Some theoretically organized algorithm for quantum computers
- A quantum full adder for a scalable nuclear spin quantum computer
- Quantum adder for superposition states
- Physics' evolution toward computing
- A quantum algorithm for finding minimal exclusive-or expressions for incompletely specified Boolean functions
- Implementing a quantum computation by free falling
- MODELING FULL ADDER IN ISING SPIN QUANTUM COMPUTER WITH 1000 QUBITS USING QUANTUM MAPS
- Quantum circuits for calculating the squared sum of the inner product of quantum states and its application
- A novel quantum algorithm for converting between one-hot and binary encodings
- Mathematical digital quantum computation by means of much more logical skills
- An interpreter for quantum circuits
This page was built for publication: A quantum algorithm for a FULL adder operation based on registers of the CPU in a quantum-gated computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239688)
