Planqc2020 codar

Ad

Ad

Ad

Ad

Ad

Ad

Ad

Ad

Ad

Ad

Ad

Ad

1
COntext-Sensitive and Duration-Aware
Qubit Mapping for Various NISQ Devices
Yu Zhang Hao-wei Deng Quan-xi Li
School of C...

2
Quantum
Algorithms
QC: Multidisciplinary Intersection
Quantum
Algorithms
Quantum
Algorithms
Key Potential
Applications
C...

3
Most Existing QP Systems
Low-level quantum circuit
qreg q[3];
h q[0];
h q[1];
CX q[1], q[2];
CX q[0], q[2];
H q;
OpenQAS...

4
Quantum Chips
 Superconducting  IonQ (Trapped ions)
IBM QX4 Tenerife
IBM Q20
IBM Q16 Melbourne
IonQ Q5
IonQ Q11
IBM Q5...

5
Qubit Mapping Problem
CNOT
SWAP① CNOT②
Compiler need to insert SWAP into the quantum
circuit to fit the connection limit...

6
 Superconducting
X, Y, Z, H, S, T CNOT
Gate duration
 1-qubit: 80ns
 2-qubit: ~170ns
 Ion Trap
Ra
q , XX
Gate dura...

7
How to insert SWAPs
 obtain feasible quantum circuits
for various NISQ devices

8
 Formulate the qubit mapping problem into an equivalent
mathematical problem and apply a (SMT) Solver, e.g.
Unscalable,...

9
 Propose a Quantum Abstract Machine to abstract the
characteristics of different NISQ architectures
QAM here is distin...

10
Which qubit pair is chosen to swap？
The earlier it can start, the better
Motivating Examples

11
Which qubit pair is chosen to swap？
The earlier it can start, the better
 Impact of Program Context
Motivating Example...

12
Which qubit pair is chosen to swap？
The earlier it can start, the better
 Impact of Gate Duration Difference
Motivatin...

13
maQAM: Multi-architecture Adaptive
Quantum Abstract Machine

14
Parameter info. of QC devices

15
maQAM: Static +Dynamic Parts
Physical qubits，Elementary quantum operations
Qubit coupling map, Gate durations,
Distance...

16
Key Design on the CODAR Algorithm

17
 Generate an executable gate sequence for a given input
OpenQASM program by
adjusting the gate sequence
inserting th...

18
Qubit Lock Mechanism
Each physical qubit has a Qubit Lock Tend.
A qubit's Tend is updated when a gate is
applied to thi...

19
 Commutativity between gates gA , gB can be resolved by
checking the relevant unitary operators ΑB=BA.
Commutativity D...

20
Overview of the CODAR Algorithm
A gate is directly executable only when all its associate physical qubits are free and ...

21
An Example to Explain CODAR
Hbasic<0
q5
q1
q2q3
q0
q4
0
0
0
00
0
Blocked
Blocked
Cycle 0
1: CX q0,q2;
2: T q1
3: CX q0,...

22
An Example to Explain CODAR
Hbasic<0 means the SWAP won’t shorten
the total distance of CF gates according to
our heuri...

23
An Example to Explain CODAR
1: CX q0,q2;
2: T q1
3: CX q0,q3;
1: CX q0,q2;
2: T q1;
3: SWAP q3,q1;
4: CX q0,q3;
Given G...

24
An Example to Explain CODAR
q5
q1
q2q3
q0
q4
1
0 2
00
2
q5
q1
q3
q0
q4
1
0
2
00
2
Highest
priority
Hbasic<0
q5
q1
q2q3
...

25
Evaluation and Conclution

26
 Comparison with SABRE
Evaluation
The size of the benchmarks ranges from using 3 qubits up to using 36 qubits and abou...

27
 Conclusion
The design of qubit lock and commutativity detection make CODAR aware
of program context and the gate dura...

28
Yu Zhang (张昱)
yuzhang@ustc.edu.cn
CS@USTC
Thank you and any question?

Share Slideshare

LinkedIn
Facebook
Twitter

Embed

Size (px)

Show related Slideshows at end

WordPress Shortcode

Link

Share
Email

2024 Trend Updates: What Really Wor... by Search Engine Jou... 1006941 views
Storytelling For The Web: Integrate... by Chiara Aliotta 913966 views
Artificial Intelligence, Data and C... by OECD Directorate ... 810077 views
How to Leverage AI to Boost Employe... by SocialHRCamp 337931 views
2024 State of Marketing Report – by... by Marius Sescu 193320 views
Everything You Need To Know About C... by Expeed Software 217170 views

View on Slideshare

1 of 28 Ad

View on Slideshare

1 of 28 Ad