Pith. sign in

REVIEW 1 cited by

Robust resource-efficient quantum variational ansatz through evolutionary algorithm

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.13714 v2 pith:344GLWMV submitted 2022-02-28 quant-ph cond-mat.str-el

classification quant-phcond-mat.str-el
keywords circuitquantumrobustansatzclassicalmethodresource-efficientadvantage
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Variational quantum algorithms (VQAs) are promising methods to demonstrate quantum advantage on near-term devices as the required resources are divided between a quantum simulator and a classical optimizer. As such, designing a VQA which is resource-efficient and robust against noise is a key factor to achieve potential advantage with the existing noisy quantum simulators. It turns out that a fixed VQA circuit design, such as the widely-used hardware efficient ansatz, is not necessarily robust against imperfections. In this work, we propose a genome-length-adjustable evolutionary algorithm to design a robust VQA circuit that is optimized over variations of both circuit ansatz and gate parameters, without any prior assumptions on circuit structure or depth. Remarkably, our method not only generates a noise-effect-minimized circuit with shallow depth, but also accelerates the classical optimization by substantially reducing the number of parameters. In this regard, the optimized circuit is far more resource-efficient with respect to both quantum and classical resources. As applications, based on two typical error models in VQA, we apply our method to calculate the ground energy of the hydrogen and the water molecules as well as the Heisenberg model. Simulations suggest that compared with conventional hardware efficient ansatz, our circuit-structure-tunable method can generate circuits apparently more robust against both coherent and incoherent noise, and hence is more likely to be implemented on near-term devices.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Emergent Problem-Graph Alignment in RL-Discovered Entanglement Topologies for QAOA

    quant-ph 2026-08 conditional novelty 6.0 of 10

    An RL agent discovers sparse entanglement topologies for QAOA that align with the MaxCut problem graph and outperform the full graph under limited optimization budgets.

Pith tools