Pages that link to "Item:Q2632506"

The following pages link to From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506):

Displaying 27 items.

• A quantum walk-assisted approximate algorithm for bounded NP optimisation problems (Q669949) (← links)
• Classical symmetries and the quantum approximate optimization algorithm (Q2099573) (← links)
• Unconstrained binary models of the travelling salesman problem variants for quantum optimization (Q2102287) (← links)
• Leveraging special-purpose hardware for local search heuristics (Q2125062) (← links)
• A conditional generative model based on quantum circuit and classical optimization (Q2323723) (← links)
• Benchmarking the quantum approximate optimization algorithm (Q2681529) (← links)
• On the universality of the quantum approximate optimization algorithm (Q2681661) (← links)
• Benchmarking the performance of portfolio optimization with QAOA (Q2686165) (← links)
• Locating quantum critical points with shallow quantum circuits (Q2686960) (← links)
• A direct error correction method for quantum machine learning (Q2693879) (← links)
• Variational Quantum Eigensolver and Its Applications (Q5162598) (← links)
• Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers (Q6048724) (← links)
• An introduction to variational quantum algorithms for combinatorial optimization problems (Q6054009) (← links)
• A practitioner’s guide to quantum algorithms for optimisation problems (Q6063352) (← links)
• Quantum alternating operator ansatz for solving the minimum exact cover problem (Q6095686) (← links)
• Efficient quantum feature extraction for CNN-based learning (Q6113922) (← links)
• Solving the Kemeny ranking aggregation problem with quantum optimization algorithms (Q6139170) (← links)
• Preparing a Fast Pauli Decomposition for Variational Quantum Solving Linear Equations (Q6144684) (← links)
• A universal quantum algorithm for weighted maximum cut and Ising problems (Q6171439) (← links)
• Solving MaxCut with quantum imaginary time evolution (Q6171442) (← links)
• A review on quantum approximate optimization algorithm and its variants (Q6546559) (← links)
• A novel quantum algorithm for converting between one-hot and binary encodings (Q6550837) (← links)
• Addition and differentiation of ZX-diagrams (Q6563057) (← links)
• Variational quantum algorithms: fundamental concepts, applications and challenges (Q6566187) (← links)
• A feasibility-preserved quantum approximate Solver for the capacitated vehicle routing problem (Q6588867) (← links)
• Comparing QUBO models for quantum annealing: integer encodings for permutation problems (Q6609696) (← links)
• Quantum computing and tensor networks for laminate design: a novel approach to stacking sequence retrieval (Q6641922) (← links)