Programmable networks for quantum algorithms

Abstract

The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there are no standard ways to uniformly generate whole classes of N-qubit gates. We have developed a method to generate arbitrary controlled phase shift operations with a single network of one-qubit and two-qubit operations. This kind of network can be adapted to various physical implementations of quantum computing and is suitable to realize the Deutsch-Jozsa algorithm as well as Grover's search algorithm.

4 pages. Accepted version; Journal-ref. added

References in corpus (16)

• Quantum Mechanics helps in searching for a needle in a haystack
• Elementary gates for quantum computation
• The Physical Implementation of Quantum Computation
• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Quantum Algorithms Revisited
• Quantum Networks for Elementary Arithmetic Operations
• Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
• Universality in Quantum Computation
• A practical scheme for quantum computation with any two-qubit entangling gate
• Natural two-qubit gate for quantum computation using the XY interaction
• Deutsch-Jozsa algorithm as a test of quantum computation
• Implementation of a three-quantum-bit search algorithm
• Interaction cost of non-local gates
• Implementation of the refined Deutsch-Jozsa algorithn on a 3-bit NMR quantum computer
• NMR quantum computation with indirectly coupled gates
• Quantum algorithms for Josephson networks

Cited by in corpus (25)

• High-precision quantum algorithms for partial differential equations
• Quantum circuits with uniformly controlled one-qubit gates
• Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
• On the representation of Boolean and real functions as Hamiltonians for quantum computing
• Realization of an n-qubit controlled-U gate with superconducting quantum interference devices or atoms in cavity QED
• Minimum construction of two-qubit quantum operations
• Josephson junction qubit network with current-controlled interaction
• Algorithm for the solution of the Dirac equation on digital quantum computers
• Superconducting qubit network with controllable nearest neighbor coupling
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Implementing Shor's algorithm on Josephson Charge Qubits
• Modularization of multi-qubit controlled phase gate and its NMR implementation
• Quantum heuristic algorithm for traveling salesman problem
• High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
• On quantum algorithms for the Schrödinger equation in the semi-classical regime
• Multi-qubit quantum computing using discrete-time quantum walks on closed graphs
• Quantum circuit synthesis via a random combinatorial search
• Implementation of many-qubit Grover search with trapped ultracold ions
• Efficient state initialization by a quantum spectral filtering algorithm
• Optimized synthesis of circuits for diagonal unitary matrices with reflection symmetry
• Achieving the volume-law entropy regime with random-sign Dicke states
• Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
• Quantum Lego and XP Stabilizer Codes
• Numerical and quantum simulation of a quantum disentangled liquid
• ROS: Resource-constrained Oracle Synthesis for Quantum Computers