ﻻ يوجد ملخص باللغة العربية
Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We propose an alternative factorization method, within the digitized-adiabatic quantum computing paradigm, by digitizing an adiabatic quantum factorization algorithm enhanced by shortcuts to adiabaticity techniques. We find that this fast factorization algorithm is suitable for available gate-based quantum computers. We test our quantum algorithm in an IBM quantum computer with up to six qubits, surpassing the performance of the more commonly used factorization algorithms on the long way towards quantum advantage.
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shors algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical simulations in
Quantum pumping, in its different forms, is attracting attention from different fields, from fundamental quantum mechanics, to nanotechnology, to superconductivity. We investigate the crossover of quantum pumping from the adiabatic to the anti-adiaba
Crossing a quantum critical point in finite time challenges the adiabatic condition due to the closing of the energy gap, which ultimately results in the formation of excitations. Such non-adiabatic excitations are typically deemed detrimental in man
We report theoretical studies of adiabatic population transfer using dressed spin states. Quantum optimal control using the algorithm of Chopped Random Basis (CRAB) has been implemented in a negatively charged diamond nitrogen vacancy center that is
Entanglement is the central resource in adiabatic quantum transport. Dephasing affects the availability of that resource by biasing trajectories, driving transitions between success and failure. This depletion of entanglement is important for the pra