paper-with-me

홈 › Papers

Quantum Deep Dreaming: A Novel Approach for Quantum Circuit Design

2022-11-05 · Romi Lifshitz

One of the challenges currently facing the quantum computing community is the design of quantum circuits which can efficiently run on near-term quantum computers, known as the quantum compiling problem. Algorithms such as the Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and Quantum Architecture Search (QAS) have been shown to generate or find optimal near-term quantum circuits. However, these methods are computationally expensive and yield little insight into the circuit design process. In this paper, we propose Quantum Deep Dreaming (QDD), an algorithm that generates optimal quantum circuit architectures for specified objectives, such as ground state preparation, while providing insight into the circuit design process. In QDD, we first train a neural network to predict some property of a quantum circuit (such as VQE energy). Then, we employ the Deep Dreaming technique on the trained network to iteratively update an initial circuit to achieve a target property value (such as ground state VQE energy). Importantly, this iterative updating allows us to analyze the intermediate circuits of the dreaming process and gain insights into the circuit features that the network is modifying during dreaming. We demonstrate that QDD successfully generates, or 'dreams', circuits of six qubits close to ground state energy (Transverse Field Ising Model VQE energy) and that dreaming analysis yields circuit design insights. QDD is designed to optimize circuits with any target property and can be applied to circuit design problems both within and outside of quantum chemistry. Hence, QDD lays the foundation for the future discovery of optimized quantum circuits and for increased interpretability of automated quantum algorithm design.

📄 PDF Abstract BibTeX arXiv:2211.04343

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Neural Architecture Search Algorithms for Quantum Autoencoders

2025-09-18 · Ankit Kulshrestha, Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Ilya Safro arxiv

The design of quantum circuits is currently driven by the specific objectives of the quantum algorithm in question. This approach thus relies on a significant manual effort by the quantum algorithm designer to design an …

Neural Architecture Search

Differentiable Quantum Architecture Search for Quantum Reinforcement Learning

2023-09-19 · Yize Sun, Yunpu Ma, Volker Tresp

Differentiable quantum architecture search (DQAS) is a gradient-based framework to design quantum circuits automatically in the NISQ era. It was motivated by such as low fidelity of quantum hardware, low flexibility of c…

Q-LearningQuantum Machine Learningreinforcement-learningReinforcement Learning

Reinforcement Learning for Quantum Circuit Design: Using Matrix Representations

2025-01-27 · Zhiyuan Wang, Chunlin Feng, Christopher Poon, Lijian Huang 외

Quantum computing promises advantages over classical computing. The manufacturing of quantum hardware is in the infancy stage, called the Noisy Intermediate-Scale Quantum (NISQ) era. A major challenge is automated quantu…

Deep Reinforcement LearningQ-Learningreinforcement-learningReinforcement Learning

Incorporating Quantum Advantage in Quantum Circuit Generation through Genetic Programming

2025-01-16 · Christoph Stein, Michael Färber

Designing efficient quantum circuits that leverage quantum advantage compared to classical computing has become increasingly critical. Genetic algorithms have shown potential in generating such circuits through artificia…

Quantum Circuit Generation

Deep Quantum Graph Dreaming: Deciphering Neural Network Insights into Quantum Experiments

2023-09-13 · Tareq Jaouni, Sören Arlt, Carlos Ruiz-Gonzalez, Ebrahim Karimi 외

Despite their promise to facilitate new scientific discoveries, the opaqueness of neural networks presents a challenge in interpreting the logic behind their findings. Here, we use a eXplainable-AI (XAI) technique called…

scientific discovery