Variational quantum algorithms
Applications such as simulating complicated quantum systems or solving large-scale linear
algebra problems are very challenging for classical computers, owing to the extremely high …
algebra problems are very challenging for classical computers, owing to the extremely high …
Noisy intermediate-scale quantum algorithms
A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …
integer factorization and unstructured database search requires millions of qubits with low …
Quantum circuits with many photons on a programmable nanophotonic chip
Growing interest in quantum computing for practical applications has led to a surge in the
availability of programmable machines for executing quantum algorithms,. Present-day …
availability of programmable machines for executing quantum algorithms,. Present-day …
Noise-induced barren plateaus in variational quantum algorithms
Abstract Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on
Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise …
Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise …
Parameterized quantum circuits as machine learning models
Hybrid quantum–classical systems make it possible to utilize existing quantum computers to
their fullest extent. Within this framework, parameterized quantum circuits can be regarded …
their fullest extent. Within this framework, parameterized quantum circuits can be regarded …
Pennylane: Automatic differentiation of hybrid quantum-classical computations
PennyLane is a Python 3 software framework for differentiable programming of quantum
computers. The library provides a unified architecture for near-term quantum computing …
computers. The library provides a unified architecture for near-term quantum computing …
Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices
The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical
variational algorithm designed to tackle combinatorial optimization problems. Despite its …
variational algorithm designed to tackle combinatorial optimization problems. Despite its …
A review on quantum approximate optimization algorithm and its variants
Abstract The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising
variational quantum algorithm that aims to solve combinatorial optimization problems that …
variational quantum algorithm that aims to solve combinatorial optimization problems that …
Variational quantum linear solver
Previously proposed quantum algorithms for solving linear systems of equations cannot be
implemented in the near term due to the required circuit depth. Here, we propose a hybrid …
implemented in the near term due to the required circuit depth. Here, we propose a hybrid …
Performance of the quantum approximate optimization algorithm on the maximum cut problem
GE Crooks - arxiv preprint arxiv:1811.08419, 2018 - arxiv.org
The Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for
programming a near-term gate-based hybrid quantum computer to find good approximate …
programming a near-term gate-based hybrid quantum computer to find good approximate …