Circuit Design based on Feature Similarity for Quantum Generative Modeling
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929761493712896 |
|---|---|
| author | Makarski, Mathis Kato, Jumpei Sato, Yuki Yamamoto, Naoki |
| author_facet | Makarski, Mathis Kato, Jumpei Sato, Yuki Yamamoto, Naoki |
| contents | Quantum generative models may achieve an advantage on quantum devices by their inherent probabilistic nature and efficient sampling strategies. However, current approaches mostly rely on general-purpose circuits, such as the hardware efficient ansatz paired with a random initialization strategy, which are known to suffer from trainability issues such as barren plateaus. To address these issues, a tensor network pretraining framework that initializes a quantum circuit ansatz with a classically computed high-quality solution for a linear entanglement structure has been proposed in literature. In order to improve the classical solution, the quantum circuit needs to be extended, while it is still an open question how the extension affects trainability. In this work, we propose the metric-based extension heuristic to design an extended circuit based on a similarity metric measured between the dataset features. We validate this method on the bars and stripes dataset and carry out experiments on financial data. Our results underline the importance of problem-informed circuit design and show that the metric-based extension heuristic offers the means to introduce inductive bias while designing a circuit under limited resources. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_11983 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Circuit Design based on Feature Similarity for Quantum Generative Modeling Makarski, Mathis Kato, Jumpei Sato, Yuki Yamamoto, Naoki Quantum Physics Quantum generative models may achieve an advantage on quantum devices by their inherent probabilistic nature and efficient sampling strategies. However, current approaches mostly rely on general-purpose circuits, such as the hardware efficient ansatz paired with a random initialization strategy, which are known to suffer from trainability issues such as barren plateaus. To address these issues, a tensor network pretraining framework that initializes a quantum circuit ansatz with a classically computed high-quality solution for a linear entanglement structure has been proposed in literature. In order to improve the classical solution, the quantum circuit needs to be extended, while it is still an open question how the extension affects trainability. In this work, we propose the metric-based extension heuristic to design an extended circuit based on a similarity metric measured between the dataset features. We validate this method on the bars and stripes dataset and carry out experiments on financial data. Our results underline the importance of problem-informed circuit design and show that the metric-based extension heuristic offers the means to introduce inductive bias while designing a circuit under limited resources. |
| title | Circuit Design based on Feature Similarity for Quantum Generative Modeling |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2503.11983 |