Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on
Heavy-Hex Graphs
- URL: http://arxiv.org/abs/2312.00997v1
- Date: Sat, 2 Dec 2023 01:47:05 GMT
- Title: Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on
Heavy-Hex Graphs
- Authors: Elijah Pelofske, Andreas B\"artschi, Lukasz Cincio, John Golden,
Stephan Eidenbenz
- Abstract summary: We show that the Quantum Alternating Operator Ansatz (QAOA) for higher-order, random-coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes.
We show that the best quantum processors generally find lower energy solutions up to $p=3$ for 27 qubit systems and up to $p=2$ for 127 qubit systems.
- Score: 1.1549572298362787
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We show through numerical simulation that the Quantum Alternating Operator
Ansatz (QAOA) for higher-order, random-coefficient, heavy-hex compatible spin
glass Ising models has strong parameter concentration across problem sizes from
$16$ up to $127$ qubits for $p=1$ up to $p=5$, which allows for
straight-forward transfer learning of QAOA angles on instance sizes where
exhaustive grid-search is prohibitive even for $p>1$. We use Matrix Product
State (MPS) simulation at different bond dimensions to obtain confidence in
these results, and we obtain the optimal solutions to these combinatorial
optimization problems using CPLEX. In order to assess the ability of current
noisy quantum hardware to exploit such parameter concentration, we execute
short-depth QAOA circuits (with a CNOT depth of 6 per $p$, resulting in
circuits which contain $1420$ two qubit gates for $127$ qubit $p=5$ QAOA) on
$100$ higher-order (cubic term) Ising models on IBM quantum superconducting
processors with $16, 27, 127$ qubits using QAOA angles learned from a single
$16$-qubit instance. We show that (i) the best quantum processors generally
find lower energy solutions up to $p=3$ for 27 qubit systems and up to $p=2$
for 127 qubit systems and are overcome by noise at higher values of $p$, (ii)
the best quantum processors find mean energies that are about a factor of two
off from the noise-free numerical simulation results. Additional insights from
our experiments are that large performance differences exist among different
quantum processors even of the same generation and that dynamical decoupling
significantly improve performance for some, but decrease performance for other
quantum processors. Lastly we show $p=1$ QAOA angle mean energy landscapes
computed using up to a $414$ qubit quantum computer, showing that the mean QAOA
energy landscapes remain very similar as the problem size changes.
Related papers
- Accurate and precise quantum computation of valence two-neutron systems [0.0]
We introduce a quantum algorithm to accurately and precisely compute the ground state of two-neutron systems.
Our experiments using real quantum devices also show the pivotal role of the circuit layout design, attuned to the connectivity of the qubits.
arXiv Detail & Related papers (2024-04-02T06:54:13Z) - Towards multiqudit quantum processor based on a $^{171}$Yb$^{+}$ ion
string: Realizing basic quantum algorithms [30.243813713554655]
We demonstrate a quantum processor based on a 3D linear Paul trap that uses $171$Yb$+$ ions with 8 individually controllable four-level qudits (ququarts)
The design of the developed ion trap provides high secular, low heating rate, which together with individual addressing and readout optical systems allows executing quantum algorithms.
Our results pave the way to scalable qudit-based quantum processors using trapped ions.
arXiv Detail & Related papers (2024-02-05T15:48:43Z) - Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - Simulation of IBM's kicked Ising experiment with Projected Entangled
Pair Operator [71.10376783074766]
We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation.
Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture.
We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
arXiv Detail & Related papers (2023-08-06T10:24:23Z) - On sampling determinantal and Pfaffian point processes on a quantum
computer [49.1574468325115]
DPPs were introduced by Macchi as a model in quantum optics the 1970s.
Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one.
Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
arXiv Detail & Related papers (2023-05-25T08:43:11Z) - QAOA with $N\cdot p\geq 200$ [2.926192989090622]
We demonstrate the execution of a hybrid quantum/classical optimization algorithm with high $Ncdot p$.
This is the highest $Ncdot p$ demonstrated on hardware to date.
arXiv Detail & Related papers (2023-03-03T16:32:49Z) - Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on
NISQ Computers [0.0]
Quantum Alternating Operator Ansatz (QAOA) are both quantum algorithms intended for optimal solutions of optimization problems.
We implement a rigorous comparison between QA on D-Wave hardware and QAOA on IBMQ hardware.
We find that QA outperforms QAOA on all problem instances.
arXiv Detail & Related papers (2023-01-02T04:19:46Z) - QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum
machines [81.4597482536073]
Quantum approximate optimization algorithms (QAOAs) utilize the power of quantum machines and inherit the spirit of adiabatic evolution.
We propose QAOA-in-QAOA ($textQAOA2$) to solve arbitrary large-scale MaxCut problems using quantum machines.
Our method can be seamlessly embedded into other advanced strategies to enhance the capability of QAOAs in large-scale optimization problems.
arXiv Detail & Related papers (2022-05-24T03:49:10Z) - Unimon qubit [42.83899285555746]
Superconducting qubits are one of the most promising candidates to implement quantum computers.
Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
arXiv Detail & Related papers (2022-03-11T12:57:43Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.