東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Shallow Quantum Circuits: Algorithms...

Liu, Yunchao,

FindBook

Google Book

Amazon

博客來

Shallow Quantum Circuits: Algorithms, Complexity, and Fault Tolerance /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Shallow Quantum Circuits: Algorithms, Complexity, and Fault Tolerance // Yunchao Liu.
作者:	Liu, Yunchao,
面頁冊數:	1 electronic resource (299 pages)
附註:	Source: Dissertations Abstracts International, Volume: 86-03, Section: B.
Contained By:	Dissertations Abstracts International86-03B.
標題:	Computer science. -
電子資源:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31555795
ISBN:	9798384455783

Shallow Quantum Circuits: Algorithms, Complexity, and Fault Tolerance /
Liu, Yunchao,

Shallow Quantum Circuits: Algorithms, Complexity, and Fault Tolerance /Yunchao Liu. - 1 electronic resource (299 pages)

Source: Dissertations Abstracts International, Volume: 86-03, Section: B.

A fundamental goal of quantum computing is to demonstrate computational advantage over classical computers. Shallow quantum circuits play a central role in this effort as the field transits from the Noisy Intermediate Scale Quantum (NISQ) era to the Early Fault Tolerant era. This thesis describes three lines of research on the theoretical foundation of achieving quantum computational advantage using shallow quantum circuits.The first is complexity and applications of random circuit sampling (RCS), an experiment at the heart of recent "quantum supremacy" experiments. We describe recent progress in understanding the computational complexity of RCS and its applications in benchmarking noisy quantum devices.The second is learning algorithms. We give polynomial time algorithms for learning shallow quantum circuits and quantum states prepared by shallow circuits.The third is fault tolerance. We discuss the prospects of achieving quantum computational advantage using fault tolerance techniques within noisy shallow circuits, and describe two new techniques toward this goal, including fault tolerance against input noise and single-shot logical state preparation.

English

ISBN: 9798384455783Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

Random circuit sampling

Shallow Quantum Circuits: Algorithms, Complexity, and Fault Tolerance /
LDR:02582nmm a22004093i 4500 001 2431778
005 20250624130448.5
006 m o d
007 cr|nu||||||||
008 261011s2024 miu||||||m |||||||eng d
020 $a 9798384455783
035 $a (MiAaPQD)AAI31555795
035 $a AAI31555795
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Liu, Yunchao, $e author. $3 3820745
245 1 0 $a Shallow Quantum Circuits: Algorithms, Complexity, and Fault Tolerance / $c Yunchao Liu.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2024
300 $a 1 electronic resource (299 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 86-03, Section: B.
500 $a Advisors: Vazirani, Umesh Committee members: Aharonov, Dorit; Tal, Avishay; Wright, John; Lin, Lin.
502 $b Ph.D. $c University of California, Berkeley $d 2024.
520 $a A fundamental goal of quantum computing is to demonstrate computational advantage over classical computers. Shallow quantum circuits play a central role in this effort as the field transits from the Noisy Intermediate Scale Quantum (NISQ) era to the Early Fault Tolerant era. This thesis describes three lines of research on the theoretical foundation of achieving quantum computational advantage using shallow quantum circuits.The first is complexity and applications of random circuit sampling (RCS), an experiment at the heart of recent "quantum supremacy" experiments. We describe recent progress in understanding the computational complexity of RCS and its applications in benchmarking noisy quantum devices.The second is learning algorithms. We give polynomial time algorithms for learning shallow quantum circuits and quantum states prepared by shallow circuits.The third is fault tolerance. We discuss the prospects of achieving quantum computational advantage using fault tolerance techniques within noisy shallow circuits, and describe two new techniques toward this goal, including fault tolerance against input noise and single-shot logical state preparation.
546 $a English
590 $a School code: 0028
650 4 $a Computer science. $3 523869
650 4 $a Applied physics. $3 3343996
650 4 $a Applied mathematics. $3 2122814
653 $a Random circuit sampling
653 $a Noisy Intermediate Scale Quantum
653 $a Quantum computing
690 $a 0984
690 $a 0215
690 $a 0364
710 2 $a University of California, Berkeley. $b Electrical Engineering & Computer Sciences. $e degree granting institution. $3 3819104
720 1 $a Vazirani, Umesh $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 86-03B.
790 $a 0028
791 $a Ph.D.
792 $a 2024
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31555795