Quantum computing for finance
Quantum computers are expected to surpass the computational capabilities of classical
computers and have a transformative impact on numerous industry sectors. We present a …
computers and have a transformative impact on numerous industry sectors. We present a …
Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem
The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm
for solving optimization problems on quantum computers. However, the potential of QAOA to …
for solving optimization problems on quantum computers. However, the potential of QAOA to …
Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems
We develop a hardware-efficient ansatz for variational optimization, derived from existing
ansatzes in the literature, that parametrizes subsets of all interactions in the cost Hamiltonian …
ansatzes in the literature, that parametrizes subsets of all interactions in the cost Hamiltonian …
Constrained optimization via quantum zeno dynamics
Constrained optimization problems are ubiquitous in science and industry. Quantum
algorithms have shown promise in solving optimization problems, yet none of the current …
algorithms have shown promise in solving optimization problems, yet none of the current …
Performance analysis of multi-angle QAOA for
In this paper we consider the scalability of multi-angle QAOA with respect to the number of
QAOA layers. We found that MA-QAOA is able to significantly reduce the depth of QAOA …
QAOA layers. We found that MA-QAOA is able to significantly reduce the depth of QAOA …
End-to-end protocol for high-quality QAOA parameters with few shots
The quantum approximate optimization algorithm (QAOA) is a quantum heuristic for
combinatorial optimization that has been demonstrated to scale better than state-of-the-art …
combinatorial optimization that has been demonstrated to scale better than state-of-the-art …
Efficient molecular conformation generation with quantum-inspired algorithm
Context Conformation generation, also known as molecular unfolding (MU), is a crucial step
in structure-based drug design, remaining a challenging combinatorial optimization …
in structure-based drug design, remaining a challenging combinatorial optimization …
Trainability barriers in low-depth qaoa landscapes
The Quantum Alternating Operator Ansatz (QAOA) is a prominent variational quantum
algorithm for solving combinatorial optimization problems. Its effectiveness depends on …
algorithm for solving combinatorial optimization problems. Its effectiveness depends on …
Synergizing quantum techniques with machine learning for advancing drug discovery challenge
Abstract The Quantum Computing for Drug Discovery Challenge, held at the 42nd
International Conference on Computer-Aided Design (ICCAD) in 2023, was a multi-month …
International Conference on Computer-Aided Design (ICCAD) in 2023, was a multi-month …
A Quantum Approximate Optimization Algorithm for Local Hamiltonian Problems
Local Hamiltonian Problems (LHPs) are important problems that are computationally QMA-
complete and physically relevant for many-body quantum systems. Quantum MaxCut (QMC) …
complete and physically relevant for many-body quantum systems. Quantum MaxCut (QMC) …