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 …
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 …
From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
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 …
enabling the implementation of a wider variety of algorithms. Of particular interest are …
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 …
Entanglement perspective on the quantum approximate optimization algorithm
Many quantum algorithms seek to output a specific bitstring solving the problem of interest—
or a few if the solution is degenerate. It is the case for the quantum approximate optimization …
or a few if the solution is degenerate. It is the case for the quantum approximate optimization …
Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm
The binary paint shop problem (BPSP) is an APX-hard optimization problem of the
automotive industry. In this work, we show how to use the quantum approximate optimization …
automotive industry. In this work, we show how to use the quantum approximate optimization …
Quantum optimization via four-body Rydberg gates
A large ongoing research effort focuses on obtaining a quantum advantage in the solution of
combinatorial optimization problems on near-term quantum devices. A particularly promising …
combinatorial optimization problems on near-term quantum devices. A particularly promising …
Two-Dimensional Lattice Gauge Theory on a Near-Term Quantum Simulator: Variational Quantum Optimization, Confinement, and Topological Order
We propose an implementation of a two-dimensional Z 2 lattice gauge theory model on a
shallow quantum circuit, involving a number of single-and two-qubit gates comparable to …
shallow quantum circuit, involving a number of single-and two-qubit gates comparable to …
Circuit depth reduction for gate-model quantum computers
L Gyongyosi, S Imre - Scientific reports, 2020 - nature.com
Quantum computers utilize the fundamentals of quantum mechanics to solve computational
problems more efficiently than traditional computers. Gate-model quantum computers are …
problems more efficiently than traditional computers. Gate-model quantum computers are …
Universal parity quantum computing
We propose a universal gate set for quantum computing with all-to-all connectivity and
intrinsic robustness to bit-flip errors based on parity encoding. We show that logical …
intrinsic robustness to bit-flip errors based on parity encoding. We show that logical …