اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDecomposition and Gluing for Adiabatic Quantum Optimization
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Farhi and others have introduced the notion of solving NP problems using adiabatic quantum com- puters. We discuss an application of this idea to the problem of integer factorization, together with a technique we call gluing which can be used to build adiabatic models of interesting problems. Although adiabatic quantum computers already exist, they are likely to be too small to directly tackle problems of interesting practical sizes for the foreseeable future. Therefore, we discuss techniques for decomposition of large problems, which permits us to fully exploit such hardware as may be available. Numerical re- sults suggest that even simple decomposition techniques may yield acceptable results with subexponential overhead, independent of the performance of the underlying device.
قيم البحث
اقرأ أيضاً
We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technology. We derive theoretical lower bounds for the number of quantum gates
required to implement any quantum algorithm. Then we present numerical experiments with random quantum operators where we compute the optimal parameters of the circuits and we illustrate the correctness of the theoretical lower bounds. We finally discuss the scalability of the method with the number of qubits.
Adiabatic quantum optimization has been proposed as a route to solve NP-complete problems, with a possible quantum speedup compared to classical algorithms. However, the precise role of quantum effects, such as entanglement, in these optimization pro
tocols is still unclear. We propose a setup of cold trapped ions that allows one to quantitatively characterize, in a controlled experiment, the interplay of entanglement, decoherence, and non-adiabaticity in adiabatic quantum optimization. We show that, in this way, a broad class of NP-complete problems becomes accessible for quantum simulations, including the knapsack problem, number partitioning, and instances of the max-cut problem. Moreover, a general theoretical study reveals correlations of the success probability with entanglement at the end of the protocol. From exact numerical simulations for small systems and linear ramps, however, we find no substantial correlations with the entanglement during the optimization. For the final state, we derive analytically a universal upper bound for the success probability as a function of entanglement, which can be measured in experiment. The proposed trapped-ion setups and the presented study of entanglement address pertinent questions of adiabatic quantum optimization, which may be of general interest across experimental platforms.
Quantum annealers have grown in complexity to the point that quantum computations involving few thousands of qubits are now possible. In this paper, textcolor{black}{with the intentions to show the feasibility of quantum annealing to tackle problems
of physical relevance, we used a simple model, compatible with the capability of current quantum annealers, to study} the relative stability of graphene vacancy defects. By mapping the crucial interactions that dominate carbon-vacancy interchange onto a quadratic unconstrained binary optimization problem, our approach exploits textcolor{black}{the ground state as well the excited states found by} the quantum annealer to extract all the possible arrangements of multiple defects on the graphene sheet together with their relative formation energies. This approach reproduces known results and provides a stepping stone towards applications of quantum annealing to problems of physical-chemical interest.
Starting from the idea of Quantum Computing which is a concept that dates back to 80s, we come to the present day where we can perform calculations on real quantum computers. This sudden development of technology opens up new scenarios that quickly l
ead to the desire and the real possibility of integrating this technology into current software architectures. The usage of frameworks that allow computation to be performed directly on quantum hardware poses a series of challenges. This document describes a an architectural framework that addresses the problems of integrating an API exposed Quantum provider in an existing Enterprise architecture and it provides a minimum viable product (MVP) solution that really merges classical quantum computers on a basic scenario with reusable code on GitHub repository. The solution leverages a web-based frontend where user can build and select applications/use cases and simply execute it without any further complication. Every triggered run leverages on multiple backend options, that include a scheduler managing the queuing mechanism to correctly schedule jobs and final results retrieval. The proposed solution uses the up-to-date cloud native technologies (e.g. Cloud Functions, Containers, Microservices) and serves as a general framework to develop multiple applications on the same infrastructure.
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this paradigm and d
iscuss how to adopt it to the problem of binary clustering. Numerical simulations demonstrate the feasibility of our approach and illustrate how systems of qubits adiabatically evolve towards a solution.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
