Pith. sign in

REVIEW 1 cited by

A semi-agnostic ansatz with variable structure for quantum machine learning

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 2103.06712 v4 pith:CE2WZQZB submitted 2021-03-11 quant-ph cs.LGstat.ML

classification quant-phcs.LGstat.ML
keywords quantumansatzvansvariableansatzesapplicationsapproachchemistry
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum machine learning -- and specifically Variational Quantum Algorithms (VQAs) -- offers a powerful, flexible paradigm for programming near-term quantum computers, with applications in chemistry, metrology, materials science, data science, and mathematics. Here, one trains an ansatz, in the form of a parameterized quantum circuit, to accomplish a task of interest. However, challenges have recently emerged suggesting that deep ansatzes are difficult to train, due to flat training landscapes caused by randomness or by hardware noise. This motivates our work, where we present a variable structure approach to build ansatzes for VQAs. Our approach, called VAns (Variable Ansatz), applies a set of rules to both grow and (crucially) remove quantum gates in an informed manner during the optimization. Consequently, VAns is ideally suited to mitigate trainability and noise-related issues by keeping the ansatz shallow. We employ VAns in the variational quantum eigensolver for condensed matter and quantum chemistry applications, in the quantum autoencoder for data compression and in unitary compilation problems showing successful results in all cases.

Discussion (0). Sign in 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. Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms

    quant-ph 2025-07 conditional novelty 4.0 of 10

    In small variational quantum eigensolver problems, high Hamiltonian expressibility helps for superposition-state problems while low expressibility helps for basis-state problems.

Pith tools