Redirigiendo al acceso original de articulo en 19 segundos...
Inicio  /  Algorithms  /  Vol: 12 Par: 2 (2019)  /  Artículo
ARTÍCULO
TITULO

From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

Stuart Hadfield    
Zhihui Wang    
Bryan O?Gorman    
Eleanor G. Rieffel    
Davide Venturelli and Rupak Biswas    

Resumen

The next few years will be exciting as prototype universal quantum processors emerge, enabling the implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware for their evaluation and which have the potential to significantly expand the breadth of applications for which quantum computers have an established advantage. A leading candidate is Farhi et al.?s quantum approximate optimization algorithm, which alternates between applying a cost function based Hamiltonian and a mixing Hamiltonian. Here, we extend this framework to allow alternation between more general families of operators. The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter. This ansatz supports the representation of a larger, and potentially more useful, set of states than the original formulation, with potential long-term impact on a broad array of application areas. For cases that call for mixing only within a desired subspace, refocusing on unitaries rather than Hamiltonians enables more efficiently implementable mixers than was possible in the original framework. Such mixers are particularly useful for optimization problems with hard constraints that must always be satisfied, defining a feasible subspace, and soft constraints whose violation we wish to minimize. More efficient implementation enables earlier experimental exploration of an alternating operator approach, in the spirit of the quantum approximate optimization algorithm, to a wide variety of approximate optimization, exact optimization, and sampling problems. In addition to introducing the quantum alternating operator ansatz, we lay out design criteria for mixing operators, detail mappings for eight problems, and provide a compendium with brief descriptions of mappings for a diverse array of problems.

 Artículos similares

       
 
Meng-Leong How and Sin-Mei Cheah    
The fusion of quantum computing and artificial intelligence (AI) heralds a transformative era for Industry 4.0, offering unprecedented capabilities and challenges. This paper delves into the intricacies of quantum AI, its potential impact on Industry 4.0... ver más
Revista: AI

 
Ying Zhou, Huixian Liang, Zhaocong Wang, Xiaojian Liao, Shihai Xu and Bingxin Zhao    
Clionaterpene (1), a new cadinene sesquiterpene, along with six known compounds 2?7 were isolated from the marine sponge Cliona sp. The structure of 1 with absolute configuration was determined by the spectroscopic data (UV, IR, MS, and NMR) and quantum ... ver más

 
Yeongjae Park, Hyeondo Yoo, Jieun Ryu, Young-Rak Choi, Ju-Sung Kang and Yongjin Yeom    
Owing to the expansion of non-face-to-face activities, security issues in video conferencing systems are becoming more critical. In this paper, we focus on the end-to-end encryption (E2EE) function among the security services of video conferencing system... ver más

 
Yuriy Divin    
Spectral analysis of terahertz (THz) and sub-THz emission from quantum cascade lasers has been recently demonstrated using conventional YBa2Cu3O7-x bicrystal Josephson junctions made from c-axes thin films. Josephson frequencies of alternative bicrystal ... ver más
Revista: Applied Sciences

 
Yuefeng Gao and Baojiu Chen    
Seawater pollution caused by heavy metal ions is a growing concern among the public. Perovskite quantum dots (PeQDs) are ideal probes for detecting metal ions due to their exceptional sensing characteristics, including remarkable sensitivity, low detecti... ver más