ログイン
Language:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 原著論文

Optimized Synthesis of Circuits for Diagonal Unitary Matrices with Reflection Symmetry

https://repo.qst.go.jp/records/2001500
https://repo.qst.go.jp/records/2001500
41ac09f6-f44d-4cb1-b6bb-08dc430ae9c6
アイテムタイプ 学術雑誌論文 / Journal Article(1)
公開日 2025-02-20
タイトル
タイトル Optimized Synthesis of Circuits for Diagonal Unitary Matrices with Reflection Symmetry
言語 en
言語
言語 eng
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者 Xinchi Huang

× Xinchi Huang

Xinchi Huang

Search repository
Taichi Kosugi

× Taichi Kosugi

Taichi Kosugi

Search repository
Hirofumi Nishi

× Hirofumi Nishi

Hirofumi Nishi

Search repository
Matsushita Yuichiro

× Matsushita Yuichiro

Matsushita Yuichiro

Search repository
抄録
内容記述タイプ Abstract
内容記述 During the noisy intermediate-scale quantum (NISQ) era, it is important to optimize the quantum circuits in circuit depth and gate count, especially entanglement gates, including the CNOT gate. Among all the unitary operators, diagonal unitary matrices form a special class that plays a crucial role in many quantum algorithms/subroutines. Based on a natural gate set {CNOT,????}, quantum circuits for general diagonal unitary matrices were discussed in several previous works, and an optimal synthesis algorithm was proposed in terms of circuit depth. In this paper, we are interested in the implementation of diagonal unitary matrices with reflection symmetry, which has promising applications, including the realization of real-time evolution for first quantized Hamiltonians by quantum circuits. Owing to such a symmetric property, we show that the quantum circuit in the existing work can be further simplified and propose a constructive algorithm that optimizes the entanglement gate count. Compared to the previous synthesis methods for general diagonal unitary matrices, the quantum circuit by our proposed algorithm achieves nearly half the reduction in both the gate count and circuit depth.
書誌情報 Journal of the Physical Society of Japan

巻 93, p. 054002, 発行日 2024-04
DOI
識別子タイプ DOI
関連識別子 10.7566/JPSJ.93.054002
戻る
0
views
See details
Views

Versions

Ver.1 2025-08-15 05:54:52.943017
Show All versions

Share

Share
tweet

Cite as

Other

print

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR 2.0
  • OAI-PMH JPCOAR 1.0
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX
  • ZIP

コミュニティ

確認

確認

確認


Powered by WEKO3


Powered by WEKO3