Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHigh-fidelity adiabatic quantum computation using the intrinsic Hamiltonian of a spin system: Application to the experimental factorization of 291311
139
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In previous implementations of adiabatic quantum algorithms using spin systems, the average Hamiltonian method with Trotters formula was conventionally adopted to generate an effective instantaneous Hamiltonian that simulates an adiabatic passage. However, this approach had issues with the precision of the effective Hamiltonian and with the adiabaticity of the evolution. In order to address these, we here propose and experimentally demonstrate a novel scheme for adiabatic quantum computation by using the intrinsic Hamiltonian of a realistic spin system to represent the problem Hamiltonian while adiabatically driving the system by an extrinsic Hamiltonian directly induced by electromagnetic pulses. In comparison to the conventional method, we observed two advantages of our approach: improved ease of implementation and higher fidelity. As a showcase example of our approach, we experimentally factor 291311, which is larger than any other quantum factorization known.
rate research
Read More
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 indicate that the running time grows only quadratically with the number of qubits.
Open quantum systems and study of decoherence are important for our fundamental understanding of quantum physical phenomena. For practical purposes, there exists a large number of quantum protocols exploiting quantum resources, e.g. entanglement, which allows to go beyond what is possible to achieve by classical means. We combine concepts from open quantum systems and quantum information science, and give a proof-of-principle experimental demonstration -- with teleportation -- that it is possible to implement efficiently a quantum protocol via non-Markovian open system. The results show that, at the time of implementation of the protocol, it is not necessary to have the quantum resource in the degree of freedom used for the basic protocol -- as long as there exists some other degree of freedom, or environment of an open system, which contains useful resources. The experiment is based on a pair of photons, where their polarizations act as open system qubits and frequencies as their environments -- while the path degree of freedom of one of the photons represents the state of Alices qubit to be teleported to Bobs polarization qubit.
Adiabatic quantum computing has recently been used to factor 56153 [Dattani & Bryans, arXiv:1411.6758] at room temperature, which is orders of magnitude larger than any number attempted yet using Shors algorithm (circuit-based quantum computation). However, this number is still vastly smaller than RSA-768 which is the largest number factored thus far on a classical computer. We address a major issue arising in the scaling of adiabatic quantum factorization to much larger numbers. Namely, the existence of many 4-qubit, 3-qubit and 2-qubit interactions in the Hamiltonians. We showcase our method on various examples, one of which shows that we can remove 94% of the 4-qubit interactions and 83% of the 3-qubit interactions in the factorization of a 25-digit number with almost no effort, without adding any auxiliary qubits. Our method is not limited to quantum factoring. Its importance extends to the wider field of discrete optimization. Any CSP (constraint-satisfiability problem), psuedo-boolean optimization problem, or QUBO (quadratic unconstrained Boolean optimization) problem can in principle benefit from the deduction-reduction method which we introduce in this paper. We provide an open source code which takes in a Hamiltonian (or a discrete discrete function which needs to be optimized), and returns a Hamiltonian that has the same unique ground state(s), no new auxiliary variables, and as few multi-qubit (multi-variable) terms as possible with deduc-reduc.
Based on a `shortcut-to-adiabaticity (STA) scheme, we theoretically design and experimentally realize a set of high-fidelity single-qubit quantum gates in a superconducting Xmon qubit system. Through a precise microwave control, the qubit is driven to follow a fast `adiabatic trajectory with the assistance of a counter-diabatic field and the correction of derivative removal by adiabatic gates. The experimental measurements of quantum process tomography and interleaved randomized benchmarking show that the process fidelities of our STA quantum gates are higher than 94.9% and the gate fidelities are higher than 99.8%, very close to the state-of-art gate fidelity of 99.9%. An alternate of high-fidelity quantum gates is successfully achieved under the STA protocol.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
