Controlled Gate Networks: Theory and Application to Eigenvalue Estimation
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911606318825472 |
|---|---|
| author | Bee-Lindgren, Max Qian, Zhengrong DeCross, Matthew Brown, Natalie C. Gilbreth, Christopher N. Watkins, Jacob Zhang, Xilin Lee, Dean |
| author_facet | Bee-Lindgren, Max Qian, Zhengrong DeCross, Matthew Brown, Natalie C. Gilbreth, Christopher N. Watkins, Jacob Zhang, Xilin Lee, Dean |
| contents | We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates. We present the general theory of controlled gate networks and show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators. The first example we consider is a variational subspace calculation for a two-qubit system. The second example is estimating the eigenvalues of a two-qubit Hamiltonian via the rodeo algorithm using operators that we call controlled reversal gates. We use the Quantinuum H1-2 and IBM Perth devices to realize the quantum circuits. The third example is the application of controlled gate networks to the controlled time evolution of a free nucleon on a three-dimensional lattice. For all of the examples, we show very substantial reductions in the number of two-qubit gates required. Our work demonstrates that controlled gate networks are a useful tool for reducing gate complexity in quantum algorithms for quantum many-body problems such as those relevant to nuclear physics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2208_13557 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Controlled Gate Networks: Theory and Application to Eigenvalue Estimation Bee-Lindgren, Max Qian, Zhengrong DeCross, Matthew Brown, Natalie C. Gilbreth, Christopher N. Watkins, Jacob Zhang, Xilin Lee, Dean Quantum Physics Nuclear Theory We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates. We present the general theory of controlled gate networks and show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators. The first example we consider is a variational subspace calculation for a two-qubit system. The second example is estimating the eigenvalues of a two-qubit Hamiltonian via the rodeo algorithm using operators that we call controlled reversal gates. We use the Quantinuum H1-2 and IBM Perth devices to realize the quantum circuits. The third example is the application of controlled gate networks to the controlled time evolution of a free nucleon on a three-dimensional lattice. For all of the examples, we show very substantial reductions in the number of two-qubit gates required. Our work demonstrates that controlled gate networks are a useful tool for reducing gate complexity in quantum algorithms for quantum many-body problems such as those relevant to nuclear physics. |
| title | Controlled Gate Networks: Theory and Application to Eigenvalue Estimation |
| topic | Quantum Physics Nuclear Theory |
| url | https://arxiv.org/abs/2208.13557 |