Realization of quantum signal processing on a noisy quantum computer
Abstract Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is challenging because it requires a deep quantum circuit in ge...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2023-09-01
|
| Series: | npj Quantum Information |
| Online Access: | https://doi.org/10.1038/s41534-023-00762-0 |
| _version_ | 1797451896150032384 |
|---|---|
| author | Yuta Kikuchi Conor Mc Keever Luuk Coopmans Michael Lubasch Marcello Benedetti |
| author_facet | Yuta Kikuchi Conor Mc Keever Luuk Coopmans Michael Lubasch Marcello Benedetti |
| author_sort | Yuta Kikuchi |
| collection | DOAJ |
| description | Abstract Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is challenging because it requires a deep quantum circuit in general. We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step. To illustrate the approach, we consider the application of Hamiltonian simulation for which QSP implements a polynomial approximation of the time evolution operator. We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell. In particular, we compute the time dependence of bipartite entanglement entropies for Ising spin chains and find good agreements with exact numerical simulations. To make the best use of the device, we determine optimal experimental parameters by using a simplified error model for the hardware and numerically studying the trade-off between Hamiltonian simulation time, polynomial degree, and total accuracy. Our results are the first step in the experimental realization of QSP-based quantum algorithms. |
| first_indexed | 2024-03-09T15:01:02Z |
| format | Article |
| id | doaj.art-738f7a583bf64efcafb16581d4017109 |
| institution | Directory Open Access Journal |
| issn | 2056-6387 |
| language | English |
| last_indexed | 2024-03-09T15:01:02Z |
| publishDate | 2023-09-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | npj Quantum Information |
| spelling | doaj.art-738f7a583bf64efcafb16581d40171092023-11-26T13:55:22ZengNature Portfolionpj Quantum Information2056-63872023-09-019111210.1038/s41534-023-00762-0Realization of quantum signal processing on a noisy quantum computerYuta Kikuchi0Conor Mc Keever1Luuk Coopmans2Michael Lubasch3Marcello Benedetti4Quantinuum K.K., Otemachi Financial City Grand Cube 3FQuantinuum, Partnership HouseQuantinuum, Partnership HouseQuantinuum, Partnership HouseQuantinuum, Partnership HouseAbstract Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is challenging because it requires a deep quantum circuit in general. We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step. To illustrate the approach, we consider the application of Hamiltonian simulation for which QSP implements a polynomial approximation of the time evolution operator. We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell. In particular, we compute the time dependence of bipartite entanglement entropies for Ising spin chains and find good agreements with exact numerical simulations. To make the best use of the device, we determine optimal experimental parameters by using a simplified error model for the hardware and numerically studying the trade-off between Hamiltonian simulation time, polynomial degree, and total accuracy. Our results are the first step in the experimental realization of QSP-based quantum algorithms.https://doi.org/10.1038/s41534-023-00762-0 |
| spellingShingle | Yuta Kikuchi Conor Mc Keever Luuk Coopmans Michael Lubasch Marcello Benedetti Realization of quantum signal processing on a noisy quantum computer npj Quantum Information |
| title | Realization of quantum signal processing on a noisy quantum computer |
| title_full | Realization of quantum signal processing on a noisy quantum computer |
| title_fullStr | Realization of quantum signal processing on a noisy quantum computer |
| title_full_unstemmed | Realization of quantum signal processing on a noisy quantum computer |
| title_short | Realization of quantum signal processing on a noisy quantum computer |
| title_sort | realization of quantum signal processing on a noisy quantum computer |
| url | https://doi.org/10.1038/s41534-023-00762-0 |
| work_keys_str_mv | AT yutakikuchi realizationofquantumsignalprocessingonanoisyquantumcomputer AT conormckeever realizationofquantumsignalprocessingonanoisyquantumcomputer AT luukcoopmans realizationofquantumsignalprocessingonanoisyquantumcomputer AT michaellubasch realizationofquantumsignalprocessingonanoisyquantumcomputer AT marcellobenedetti realizationofquantumsignalprocessingonanoisyquantumcomputer |