Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2504.09318 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909578486087680 |
|---|---|
| author | Cambiucci, Waldemir Silveira, Regina Melo Ruggiero, Wilson Vicente |
| author_facet | Cambiucci, Waldemir Silveira, Regina Melo Ruggiero, Wilson Vicente |
| contents | Adaptive quantum circuits enhance flexibility and efficiency over traditional static circuits by dynamically adjusting their structure and parameters in real-time based on intermediate measurement outcomes. This paper introduces a novel hypergraph representation for adaptive quantum circuits, where groups of gates are considered as participants of hyperedges. By incorporating these gate groups into hyperedges, we create an extended hypergraph that includes constraints usable during the partitioning process. This approach guides the partitioning to maintain groups of ports associated with classical operations, ensuring that the resulting partitions prioritize qubits involved in the same sections of classical operations inherent to the adaptive approach. We present a new hypergraph partitioning algorithm based as an extension of Fiduccia-Mattheyses heuristic, to support hypergraphs created from adaptive quantum circuits. Comparative analysis between static and adaptive methods demonstrates the effectiveness of the proposed hypergraph techniques for adaptive circuits. Experimental results using benchmark quantum circuits validate our theoretical insights, showing improvements in circuit representation for partitioning heuristics. These findings highlight the practical benefits of hypergraph representation in adaptive quantum computing. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_09318 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hypergraphic representation for adaptive quantum circuits Cambiucci, Waldemir Silveira, Regina Melo Ruggiero, Wilson Vicente Quantum Physics Adaptive quantum circuits enhance flexibility and efficiency over traditional static circuits by dynamically adjusting their structure and parameters in real-time based on intermediate measurement outcomes. This paper introduces a novel hypergraph representation for adaptive quantum circuits, where groups of gates are considered as participants of hyperedges. By incorporating these gate groups into hyperedges, we create an extended hypergraph that includes constraints usable during the partitioning process. This approach guides the partitioning to maintain groups of ports associated with classical operations, ensuring that the resulting partitions prioritize qubits involved in the same sections of classical operations inherent to the adaptive approach. We present a new hypergraph partitioning algorithm based as an extension of Fiduccia-Mattheyses heuristic, to support hypergraphs created from adaptive quantum circuits. Comparative analysis between static and adaptive methods demonstrates the effectiveness of the proposed hypergraph techniques for adaptive circuits. Experimental results using benchmark quantum circuits validate our theoretical insights, showing improvements in circuit representation for partitioning heuristics. These findings highlight the practical benefits of hypergraph representation in adaptive quantum computing. |
| title | Hypergraphic representation for adaptive quantum circuits |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2504.09318 |