Pith. sign in

REVIEW 3 cited by

Quantum Neural Architecture Search with Quantum Circuits Metric and Bayesian Optimization

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 2206.14115 v1 pith:CAOV753E submitted 2022-06-28 quant-ph cs.ITcs.LGmath.IT

classification quant-phcs.ITcs.LGmath.IT
keywords quantumneuraloptimizationarchitecturebayesiancircuitsgateslearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum neural networks are promising for a wide range of applications in the Noisy Intermediate-Scale Quantum era. As such, there is an increasing demand for automatic quantum neural architecture search. We tackle this challenge by designing a quantum circuits metric for Bayesian optimization with Gaussian process. To this goal, we propose a new quantum gates distance that characterizes the gates' action over every quantum state and provide a theoretical perspective on its geometrical properties. Our approach significantly outperforms the benchmark on three empirical quantum machine learning problems including training a quantum generative adversarial network, solving combinatorial optimization in the MaxCut problem, and simulating quantum Fourier transform. Our method can be extended to characterize behaviors of various quantum machine learning models.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Discovering Data Encoding Strategies for Quantum-Classical Neural Networks Using Monte Carlo Tree Search

    quant-ph 2026-05 conditional novelty 7.0 of 10

    MCTS discovers superior data encoding circuits for QCCNNs that outperform standard encodings on medical datasets, with effective rank of feature maps serving as a performance predictor.

  2. Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction

    quant-ph 2025-01 unverdicted novelty 7.0 of 10

    Position graph abstraction plus SHAPER/SHAW heuristics enable shuttling-aware compilation on trapped-ion machines, succeeding on extreme cases where baselines fail and yielding 1.45x average (up to 4x) speedups.

  3. Rethinking Expressibility-Trainability Trade-off in Hybrid Quantum Neural Networks

    quant-ph 2026-05 unverdicted novelty 6.0 of 10

    Full end-to-end hybrid training decouples trainability from PQC expressibility, unlike pure PQCs which show only a weak regime-dependent trade-off.

Pith tools