Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience

Li, Rui; Alvarez-Rodriguez, Unai; Lamata, Lucas; Solano, E.

doi:10.1515/qmetro-2017-0001

Cited by 57 publications

(71 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A basis adder is a device introduced in ref. [] that is defined to perfectly add the computational basis states and approximately their superpositions, according to

\begin{matrix} U false| 000 false⟩ = false| 000 false⟩, U false| 010 false⟩ = false| 01 + false⟩, U false| 100 false⟩ = false| 10 + false⟩, \\ U false| 110 false⟩ = false| 001 false⟩, U false| 001 false⟩ = false| 110 false⟩, U false| 011 false⟩ = false| 01 - false⟩, \\ U false| 101 false⟩ = false| 10 - false⟩, U false| 111 false⟩ = false| 111 false⟩ \end{matrix}

…”

Section: Quantum Autoencoder Via Basis Quantum Addermentioning

confidence: 99%

“…On the other hand, recently it was proven that a general quantum adder performing the equal weight superposition of two unknown quantum states is forbidden in general . Nevertheless, the design and implementation of approximate quantum adders have led to some connections beyond expectation, which may have applications in different fields of quantum technologies. In particular, one can define quantum autoencoders based on implementations of approximate quantum adders …”

Section: Introductionmentioning

confidence: 99%

“…Another possibility is to optimize the quantum adders via genetic algorithms, which automatically provide optimal quantum adders in the context of limited gate numbers by carrying out a “natural selection” process according to the average fidelity, or cost function. A specific case of a quantum adder optimized by genetic algorithms was carried out with the experimental quantum computing platform provided by IBM Quantum Experience . Furthermore, probabilistic quantum adders have been experimentally realized in different quantum platforms However, the experimental realization of a quantum autoencoder via quantum adders, as originally proposed in ref.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Experimental Implementation of a Quantum Autoencoder via Quantum Adders

et al. 2019

Self Cite

View full text Add to dashboard Cite

Quantum autoencoders allow for reducing the amount of resources in a quantum computation by mapping the original Hilbert space onto a reduced space with the relevant information. Recently, it is proposed to employ approximate quantum adders to implement quantum autoencoders in quantum technologies. Here, the experimental implementation of this proposal in the Rigetti cloud quantum computer is carried out employing up to three qubits. The experimental fidelities are in good agreement with the theoretical prediction, thus proving the feasibility to realize quantum autoencoders via quantum adders in state‐of‐the‐art superconducting quantum technologies.

show abstract

“…A basis adder is a device introduced in ref. [] that is defined to perfectly add the computational basis states and approximately their superpositions, according to

\begin{matrix} U false| 000 false⟩ = false| 000 false⟩, U false| 010 false⟩ = false| 01 + false⟩, U false| 100 false⟩ = false| 10 + false⟩, \\ U false| 110 false⟩ = false| 001 false⟩, U false| 001 false⟩ = false| 110 false⟩, U false| 011 false⟩ = false| 01 - false⟩, \\ U false| 101 false⟩ = false| 10 - false⟩, U false| 111 false⟩ = false| 111 false⟩ \end{matrix}

…”

Section: Quantum Autoencoder Via Basis Quantum Addermentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Experimental Implementation of a Quantum Autoencoder via Quantum Adders

et al. 2019

Self Cite

View full text Add to dashboard Cite

show abstract

“…A fruitful approach is to view the many-body system as a quantum neural network that has to "learn" a desired quantum transformation [7,[28][29][30][31], or, alternatively, to use powerful optimization algorithms [32][33][34][35]. Here we use differential evolution [36], a global optimization algorithm inspired by evolutional biology, which has been recently successfully applied in quantum control problems [34].…”

Section: Introductionmentioning

confidence: 99%

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

2018

View full text Add to dashboard Cite

The while-you-wait computing paradigm combines elements of digital and analog quantum computation with the aim of minimizing the need of external control. In this architecture the computer is split into logic units, each continuously implementing a single recurring multigate operation via the unmodulated Hamiltonian evolution of a quantum many-body system. Here we use evolutionary algorithms to engineer such many-body dynamics, and develop 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. Our results provide a step for the development of larger modules for full quantum arithmetics.

show abstract

“…The IBM Quantum Experience provides access to a 5-qubit quantum computer with a limited set of gates described by IBM as "the worlds first quantum computing platform delivered via the IBM Cloud." A body of research focuses on properties of 5-qubit systems [4,5], and much of it has recently been released or updated to rely upon results running on IBM's Quantum Experience [6][7][8][9][10][11][12][13]. With IBM's release of 16-and 20-qubit systems, the study of 5-qubit systems remains ideal for the education context, in which it is large enough to illustrate foundational quantum algorithms, yet small enough to illustrate calculations on the blackboard.…”

Section: Introductionmentioning

confidence: 99%

Quintuple: A Tool for Introducing Quantum Computing Into the Classroom

Moran

2018

Front. Phys.

View full text Add to dashboard Cite

In May 2016 IBM released access to its 5-qubit quantum computer to the scientific community, its "IBM Quantum Experience" since acquiring over 60,000 users from students, educators and researchers around the globe. In the time since the "IBM Quantum Experience" became available, a flurry of research results on 5-qubit systems has been published derived from the platform hardware.Quintuple is an open-source object-oriented Python module implementing the ideal simulation of "IBM's Quantum Experience" hardware. Quintuple quantum algorithms can be programmed and run via a custom language fully compatible with the "IBM's Quantum Experience" or in pure Python. Over 40 example programs are provided with expected results, including Grover's Algorithm and the Deutsch-Jozsa algorithm. Quintuple's implementation is aimed at students and educators wishing to incorporate quantum computing into the classroom and enables students to follow a quantum computing calculation step-by-step and to verify hand calculations. For these students and educators, Quintuple contributes to the study of 5-qubit systems and the development and debugging of quantum algorithms for deployment on the "IBM Quantum Experience" hardware.

show abstract

Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience

Cited by 57 publications

References 26 publications

Experimental Implementation of a Quantum Autoencoder via Quantum Adders

Experimental Implementation of a Quantum Autoencoder via Quantum Adders

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

Quintuple: A Tool for Introducing Quantum Computing Into the Classroom

Contact Info

Product

Resources

About