RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations
Swagat Kumar, Jan-Nico Zaech, Colin Michael Wilmott, Luc Van Gool

TL;DR
RhoDARTS introduces a quantum-aware, differentiable architecture search method that models quantum circuit optimization as the evolution of a mixed state, effectively handling noise and reducing simulation costs.
Contribution
It presents a novel quantum architecture search algorithm based on density matrix simulations, incorporating noise models and avoiding classical neural network sampling.
Findings
Comparable or better performance than existing QAS methods
Requires fewer quantum simulations during training
Enhanced robustness to noise
Abstract
Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers. However, choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task. Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem. Existing QAS approaches typically adapt classical neural architecture search techniques, training machine learning models to sample relevant circuits, but often overlook the inherent quantum nature of the circuits they produce. By reformulating QAS from a quantum perspective, we propose a sampling-free differentiable QAS algorithm that models the search process as the evolution of a quantum mixed state, which emerges from the search space of quantum circuits. The mixed state formulation also enables our method to incorporate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · Quantum Computing Algorithms and Architecture · Scientific Computing and Data Management
