File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: Efficient Preparation of Cyclic Quantum States
Title | Efficient Preparation of Cyclic Quantum States |
---|---|
Authors | |
Keywords | Quantum algorithm Design automation Numerical analysis Qubit Asia |
Issue Date | 2022 |
Publisher | IEEE. |
Citation | 27th Asia and South Pacific Design Automation Conference (ASP-DAC) (Virtual), 17-20 January, 2022. In 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC), p. 460-465 How to Cite? |
Abstract | Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum states that are invariant under permutations, e.g. Dicke states, have intriguing properties. In this paper, we consider states invariant under cyclic permutations, which we call cyclic states. We present a quantum algorithm that deterministically prepares cyclic states with gate complexity O(n) without requiring any ancillary qubit. Through both analytical and numerical analyses, we show that our algorithm is more efficient than existing ones. |
Persistent Identifier | http://hdl.handle.net/10722/315808 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mozafari, F | - |
dc.contributor.author | Yang, Y | - |
dc.contributor.author | De Micheli, G | - |
dc.date.accessioned | 2022-08-19T09:04:49Z | - |
dc.date.available | 2022-08-19T09:04:49Z | - |
dc.date.issued | 2022 | - |
dc.identifier.citation | 27th Asia and South Pacific Design Automation Conference (ASP-DAC) (Virtual), 17-20 January, 2022. In 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC), p. 460-465 | - |
dc.identifier.uri | http://hdl.handle.net/10722/315808 | - |
dc.description.abstract | Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum states that are invariant under permutations, e.g. Dicke states, have intriguing properties. In this paper, we consider states invariant under cyclic permutations, which we call cyclic states. We present a quantum algorithm that deterministically prepares cyclic states with gate complexity O(n) without requiring any ancillary qubit. Through both analytical and numerical analyses, we show that our algorithm is more efficient than existing ones. | - |
dc.language | eng | - |
dc.publisher | IEEE. | - |
dc.relation.ispartof | 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC) | - |
dc.rights | 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC). Copyright © IEEE. | - |
dc.subject | Quantum algorithm | - |
dc.subject | Design automation | - |
dc.subject | Numerical analysis | - |
dc.subject | Qubit | - |
dc.subject | Asia | - |
dc.title | Efficient Preparation of Cyclic Quantum States | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Yang, Y: yxyang@hku.hk | - |
dc.identifier.authority | Yang, Y=rp02848 | - |
dc.identifier.doi | 10.1109/ASP-DAC52403.2022.9712522 | - |
dc.identifier.hkuros | 335812 | - |
dc.identifier.spage | 460 | - |
dc.identifier.epage | 465 | - |
dc.publisher.place | United States | - |