Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.08928 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909388771426304 |
|---|---|
| author | Anand, Kartik |
| author_facet | Anand, Kartik |
| contents | We motivate an intuitive way to think about quantum circuit optimization problem inspired by Feynman's path formalism. While the use of path integrals in quantum circuits remains largely underdeveloped due to the lack of definition of the action functional for such systems. However this feynman's path perspective leads us to consider about how entanglement evolution throughout the circuit can serve as a guiding principle for optimizing circuit design. We conjecture that an optimal state-path is highly likely to belong to a family of paths with the minimum possible path-entanglement sum. This could enhance the efficiency of circuit optimization problems by narrowing the state-path search space, leading to faster convergence and reliable output. Further, we discuss that for some special target states this conjecture may not provide significant insights to the circuit optimization problem and argue that such cases constitute only a small subset of the target sets encountered by a circuit optimization algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_08928 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Feynman's Entangled Paths to Optimized Circuit Design Anand, Kartik Quantum Physics We motivate an intuitive way to think about quantum circuit optimization problem inspired by Feynman's path formalism. While the use of path integrals in quantum circuits remains largely underdeveloped due to the lack of definition of the action functional for such systems. However this feynman's path perspective leads us to consider about how entanglement evolution throughout the circuit can serve as a guiding principle for optimizing circuit design. We conjecture that an optimal state-path is highly likely to belong to a family of paths with the minimum possible path-entanglement sum. This could enhance the efficiency of circuit optimization problems by narrowing the state-path search space, leading to faster convergence and reliable output. Further, we discuss that for some special target states this conjecture may not provide significant insights to the circuit optimization problem and argue that such cases constitute only a small subset of the target sets encountered by a circuit optimization algorithm. |
| title | Feynman's Entangled Paths to Optimized Circuit Design |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2411.08928 |