Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience

  title={Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience},
  author={Rui Li and Unai Alvarez-Rodriguez and Lucas Lamata and Enrique Solano},
  journal={Quantum Measurements and Quantum Metrology},
  pages={1 - 7}
Abstract It has been proven that quantum adders are forbidden by the laws of quantum mechanics. We analyze theoretical proposals for the implementation of approximate quantum adders and optimize them by means of genetic algorithms, improving previous protocols in terms of efficiency and fidelity. Furthermore, we experimentally realize a suitable approximate quantum adder with the cloud quantum computing facilities provided by IBM Quantum Experience. The development of approximate quantum adders… 

Figures and Tables from this paper

Experimental Implementation of a Quantum Autoencoder via Quantum Adders

The experimental implementation in the Rigetti cloud quantum computer is carried out, proving the feasibility to realize quantum autoencoders via quantum adders in state‐of‐the‐art superconducting quantum technologies.

Quantum autoencoders via quantum adders with genetic algorithms

This work proposes a useful connection between quantum autoencoders and quantum adders, which approximately add two unknown quantum states supported in different quantum systems, and opens a different path for the design of quantum aut Koencoders in controllable quantum platforms.

Quantum arithmetics via computation with minimized external control: The half-adder

This work uses evolutionary algorithms to engineer such many-body dynamics, and develops logic units capable of continuously implementing a quantum half-adder in a time-independent four-qubit network, where qubits are coupled with either Ising or Heisenberg interactions.

Synthesizing Quantum Circuits via Numerical Optimization

A simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm used in the context of the trapped-ions technology and the scalability of the method with the number of qubits is discussed.

Design And Simulation Of Quantum Adder Using Ibm Quantum Experience

The use of unique quantum mechanical properties, such as superposition and entanglement, makes the quantum machines used to carry out operations with information. The fundamental theory of quantum

Implementation of quantum compression on IBM quantum computers

This paper reports on implementations of quantum compression algorithm that can efficiently compress unknown quantum information and restricted ourselves to compression of three pure qubits into two qubits, as the complexity of even such a simple implementation is barely within the reach of today's quantum processors.

Multi-objective evolutionary algorithms for quantum circuit discovery

A robust, multi-objective evolutionary search strategy to design quantum circuits 'from scratch', by combining and parameterizing a task-generic library of quantum circuit elements.

Implementing efficient selective quantum process tomography of superconducting quantum gates on IBM quantum experience

The experimental implementation of selective quantum process tomography (SQPT) involves computing individual elements of the process matrix with the help of a special set of states called quantum

Unsupervised Quantum Gate Control for Gate-Model Quantum Computers

A method for the unsupervised control of quantum gates in near-term quantum computers is defined and it is proved that the non-stable quantum gate becomes controllable via a machine learning method if the quantum gates formulate an entangled gate structure.



Automated Design of Quantum Circuits

An automated approach to quantum circuit design using search heuristics based on principles abstracted from evolutionary genetics, i.e. using a genetic programming algorithm adapted specially for this problem, is proposed.

Quantum gate learning in qubit networks: Toffoli gate without time-dependent control

Researchers have developed a strategy for performing operations in quantum computing networks without requiring external control input. Although quantum algorithms offer the benefit of faster

Evolutionary Algorithms for Hard Quantum Control

This work demonstrates the failure of greedy algorithms to realize two fast quantum computing gates: a qutrit phase gate and a controlled-not gate, and shows that the evolutionary algorithm circumvents the trap to deliver effective quantum control in both instances.

Superconducting quantum circuits at the surface code threshold for fault tolerance

The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.

Experimental test of Mermin inequalities on a five-qubit quantum computer

Violation of Mermin inequalities is tested on the 5-qubit IBM quantum computer. For 3, 4 and 5 parties, quantum states that violate the corresponding Mermin inequalities are constructed using quantum

Universal quantum circuit for two-qubit transformations with three controlled-NOT gates

We consider quantum circuits made of controlled-NOT (CNOT) gates and single-qubit unitary gates and look for constructions that minimize the use of CNOT gates. We show, by means of an explicit

Decomposition of quantum gates

A recurrence scheme is presented to decompose an n-qubit unitary gate to the product of no more than N(N - 1)/2 single qubit gates with small number of controls, where N = 2n. Detailed description of

Experimental creation of superposition of unknown photonic quantum states

As one of the most intriguing intrinsic properties of the quantum world, quantum superposition provokes great interest in its own generation. Though a universal quantum machine that creates

Protected State Transfer via an Approximate Quantum Adder

This protocol is implemented via an approximate quantum adder engineered through spontaneous parametric down converters, and shows higher success probability than distilled quantum teleportation protocols for distances below a threshold depending on the properties of the channel.

Creating a Superposition of Unknown Quantum States.

A no-go theorem is proved that forbids the existence of a universal probabilistic quantum protocol producing a superposition of two unknown quantum states, each having a fixed overlap with the known referential pure state.