اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum annealing with anneal path control: application to 2-SAT problems with known energy landscapes
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the effect of the anneal path control per qubit, a new user control feature offered on the D-Wave 2000Q quantum annealer, on the performance of quantum annealing for solving optimization problems by numerically solving the time-dependent Schrodinger equation for the time-dependent Hamiltonian modeling the annealing problems. The anneal path control is thereby modeled as a modified linear annealing scheme, resulting in an advanced and retarded scheme. The considered optimization problems are 2-SAT problems with 12 Boolean variables, a known unique ground state and a highly degenerate first excited state. We show that adjustment of the anneal path control can result in a widening of the minimal spectral gap by one or two orders of magnitude and an enhancement of the success probability of finding the solution of the optimization problem. We scrutinize various iterative methods based on the spin floppiness, the average spin value, and on the average energy and describe their performance in boosting the quantum annealing process.
قيم البحث
اقرأ أيضاً
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-SAT) problems represented by Ising-type Hamiltonians, and nonstoquastic problems which are obtained by adding extra couplings to the 2-SAT problem Ham
iltonians. In addition, we add to the transverse Ising-type Hamiltonian used for quantum annealing a third term, the trigger Hamiltonian with ferromagnetic or antiferromagnetic couplings, which vanishes at the beginning and end of the annealing process. We also analyze some problem instances using the energy spectrum, average energy or overlap of the state during the evolution with the instantaneous low lying eigenstates of the Hamiltonian, and identify some non-adiabatic mechanisms which can enhance the performance of quantum annealing.
Quantum annealers require accurate control and optimized operation schemes to reduce noise levels, in order to eventually demonstrate a computational advantage over classical algorithms. We study a high coherence four-junction capacitively shunted fl
ux qubit (CSFQ), using dispersive measurements to extract system parameters and model the device. Josephson junction asymmetry inherent to the device causes a deleterious nonlinear cross-talk when annealing the qubit. We implement a nonlinear annealing path to correct the asymmetry in-situ, resulting in a substantial increase in the probability of the qubit being in the correct state given an applied flux bias. We also confirm the multi-level structure of our CSFQ circuit model by annealing it through small spectral gaps and observing quantum signatures of energy level crossings. Our results demonstrate an anneal-path correction scheme designed and implemented to improve control accuracy for high-coherence and high-control quantum annealers, which leads to an enhancement of success probability in annealing protocols.
We propose a novel hybrid quantum-classical approach to calculate Graver bases, which have the potential to solve a variety of hard linear and non-linear integer programs, as they form a test set (optimality certificate) with very appealing propertie
s. The calculation of Graver bases is exponentially hard (in general) on classical computers, so they not used for solving practical problems on commercial solvers. With a quantum annealer, however, it may be a viable approach to use them. We test two hybrid quantum-classical algorithms (on D-Wave)--one for computing Graver basis and a second for optimizing non-linear integer programs that utilize Graver bases--to understand the strengths and limitations of the practical quantum annealers available today. Our experiments suggest that with a modest increase in coupler precision--along with near-term improvements in the number of qubits and connectivity (density of hardware graph) that are expected--the ability to outperform classical best-in-class algorithms is within reach, with respect to non-linear integer optimization.
We construct mode-selective effective models describing the interaction of N quantum emitters (QEs) with the localised surface plasmon polaritons (LSPs) supported by a spherical metal nanoparticle (MNP) in an arbitrary geometric arrangement of the QE
s. We develop a general formulation in which the field response in the presence of the nanosystem can be decomposed into orthogonal modes with the spherical symmetry as an example. We apply the model in the context of quantum information, investigating on the possibility of using the LSPs as mediators of an efficient control of population transfer between two QEs. We show that a Stimulated Raman Adiabatic Passage configuration allows such a transfer via a decoherence-free dark state when the QEs are located on the same side of the MNP and very closed to it, whereas the transfer is blocked when the emitters are positioned at the opposite sides of the MNP. We explain this blockade by the destructive superposition of all the interacting plasmonic modes.
A significant challenge in quantum annealing is to map a real-world problem onto a hardware graph of limited connectivity. If the maximum degree of the problem graph exceeds the maximum degree of the hardware graph, one employs minor embedding in whi
ch each logical qubit is mapped to a tree of physical qubits. Pairwise interactions between physical qubits in the tree are set to be ferromagnetic with some coupling strength $F<0$. Here we address the question of what value $F$ should take in order to maximise the probability that the annealer finds the correct ground-state of an Ising problem. The sum of $|F|$ for each logical qubit is defined as minor embedding energy. We confirm experimentally that the ground-state probability is maximised when the minor embedding energy is minimised, subject to the constraint that no domain walls appear in every tree of physical qubits associated with each embedded logical qubit. We further develop an analytical lower bound on $|F|$ which satisfies this constraint and show that it is a tighter bound than that previously derived by Choi (Quantum Inf. Proc. 7 193 (2008)).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
