4.7 Article

Constrained optimization via quantum Zeno dynamics

Related references

Note: Only part of the references are listed.
Article Quantum Science & Technology

Peptide conformational sampling using the Quantum Approximate Optimization Algorithm

Sami Boulebnane et al.

Summary: Protein folding has been extensively studied in biochemistry. This study explores the potential of quantum computing to solve a simplified version of protein folding. The Quantum Approximate Optimization Algorithm (QAOA) is numerically evaluated for sampling low-energy conformations of short peptides. The results show that deep quantum circuits are required for accurate results, and the performance of QAOA can be matched by random sampling with small overhead in a more complete version of protein folding.

NPJ QUANTUM INFORMATION (2023)

Review Physics, Applied

Quantum computing for finance

Dylan Herman et al.

Summary: Quantum computers are expected to surpass classical computers and transform industries. This Review focuses on quantum computing for financial applications and provides a summary for physicists on potential advantages and limitations of quantum techniques, as well as challenges that physicists could help tackle.

NATURE REVIEWS PHYSICS (2023)

Article Computer Science, Theory & Methods

Parameter Transfer for Quantum Approximate Optimization ofWeighted MaxCut

Ruslan Shaydulin et al.

Summary: Researchers propose a simple rescaling scheme to overcome the difficulty of parameter optimization in the weighted MaxCut problem. They show that the empirical parameters can be successfully applied to weighted MaxCut instances, achieving approximation ratios equivalent to exhaustive optimization in 96.35% of cases among a dataset of nearly 34,701 instances.

ACM TRANSACTIONS ON QUANTUM COMPUTING (2023)

Article Quantum Science & Technology

Constructing driver Hamiltonians for optimization problems with linear constraints

Hannes Leipold et al.

Summary: Recent advances in adiabatic quantum computing and quantum annealing have focused on using advanced and novel Hamiltonian representations to solve optimization problems. A significant advancement has been the development of driver Hamiltonians that can commute with the constraints of an optimization problem, providing an alternative method for satisfying those constraints. However, the design of successful driver Hamiltonians for multiple constraints currently relies on specific problem intuition and there is no simple general algorithm for generating them.

QUANTUM SCIENCE AND TECHNOLOGY (2022)

Article Physics, Multidisciplinary

General parameter-shift rules for quantum gradients

David Wierichs et al.

Quantum (2022)

Article Multidisciplinary Sciences

Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer

Pradeep Niroula et al.

Summary: This work explores the potential of near-term quantum computers to solve constrained-optimization problems and demonstrates the largest execution of a quantum optimization algorithm that preserves constraints on quantum hardware. By encoding the constraints directly into the quantum circuit, the necessity for this approach is shown. Different optimization algorithms are compared, and the implications of their execution on near-term quantum hardware are discussed.

SCIENTIFIC REPORTS (2022)

Article Quantum Science & Technology

Fundamental limits of quantum error mitigation

Ryuji Takagi et al.

Summary: The article derives fundamental bounds on how error-mitigation algorithms can reduce computation errors, providing insights into optimizing and improving quantum error-mitigation strategies.

NPJ QUANTUM INFORMATION (2022)

Proceedings Paper Computer Science, Theory & Methods

Short-Depth Circuits for Dicke State Preparation

Andreas Bartschi et al.

Summary: We present short-depth quantum circuits for deterministic preparation of Dicke states, with low gate counts and adaptability to various hardware connectivities. This is significant for preparing and compressing symmetric pure states.

2022 IEEE INTERNATIONAL CONFERENCE ON QUANTUM COMPUTING AND ENGINEERING (QCE 2022) (2022)

Proceedings Paper Computer Science, Theory & Methods

Characterizing Error Mitigation by Symmetry Verification in QAOA

Ashish Kakkar et al.

Summary: Researchers propose and demonstrate the effectiveness of symmetry verification in improving the performance of the quantum approximate optimization algorithm (QAOA). They develop a theoretical framework and provide explicit formulas for fidelity improvements under local noise. Numerical investigations show that this approach is effective in addressing problems with specific error rates.

2022 IEEE INTERNATIONAL CONFERENCE ON QUANTUM COMPUTING AND ENGINEERING (QCE 2022) (2022)

Article Physics, Multidisciplinary

Stabilizing lattice gauge theories through simplified local pseudogenerators

Jad C. Halimeh et al.

Summary: This article discusses the implementation of gauge invariance in lattice gauge theories in quantum synthetic matter. By using simplified local pseudogenerators, the authors successfully stabilize gauge invariance and reduce experimental overhead and complexity, enabling faithful simulations of exact gauge theories on polynomial and exponential time scales.

PHYSICAL REVIEW RESEARCH (2022)

Article Quantum Science & Technology

Enhancing Disorder-Free Localization through Dynamically Emergent Local Symmetries

Jad C. Halimeh et al.

Summary: Disorder-free localization is a recently discovered nonergodic phenomenon that prevents thermalization in quantum many-body systems. It has been shown that disorder-free localization can be enhanced by adding linear terms in the gauge-symmetry generator, and this enhancement is achieved through the quantum Zeno effect.

PRX QUANTUM (2022)

Article Quantum Science & Technology

Modular Parity Quantum Approximate Optimization

Kilian Ender et al.

Summary: The parity transformation encodes spin models in the low-energy subspace of a larger Hilbert space with constraints on a planar lattice. By applying quantum approximate optimization algorithm (QAOA), constraints can be enforced explicitly or implicitly, with the implicit approach showing better QAOA performance. Furthermore, a modular parallelization method is introduced to partition the circuit into clusters of subcircuits with fixed maximal circuit depth, relevant for scaling up to large system sizes.

PRX QUANTUM (2022)

Article Computer Science, Artificial Intelligence

Mixer-phaser Ansatze for quantum optimization with hard constraints

Ryan LaRose et al.

Summary: We introduce multiple parametrized circuit ansatze and compare their performance with a standard Quantum Alternating Operator Ansatz approach. The ansatze are inspired by QAOA and compiled to run on near-term superconducting quantum processors. Experimental results show that a mixer-phaser ansatz can achieve similar performance as QAOA, with shorter depth, on most superconducting qubit processors.

QUANTUM MACHINE INTELLIGENCE (2022)

Article Quantum Science & Technology

Quantum walk-based portfolio optimisation

N. Slate et al.

Summary: This paper introduces a highly efficient quantum algorithm for portfolio optimization on near-term noisy intermediate-scale quantum computers. By utilizing the newly developed Quantum Walk Optimization Algorithm, it demonstrates significantly improved performance in finding high-quality solutions to the portfolio optimization problem compared to previous research.

QUANTUM (2021)

Article Physics, Multidisciplinary

Theory of Trotter Error with Commutator Scaling

Andrew M. Childs et al.

Summary: The Lie-Trotter formula and its higher-order generalizations offer a direct approach to decomposing the exponential of a sum of operators, with a theory of Trotter error developed to provide tighter error bounds. This theory, which exploits the commutativity of operator summands, has applications in digital quantum simulation and quantum Monte Carlo methods, improving algorithms for various systems and simulations. The analysis shows that product formulas can preserve the locality of the simulated system, allowing for simulations of local observables with complexity independent of system size for power-law interacting systems.

PHYSICAL REVIEW X (2021)

Article Quantum Science & Technology

Grover Adaptive Search for Constrained Polynomial Binary Optimization

Austin Gilliam et al.

Summary: This paper discusses using Grover Adaptive Search (GAS) to solve Constrained Polynomial Binary Optimization (CPBO) problems, particularly Quadratic Unconstrained Binary Optimization (QUBO) problems, by developing efficient oracles, demonstrating potential speed-up in combinatorial optimization and QUBO, and applying to higher-degree polynomial objective functions and constrained optimization problems.

QUANTUM (2021)

Proceedings Paper Quantum Science & Technology

Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries

Ruslan Shaydulin et al.

Summary: This paper presents an application-specific approach to reduce errors in QAOA evolution by leveraging symmetries in the classical objective function, improving fidelity and sampling accuracy. Experimental verification on an IBM Quantum processor shows an average 23% improvement in quantum state fidelity when leveraging global bit-flip symmetry.

2021 IEEE INTERNATIONAL CONFERENCE ON QUANTUM COMPUTING AND ENGINEERING (QCE 2021) / QUANTUM WEEK 2021 (2021)

Proceedings Paper Quantum Science & Technology

Threshold-Based Quantum Optimization

John Golden et al.

Summary: The study introduces a new quantum optimization algorithm, Th-QAOA, and combines it with the Grover Mixer operator to obtain GM-Th-QAOA. Results show that GM-Th-QAOA outperforms non-thresholded GM-QAOA in terms of approximation ratios across a range of optimization problems and experimental design parameters.

2021 IEEE INTERNATIONAL CONFERENCE ON QUANTUM COMPUTING AND ENGINEERING (QCE 2021) / QUANTUM WEEK 2021 (2021)

Article Quantum Science & Technology

Gauge-Symmetry Protection Using Single-Body Terms

Jad C. Halimeh et al.

Summary: This study presents an experimentally friendly method for protecting gauge invariance in U(1) lattice gauge theories against coherent errors, using single-body energy-penalty terms. The method ensures that undesired gauge sectors are inaccessible for exponentially long times, with little dependence on system size. The findings show exponential improvement over previous results and can be implemented in current ultracold-atom analog simulators and digital quantum devices.

PRX QUANTUM (2021)

Article Quantum Science & Technology

Low-Depth Mechanisms for Quantum Optimization

Jarrod R. McClean et al.

Summary: This work explores intuitive constructions for optimization algorithms based on quantum system dynamics and kinetic energy concepts, examining the physical mechanisms and potential risks in the optimization process, and exploring predictive factors for performance in complex systems.

PRX QUANTUM (2021)

Review Physics, Applied

Variational quantum algorithms

M. Cerezo et al.

Summary: Variational quantum algorithms, utilizing classical optimizers to train parameterized quantum circuits, have emerged as a leading strategy to address the limitations of quantum computing. Despite challenges, they appear to be the best hope for achieving quantum advantage.

NATURE REVIEWS PHYSICS (2021)

Article Quantum Science & Technology

Approximate quantum Fourier transform with O(n log(n)) T gates

Yunseong Nam et al.

NPJ QUANTUM INFORMATION (2020)

Article Quantum Science & Technology

Quantum Zeno Dynamics from General Quantum Operations

Daniel Burgarth et al.

QUANTUM (2020)

Article Computer Science, Theory & Methods

Quantum arithmetic operations based on quantum fourier transform on signed integers

Engin Sahin

INTERNATIONAL JOURNAL OF QUANTUM INFORMATION (2020)

Article Quantum Science & Technology

Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization

Yuval R. Sanders et al.

PRX QUANTUM (2020)

Article Physics, Multidisciplinary

Quantum Algorithms for Systems of Linear Equations Inspired by Adiabatic Quantum Computing

Yigit Subasi et al.

PHYSICAL REVIEW LETTERS (2019)

Article Quantum Science & Technology

A quantum walk-assisted approximate algorithm for bounded NP optimisation problems

S. Marsh et al.

QUANTUM INFORMATION PROCESSING (2019)

Article Computer Science, Artificial Intelligence

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

Stuart Hadfield et al.

ALGORITHMS (2019)

Article Optics

Evaluating analytic gradients on quantum hardware

Maria Schuld et al.

PHYSICAL REVIEW A (2019)

Article Quantum Science & Technology

Halving the cost of quantum addition

Craig Gidney

QUANTUM (2018)

Article Multidisciplinary Sciences

Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets

Abhinav Kandala et al.

NATURE (2017)

Article Quantum Science & Technology

Quantum arithmetic with the quantum Fourier transform

Lidia Ruiz-Perez et al.

QUANTUM INFORMATION PROCESSING (2017)

Review Physics, Multidisciplinary

Quantum Zeno dynamics: mathematical and physical aspects

P. Facchi et al.

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL (2008)

Article Physics, Multidisciplinary

Quantum simulations of classical annealing processes

R. D. Somma et al.

PHYSICAL REVIEW LETTERS (2008)

Article Optics

Unification of dynamical decoupling and the quantum Zeno effect

P Facchi et al.

PHYSICAL REVIEW A (2004)

Article Optics

Quantum search by measurement

AM Childs et al.

PHYSICAL REVIEW A (2002)

Article Physics, Multidisciplinary

Quantum Zeno subspaces

P Facchi et al.

PHYSICAL REVIEW LETTERS (2002)

Article Physics, Multidisciplinary

Quantum Zeno dynamics

P Facchi et al.

PHYSICS LETTERS A (2000)

Article Physics, Multidisciplinary

Efficient factorization with a single pure qubit and log N mixed qubits

S Parker et al.

PHYSICAL REVIEW LETTERS (2000)

Article Computer Science, Information Systems

Quantum optimization

T Hogg et al.

INFORMATION SCIENCES (2000)