task_id stringclasses 11
values | task_code stringclasses 11
values | task_name stringclasses 11
values | workflow_stage stringclasses 6
values | level int64 1 5 | difficulty stringclasses 5
values | seed int64 1 5 | prompt stringlengths 404 28.9k |
|---|---|---|---|---|---|---|---|
T1 | A_stateprep | State Preparation | Construct | 1 | Textbook | 1 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 2 qubits which prepares the following quantum state from |00>:
|00>: -0.679592598898328 + 0i
|01>: -0.579526359718494 + 0i
|10>: 0.12186683113463 + 0i
|11>: -0.432956780040746 + 0i
As a Python list: [(-0.6795925988983277+0j), (-0.5795263597184... |
T1 | A_stateprep | State Preparation | Construct | 1 | Textbook | 2 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 2 qubits which prepares the following quantum state from |00>:
|00>: 0.186920303564353 + 0i
|01>: -0.259805218936697 + 0i
|10>: -0.469077541147975 + 0i
|11>: 0.823121077800365 + 0i
As a Python list: [(0.18692030356435274+0j), (-0.2598052189366... |
T1 | A_stateprep | State Preparation | Construct | 1 | Textbook | 3 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 2 qubits which prepares the following quantum state from |00>:
|00>: 0.639200948222883 + 0i
|01>: 0.706432910712519 + 0i
|10>: -0.303928322989272 + 0i
|11>: 0.00150497114086059 + 0i
As a Python list: [(0.6392009482228831+0j), (0.70643291071251... |
T1 | A_stateprep | State Preparation | Construct | 1 | Textbook | 4 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 2 qubits which prepares the following quantum state from |00>:
|00>: 0.574227449666636 + 0i
|01>: 0.254741853186036 + 0i
|10>: -0.663806107729038 + 0i
|11>: -0.405870515837649 + 0i
As a Python list: [(0.5742274496666363+0j), (0.254741853186036... |
T1 | A_stateprep | State Preparation | Construct | 1 | Textbook | 5 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 2 qubits which prepares the following quantum state from |00>:
|00>: -0.809531137010344 + 0i
|01>: -0.0871958058075818 + 0i
|10>: 0.391728458210054 + 0i
|11>: -0.428491592319709 + 0i
As a Python list: [(-0.8095311370103443+0j), (-0.08719580580... |
T1 | A_stateprep | State Preparation | Construct | 2 | Homework | 1 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 3 qubits which prepares the following quantum state from |000>:
|000>: -0.293090903992018 + 0.113854542909366i
|001>: -0.389870632729889 + 0.0505618808386182i
|010>: -0.096451188049864 + -0.347614839272334i
|011>: 0.188568414279942 + 0.30018358... |
T1 | A_stateprep | State Preparation | Construct | 2 | Homework | 2 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 3 qubits which prepares the following quantum state from |000>:
|000>: -0.0223108790295294 + 0.418871600290631i
|001>: 0.111837995193444 + 0.41813350561919i
|010>: 0.105287856950065 + -0.0401135003229527i
|011>: 0.0688561883548244 + 0.218966751... |
T1 | A_stateprep | State Preparation | Construct | 2 | Homework | 3 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 3 qubits which prepares the following quantum state from |000>:
|000>: -0.408000230667865 + -0.201128544815899i
|001>: -0.0652720772663185 + 0.195159960190748i
|010>: 0.198266306193278 + 0.100919334396127i
|011>: -0.0667724721289298 + 0.5090785... |
T1 | A_stateprep | State Preparation | Construct | 2 | Homework | 4 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 3 qubits which prepares the following quantum state from |000>:
|000>: -0.143817329197262 + 0.343684577779252i
|001>: -0.21443561033101 + -0.133348685501335i
|010>: -0.334952591843656 + -0.0973057857396408i
|011>: 0.436116264841982 + 0.47402606... |
T1 | A_stateprep | State Preparation | Construct | 2 | Homework | 5 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 3 qubits which prepares the following quantum state from |000>:
|000>: 0.0263830304666013 + 0.0712483819039682i
|001>: -0.461960743745515 + -0.0032873920362999i
|010>: -0.132470318633408 + 0.124055126720062i
|011>: 0.243617850265975 + 0.0017615... |
T1 | A_stateprep | State Preparation | Construct | 3 | Exam | 1 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 4 qubits which prepares the following quantum state from |0000>:
|0000>: 0.380319162653963 + 0.147081483976425i
|0001>: 0.0235049113306221 + 0.36537115002118i
|0010>: -0.118453388724446 + -0.0358030091740671i
|0011>: -0.155636174947755 + -0.129... |
T1 | A_stateprep | State Preparation | Construct | 3 | Exam | 2 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 4 qubits which prepares the following quantum state from |0000>:
|0000>: -0.203848151383009 + -0.0927042919495607i
|0001>: -0.341038627922005 + -0.107585978539975i
|0010>: 0.342024611975759 + 0.07444030057774i
|0011>: 0.110782320871863 + -0.164... |
T1 | A_stateprep | State Preparation | Construct | 3 | Exam | 3 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 4 qubits which prepares the following quantum state from |0000>:
|0000>: 0.0340111462345571 + 0.201443607741877i
|0001>: -0.0879884647077708 + -0.288305748269509i
|0010>: -0.154648524370015 + -0.206232872020556i
|0011>: -0.032306644146494 + 0.3... |
T1 | A_stateprep | State Preparation | Construct | 3 | Exam | 4 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 4 qubits which prepares the following quantum state from |0000>:
|0000>: 0.24508326102276 + 0.140120017127918i
|0001>: 0.17055509352566 + -0.109536396788814i
|0010>: -0.0809522962282046 + 0.246722211575361i
|0011>: -0.243829486672712 + 0.092894... |
T1 | A_stateprep | State Preparation | Construct | 3 | Exam | 5 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 4 qubits which prepares the following quantum state from |0000>:
|0000>: 0.083833355012308 + 0.0946798570225192i
|0001>: -0.144336036208174 + 0.117305891599423i
|0010>: 0.14695618078731 + -0.253893552767962i
|0011>: 0.0659457445691654 + 0.06906... |
T1 | A_stateprep | State Preparation | Construct | 4 | Research | 1 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 5 qubits which prepares the following quantum state from |00000>:
|00000>: -0.102154945911634 + -0.0554003207402092i
|00001>: 0.148187313226173 + 0.171340678642202i
|00010>: -0.0765046389658187 + 0.0982932279248882i
|00011>: -0.0037327952893834... |
T1 | A_stateprep | State Preparation | Construct | 4 | Research | 2 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 5 qubits which prepares the following quantum state from |00000>:
|00000>: 0.146387287463578 + 0.223292412190043i
|00001>: 0.0858767551012804 + -0.0905608623173345i
|00010>: 0.0178932667461018 + 0.140832046696919i
|00011>: 0.222111337381669 + 0... |
T1 | A_stateprep | State Preparation | Construct | 4 | Research | 3 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 5 qubits which prepares the following quantum state from |00000>:
|00000>: -0.15964475037945 + -0.022382369922606i
|00001>: -0.098791145665098 + 0.282996362211857i
|00010>: 0.0723957606838339 + 0.019951178498933i
|00011>: -0.0529907308965836 + ... |
T1 | A_stateprep | State Preparation | Construct | 4 | Research | 4 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 5 qubits which prepares the following quantum state from |00000>:
|00000>: 0.0229687011872264 + -0.173837073658034i
|00001>: 0.0539352518744922 + 0.0642920396694201i
|00010>: 0.0559130356420891 + -0.00701292402496855i
|00011>: 0.211215790755727... |
T1 | A_stateprep | State Preparation | Construct | 4 | Research | 5 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 5 qubits which prepares the following quantum state from |00000>:
|00000>: -0.101534947492614 + -0.149350345111902i
|00001>: 0.0102133544140058 + -0.00567761575847423i
|00010>: 0.0641481183737237 + -0.0966749039714853i
|00011>: -0.0477071370579... |
T1 | A_stateprep | State Preparation | Construct | 5 | Open | 1 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 6 qubits which prepares the following quantum state from |000000>:
|000000>: 0.061835637016586 + -0.0180046004972971i
|000001>: 0.0606547899537406 + -0.0545056437413137i
|000010>: -0.00623368980077135 + 0.0928742871449291i
|000011>: 0.009449825... |
T1 | A_stateprep | State Preparation | Construct | 5 | Open | 2 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 6 qubits which prepares the following quantum state from |000000>:
|000000>: 0.0612282087531191 + 0.045153059828503i
|000001>: 0.0480884600601565 + 0.108386616633217i
|000010>: -0.042307173998394 + 0.0575786866892797i
|000011>: 0.17074994463264... |
T1 | A_stateprep | State Preparation | Construct | 5 | Open | 3 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 6 qubits which prepares the following quantum state from |000000>:
|000000>: 0.0452523152403199 + -0.0301263595263067i
|000001>: -0.11288744460371 + -0.100391728863269i
|000010>: -0.0641444263224133 + -0.00516151805916488i
|000011>: 0.003089224... |
T1 | A_stateprep | State Preparation | Construct | 5 | Open | 4 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 6 qubits which prepares the following quantum state from |000000>:
|000000>: 0.0829041866557441 + -0.052237374286285i
|000001>: -0.166270637199488 + -0.0263311719171757i
|000010>: -0.0460323346523866 + -0.0159350277182475i
|000011>: -0.02728042... |
T1 | A_stateprep | State Preparation | Construct | 5 | Open | 5 | Write a Qiskit function `solve()` that returns a QuantumCircuit on 6 qubits which prepares the following quantum state from |000000>:
|000000>: 0.0307517047054373 + -0.103762936909031i
|000001>: -0.0162193139216204 + -0.0231649064249765i
|000010>: -0.0237062796636347 + -0.000324961628490575i
|000011>: 0.131778... |
T2 | G1_trotter | Trotterization | Construct | 1 | Textbook | 1 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=0.5 for the following 2-qubit Hamiltonian:
H = -0.5455 * XY
-0.7873 * IY
-0.8996 * ZX
Write a function `solve()` that returns a QuantumCircuit on 2 qubits.
The circuit should achieve operator fidelity > 0.99 with the exact time evolutio... |
T2 | G1_trotter | Trotterization | Construct | 1 | Textbook | 2 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=0.5 for the following 2-qubit Hamiltonian:
H = -1.9675 * ZY
+0.5855 * IX
+1.5482 * XY
Write a function `solve()` that returns a QuantumCircuit on 2 qubits.
The circuit should achieve operator fidelity > 0.99 with the exact time evolutio... |
T2 | G1_trotter | Trotterization | Construct | 1 | Textbook | 3 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=0.5 for the following 2-qubit Hamiltonian:
H = +0.2541 * XY
-0.7526 * XZ
-0.5842 * XI
Write a function `solve()` that returns a QuantumCircuit on 2 qubits.
The circuit should achieve operator fidelity > 0.99 with the exact time evolutio... |
T2 | G1_trotter | Trotterization | Construct | 1 | Textbook | 4 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=0.5 for the following 2-qubit Hamiltonian:
H = -0.7869 * XZ
-1.0446 * IX
-0.5466 * XX
Write a function `solve()` that returns a QuantumCircuit on 2 qubits.
The circuit should achieve operator fidelity > 0.99 with the exact time evolutio... |
T2 | G1_trotter | Trotterization | Construct | 1 | Textbook | 5 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=0.5 for the following 2-qubit Hamiltonian:
H = +0.9388 * XI
+0.0713 * XX
-0.4503 * XZ
Write a function `solve()` that returns a QuantumCircuit on 2 qubits.
The circuit should achieve operator fidelity > 0.99 with the exact time evolutio... |
T2 | G1_trotter | Trotterization | Construct | 2 | Homework | 1 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=0.8 for the following 2-qubit Hamiltonian:
H = +0.2743 * YI
-0.6541 * XZ
+0.2748 * YZ
+1.7334 * IX
Write a function `solve()` that returns a QuantumCircuit on 2 qubits.
The circuit should achieve operator fidelity > 0.99 with the exac... |
T2 | G1_trotter | Trotterization | Construct | 2 | Homework | 2 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=0.8 for the following 2-qubit Hamiltonian:
H = +0.7792 * XZ
+1.0145 * XI
+1.8101 * ZI
+1.5772 * XX
Write a function `solve()` that returns a QuantumCircuit on 2 qubits.
The circuit should achieve operator fidelity > 0.99 with the exac... |
T2 | G1_trotter | Trotterization | Construct | 2 | Homework | 3 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=0.8 for the following 2-qubit Hamiltonian:
H = -0.4737 * XX
+0.4162 * XZ
+0.6416 * XY
-0.3768 * ZI
Write a function `solve()` that returns a QuantumCircuit on 2 qubits.
The circuit should achieve operator fidelity > 0.99 with the exac... |
T2 | G1_trotter | Trotterization | Construct | 2 | Homework | 4 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=0.8 for the following 2-qubit Hamiltonian:
H = +1.1815 * XY
-1.9782 * ZY
+0.8636 * XI
+0.4761 * YZ
Write a function `solve()` that returns a QuantumCircuit on 2 qubits.
The circuit should achieve operator fidelity > 0.99 with the exac... |
T2 | G1_trotter | Trotterization | Construct | 2 | Homework | 5 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=0.8 for the following 2-qubit Hamiltonian:
H = +0.7994 * IX
+0.7193 * ZX
-1.4895 * XZ
-0.1415 * XY
Write a function `solve()` that returns a QuantumCircuit on 2 qubits.
The circuit should achieve operator fidelity > 0.99 with the exac... |
T2 | G1_trotter | Trotterization | Construct | 3 | Exam | 1 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.0 for the following 3-qubit Hamiltonian:
H = -1.5967 * ZXX
-0.6182 * ZZY
-0.1781 * XYY
-1.9327 * IIZ
-0.1992 * IXI
Write a function `solve()` that returns a QuantumCircuit on 3 qubits.
The circuit should achieve operator fidelity ... |
T2 | G1_trotter | Trotterization | Construct | 3 | Exam | 2 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.0 for the following 3-qubit Hamiltonian:
H = +0.2257 * ZXZ
+0.1715 * ZYX
+1.7214 * IYZ
-0.8902 * ZYZ
+1.4067 * XIX
Write a function `solve()` that returns a QuantumCircuit on 3 qubits.
The circuit should achieve operator fidelity ... |
T2 | G1_trotter | Trotterization | Construct | 3 | Exam | 3 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.0 for the following 3-qubit Hamiltonian:
H = +0.8308 * IZY
-1.3314 * YYI
-0.4240 * IXZ
+0.0524 * ZYY
-0.2056 * IYZ
Write a function `solve()` that returns a QuantumCircuit on 3 qubits.
The circuit should achieve operator fidelity ... |
T2 | G1_trotter | Trotterization | Construct | 3 | Exam | 4 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.0 for the following 3-qubit Hamiltonian:
H = +0.8654 * IIY
+1.2474 * ZYX
+0.5024 * YZX
+0.5194 * YYZ
+1.9143 * IXI
Write a function `solve()` that returns a QuantumCircuit on 3 qubits.
The circuit should achieve operator fidelity ... |
T2 | G1_trotter | Trotterization | Construct | 3 | Exam | 5 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.0 for the following 3-qubit Hamiltonian:
H = -0.7012 * YXY
-1.2414 * ZYX
-1.5983 * XXY
-1.9748 * XZX
+1.6701 * YIX
Write a function `solve()` that returns a QuantumCircuit on 3 qubits.
The circuit should achieve operator fidelity ... |
T2 | G1_trotter | Trotterization | Construct | 4 | Research | 1 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.0 for the following 4-qubit Hamiltonian:
H = -0.4390 * YIXI
-1.7338 * ZYZI
+1.3139 * ZXIZ
-1.8077 * XIYZ
-0.5276 * XZZI
-0.0043 * XIIX
-1.2530 * YXIZ
+0.5370 * XIII
Write a function `solve()` that returns a QuantumCircuit on... |
T2 | G1_trotter | Trotterization | Construct | 4 | Research | 2 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.0 for the following 4-qubit Hamiltonian:
H = +1.0933 * ZZXI
+1.2545 * IIXZ
+1.4708 * YZIZ
+0.4937 * YIIZ
-1.4802 * XZYX
-0.6481 * XXIZ
+1.9515 * XXYI
+0.0571 * XZZX
Write a function `solve()` that returns a QuantumCircuit on... |
T2 | G1_trotter | Trotterization | Construct | 4 | Research | 3 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.0 for the following 4-qubit Hamiltonian:
H = +0.3080 * ZZYX
+1.2602 * IXXZ
+1.9571 * ZZYI
-0.0652 * IZIZ
+1.8890 * ZXZZ
+1.2911 * IZYZ
-0.7081 * IXYI
+1.7208 * XXIZ
Write a function `solve()` that returns a QuantumCircuit on... |
T2 | G1_trotter | Trotterization | Construct | 4 | Research | 4 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.0 for the following 4-qubit Hamiltonian:
H = -1.4741 * YXZZ
-0.7391 * XYIY
+1.9584 * ZIII
-1.7273 * IYXY
+0.8273 * ZIZY
+1.2059 * ZXYI
+0.6877 * ZYYZ
+1.2216 * ZXZZ
Write a function `solve()` that returns a QuantumCircuit on... |
T2 | G1_trotter | Trotterization | Construct | 4 | Research | 5 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.0 for the following 4-qubit Hamiltonian:
H = +1.7998 * XYXY
+1.9078 * XIIX
-0.9091 * YXZY
+1.2691 * XXYY
+1.4104 * XXYZ
-0.8242 * IIIY
+0.9939 * IIYZ
+0.8809 * IZII
Write a function `solve()` that returns a QuantumCircuit on... |
T2 | G1_trotter | Trotterization | Construct | 5 | Open | 1 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.5 for the following 5-qubit Hamiltonian:
H = +0.6380 * YZXZI
-1.6716 * IYZZZ
-0.8167 * YIYXI
+0.5845 * YZZZY
-1.0041 * IYZIX
+1.8014 * ZIIZZ
+0.3863 * IZXZI
+1.7987 * IXZXX
-1.6412 * YIIIX
+1.6995 * IXZYZ
-0.8667 * IXYI... |
T2 | G1_trotter | Trotterization | Construct | 5 | Open | 2 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.5 for the following 5-qubit Hamiltonian:
H = +0.5727 * ZZYXI
-0.5244 * YYIXY
-0.2466 * ZZYYZ
-0.3425 * ZIZYX
-0.7530 * YXYXZ
-0.5336 * IIXXX
-0.6795 * IYYXX
+0.7467 * YYXZI
+1.5718 * ZYXIY
-0.8362 * YIZYZ
-0.0410 * IXIY... |
T2 | G1_trotter | Trotterization | Construct | 5 | Open | 3 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.5 for the following 5-qubit Hamiltonian:
H = -0.8091 * ZXYII
+0.6570 * XXZYZ
-1.5554 * XXYZI
+0.7886 * ZYZXX
+1.4090 * ZYIXX
+0.7885 * ZIZYI
+0.1254 * YYZYX
+0.0806 * YZXII
+0.9511 * IYXYZ
-0.4809 * YIXZY
-0.6900 * ZYIZ... |
T2 | G1_trotter | Trotterization | Construct | 5 | Open | 4 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.5 for the following 5-qubit Hamiltonian:
H = +1.8411 * IZIZX
+0.0353 * IYIIX
+0.3953 * IZIIZ
+0.9101 * XZXXZ
+0.4953 * ZYYZI
-0.2601 * XIYXZ
-0.7357 * YZZXY
-0.9034 * YXYIX
+0.9686 * IIZZZ
+0.5952 * YIYYX
-1.0141 * XZYZ... |
T2 | G1_trotter | Trotterization | Construct | 5 | Open | 5 | Construct a Trotter circuit for the time evolution operator e^{-iHt} with t=1.5 for the following 5-qubit Hamiltonian:
H = +0.9718 * XYZYY
+0.1145 * IZIZI
+1.7862 * IZZYX
-0.4821 * XXZZY
-1.3238 * YZZYZ
-1.8761 * IYIIY
+1.9121 * IYIIZ
+0.6688 * YXIIZ
+0.4858 * IXXZI
+1.1280 * IIIIX
+0.6082 * YYYZ... |
T3 | H1_oracle | Oracle Synthesis | Construct | 1 | Textbook | 1 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^2 -> {0,1}:
Truth table:
f(00) = 0
f(01) = 1
f(10) = 0
f(11) = 1
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use as many ancilla qubits as needed. All ancillae must be returned to |0> (clean computation).
Write a fu... |
T3 | H1_oracle | Oracle Synthesis | Construct | 1 | Textbook | 2 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^2 -> {0,1}:
Truth table:
f(00) = 1
f(01) = 1
f(10) = 0
f(11) = 0
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use as many ancilla qubits as needed. All ancillae must be returned to |0> (clean computation).
Write a fu... |
T3 | H1_oracle | Oracle Synthesis | Construct | 1 | Textbook | 3 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^2 -> {0,1}:
Truth table:
f(00) = 0
f(01) = 1
f(10) = 0
f(11) = 1
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use as many ancilla qubits as needed. All ancillae must be returned to |0> (clean computation).
Write a fu... |
T3 | H1_oracle | Oracle Synthesis | Construct | 1 | Textbook | 4 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^2 -> {0,1}:
Truth table:
f(00) = 0
f(01) = 1
f(10) = 0
f(11) = 0
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use as many ancilla qubits as needed. All ancillae must be returned to |0> (clean computation).
Write a fu... |
T3 | H1_oracle | Oracle Synthesis | Construct | 1 | Textbook | 5 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^2 -> {0,1}:
Truth table:
f(00) = 0
f(01) = 0
f(10) = 0
f(11) = 0
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use as many ancilla qubits as needed. All ancillae must be returned to |0> (clean computation).
Write a fu... |
T3 | H1_oracle | Oracle Synthesis | Construct | 2 | Homework | 1 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^3 -> {0,1}:
Truth table:
f(000) = 1
f(001) = 0
f(010) = 0
f(011) = 1
f(100) = 1
f(101) = 1
f(110) = 0
f(111) = 0
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use as many ancilla qubits as needed. All ancillae ... |
T3 | H1_oracle | Oracle Synthesis | Construct | 2 | Homework | 2 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^3 -> {0,1}:
Truth table:
f(000) = 0
f(001) = 1
f(010) = 0
f(011) = 0
f(100) = 0
f(101) = 1
f(110) = 1
f(111) = 0
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use as many ancilla qubits as needed. All ancillae ... |
T3 | H1_oracle | Oracle Synthesis | Construct | 2 | Homework | 3 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^3 -> {0,1}:
Truth table:
f(000) = 0
f(001) = 0
f(010) = 0
f(011) = 0
f(100) = 0
f(101) = 1
f(110) = 0
f(111) = 1
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use as many ancilla qubits as needed. All ancillae ... |
T3 | H1_oracle | Oracle Synthesis | Construct | 2 | Homework | 4 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^3 -> {0,1}:
Truth table:
f(000) = 0
f(001) = 1
f(010) = 1
f(011) = 1
f(100) = 0
f(101) = 0
f(110) = 0
f(111) = 1
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use as many ancilla qubits as needed. All ancillae ... |
T3 | H1_oracle | Oracle Synthesis | Construct | 2 | Homework | 5 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^3 -> {0,1}:
Truth table:
f(000) = 0
f(001) = 0
f(010) = 1
f(011) = 0
f(100) = 0
f(101) = 1
f(110) = 0
f(111) = 1
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use as many ancilla qubits as needed. All ancillae ... |
T3 | H1_oracle | Oracle Synthesis | Construct | 3 | Exam | 1 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^3 -> {0,1}:
Truth table:
f(000) = 1
f(001) = 0
f(010) = 0
f(011) = 1
f(100) = 1
f(101) = 1
f(110) = 0
f(111) = 1
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use at most 2 ancilla qubit(s). All ancillae must b... |
T3 | H1_oracle | Oracle Synthesis | Construct | 3 | Exam | 2 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^3 -> {0,1}:
Truth table:
f(000) = 1
f(001) = 0
f(010) = 1
f(011) = 1
f(100) = 1
f(101) = 0
f(110) = 0
f(111) = 1
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use at most 2 ancilla qubit(s). All ancillae must b... |
T3 | H1_oracle | Oracle Synthesis | Construct | 3 | Exam | 3 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^3 -> {0,1}:
Truth table:
f(000) = 0
f(001) = 1
f(010) = 1
f(011) = 1
f(100) = 1
f(101) = 0
f(110) = 0
f(111) = 0
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use at most 2 ancilla qubit(s). All ancillae must b... |
T3 | H1_oracle | Oracle Synthesis | Construct | 3 | Exam | 4 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^3 -> {0,1}:
Truth table:
f(000) = 0
f(001) = 0
f(010) = 1
f(011) = 1
f(100) = 1
f(101) = 0
f(110) = 1
f(111) = 1
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use at most 2 ancilla qubit(s). All ancillae must b... |
T3 | H1_oracle | Oracle Synthesis | Construct | 3 | Exam | 5 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^3 -> {0,1}:
Truth table:
f(000) = 1
f(001) = 0
f(010) = 1
f(011) = 1
f(100) = 1
f(101) = 0
f(110) = 0
f(111) = 0
The oracle should act as U_f|x>|y> = |x>|y XOR f(x)>.
You may use at most 2 ancilla qubit(s). All ancillae must b... |
T3 | H1_oracle | Oracle Synthesis | Construct | 4 | Research | 1 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^4 -> {0,1}:
Truth table:
f(0000) = 1
f(0001) = 0
f(0010) = 0
f(0011) = 0
f(0100) = 1
f(0101) = 1
f(0110) = 1
f(0111) = 0
f(1000) = 1
f(1001) = 0
f(1010) = 0
f(1011) = 1
f(1100) = 0
f(1101) = 0
f(1110) = 1
f(1111)... |
T3 | H1_oracle | Oracle Synthesis | Construct | 4 | Research | 2 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^4 -> {0,1}:
Truth table:
f(0000) = 1
f(0001) = 1
f(0010) = 0
f(0011) = 0
f(0100) = 0
f(0101) = 0
f(0110) = 0
f(0111) = 1
f(1000) = 1
f(1001) = 1
f(1010) = 0
f(1011) = 1
f(1100) = 1
f(1101) = 0
f(1110) = 0
f(1111)... |
T3 | H1_oracle | Oracle Synthesis | Construct | 4 | Research | 3 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^4 -> {0,1}:
Truth table:
f(0000) = 1
f(0001) = 1
f(0010) = 1
f(0011) = 0
f(0100) = 0
f(0101) = 0
f(0110) = 0
f(0111) = 1
f(1000) = 1
f(1001) = 1
f(1010) = 1
f(1011) = 0
f(1100) = 0
f(1101) = 1
f(1110) = 0
f(1111)... |
T3 | H1_oracle | Oracle Synthesis | Construct | 4 | Research | 4 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^4 -> {0,1}:
Truth table:
f(0000) = 1
f(0001) = 0
f(0010) = 1
f(0011) = 1
f(0100) = 0
f(0101) = 1
f(0110) = 0
f(0111) = 1
f(1000) = 1
f(1001) = 0
f(1010) = 0
f(1011) = 0
f(1100) = 0
f(1101) = 1
f(1110) = 0
f(1111)... |
T3 | H1_oracle | Oracle Synthesis | Construct | 4 | Research | 5 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^4 -> {0,1}:
Truth table:
f(0000) = 0
f(0001) = 1
f(0010) = 0
f(0011) = 1
f(0100) = 0
f(0101) = 0
f(0110) = 0
f(0111) = 0
f(1000) = 1
f(1001) = 0
f(1010) = 1
f(1011) = 1
f(1100) = 0
f(1101) = 0
f(1110) = 1
f(1111)... |
T3 | H1_oracle | Oracle Synthesis | Construct | 5 | Open | 1 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^4 -> {0,1}:
Truth table:
f(0000) = 1
f(0001) = 1
f(0010) = 0
f(0011) = 1
f(0100) = 0
f(0101) = 0
f(0110) = 1
f(0111) = 1
f(1000) = 1
f(1001) = 1
f(1010) = 1
f(1011) = 0
f(1100) = 1
f(1101) = 0
f(1110) = 0
f(1111)... |
T3 | H1_oracle | Oracle Synthesis | Construct | 5 | Open | 2 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^4 -> {0,1}:
Truth table:
f(0000) = 1
f(0001) = 1
f(0010) = 1
f(0011) = 0
f(0100) = 0
f(0101) = 1
f(0110) = 1
f(0111) = 0
f(1000) = 0
f(1001) = 1
f(1010) = 1
f(1011) = 1
f(1100) = 1
f(1101) = 1
f(1110) = 1
f(1111)... |
T3 | H1_oracle | Oracle Synthesis | Construct | 5 | Open | 3 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^4 -> {0,1}:
Truth table:
f(0000) = 1
f(0001) = 0
f(0010) = 1
f(0011) = 0
f(0100) = 0
f(0101) = 0
f(0110) = 0
f(0111) = 1
f(1000) = 1
f(1001) = 1
f(1010) = 0
f(1011) = 0
f(1100) = 1
f(1101) = 1
f(1110) = 0
f(1111)... |
T3 | H1_oracle | Oracle Synthesis | Construct | 5 | Open | 4 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^4 -> {0,1}:
Truth table:
f(0000) = 0
f(0001) = 1
f(0010) = 0
f(0011) = 1
f(0100) = 0
f(0101) = 0
f(0110) = 1
f(0111) = 0
f(1000) = 0
f(1001) = 0
f(1010) = 0
f(1011) = 1
f(1100) = 0
f(1101) = 0
f(1110) = 1
f(1111)... |
T3 | H1_oracle | Oracle Synthesis | Construct | 5 | Open | 5 | Implement a quantum oracle U_f for the following boolean function f: {0,1}^4 -> {0,1}:
Truth table:
f(0000) = 0
f(0001) = 1
f(0010) = 1
f(0011) = 1
f(0100) = 1
f(0101) = 0
f(0110) = 1
f(0111) = 0
f(1000) = 1
f(1001) = 0
f(1010) = 0
f(1011) = 1
f(1100) = 1
f(1101) = 1
f(1110) = 0
f(1111)... |
T4 | B1_debugging | Debugging | Understand | 1 | Textbook | 1 | The following 2-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[2];
s q[0];
ry(6.232383815049195) q[1];
h q[0];
t q[1];
rz(2.5778010088792107) q[1];
```
The INTENDED unitary transformation maps basi... |
T4 | B1_debugging | Debugging | Understand | 1 | Textbook | 2 | The following 2-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[2];
cz q[0],q[1];
cx q[0],q[1];
y q[0];
s q[0];
z q[0];
cz q[1],q[0];
cx q[0],q[1];
y q[0];
```
The INTENDED unitary transformation ma... |
T4 | B1_debugging | Debugging | Understand | 1 | Textbook | 3 | The following 2-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[2];
s q[0];
x q[1];
cx q[1],q[0];
rx(4.944298725272166) q[1];
```
The INTENDED unitary transformation maps basis states as follows:
... |
T4 | B1_debugging | Debugging | Understand | 1 | Textbook | 4 | The following 2-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[2];
t q[0];
ry(3.5018632378947836) q[0];
y q[1];
h q[0];
cz q[1],q[0];
h q[1];
```
The INTENDED unitary transformation maps basis stat... |
T4 | B1_debugging | Debugging | Understand | 1 | Textbook | 5 | The following 2-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[2];
z q[0];
s q[0];
z q[0];
rx(4.027594337564511) q[1];
rz(3.1507035243578856) q[1];
```
The INTENDED unitary transformation maps basi... |
T4 | B1_debugging | Debugging | Understand | 2 | Homework | 1 | The following 3-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
h q[0];
y q[2];
z q[0];
ry(4.567684551169003) q[0];
h q[0];
ry(1.0450591829488785) q[2];
rz(3.5929563116952115) q[1];
rx(3.43249647... |
T4 | B1_debugging | Debugging | Understand | 2 | Homework | 2 | The following 3-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
cz q[0],q[2];
cx q[1],q[0];
s q[0];
cz q[2],q[1];
x q[2];
h q[1];
s q[1];
t q[2];
cx q[1],q[0];
cx q[0],q[2];
t q[2];
cz q[2],q[1];... |
T4 | B1_debugging | Debugging | Understand | 2 | Homework | 3 | The following 3-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
y q[1];
cz q[1],q[2];
z q[0];
h q[1];
cz q[2],q[0];
s q[0];
h q[2];
h q[1];
cx q[2],q[1];
t q[0];
cz q[2],q[1];
x q[0];
cx q[1],q[2... |
T4 | B1_debugging | Debugging | Understand | 2 | Homework | 4 | The following 3-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
ry(4.88077357963315) q[1];
s q[1];
cx q[0],q[2];
ry(5.198606068864962) q[1];
ry(0.7036137925742918) q[0];
z q[0];
rx(0.120308409456... |
T4 | B1_debugging | Debugging | Understand | 2 | Homework | 5 | The following 3-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
cx q[2],q[0];
s q[2];
h q[1];
rz(3.504125488335103) q[1];
z q[2];
z q[2];
h q[0];
z q[1];
cx q[1],q[0];
cx q[2],q[0];
x q[2];
```
... |
T4 | B1_debugging | Debugging | Understand | 3 | Exam | 1 | The following 3-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
y q[1];
ry(0.6023416292820298) q[0];
cx q[0],q[2];
ry(6.136251504521233) q[2];
y q[1];
h q[2];
rx(1.381243078207626) q[1];
x q[0];
... |
T4 | B1_debugging | Debugging | Understand | 3 | Exam | 2 | The following 3-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
y q[0];
z q[0];
rx(3.4566600867160138) q[1];
ry(5.182820420425684) q[1];
cz q[0],q[2];
cz q[2],q[0];
y q[2];
cx q[2],q[0];
t q[1];
... |
T4 | B1_debugging | Debugging | Understand | 3 | Exam | 3 | The following 3-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
rz(5.576163480144678) q[0];
x q[2];
ry(3.272651387191274) q[0];
ry(5.736650091825691) q[2];
z q[0];
h q[2];
y q[2];
cx q[2],q[0];
r... |
T4 | B1_debugging | Debugging | Understand | 3 | Exam | 4 | The following 3-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
rx(4.358977030333853) q[1];
t q[0];
x q[2];
z q[1];
t q[1];
rx(0.15048909201005942) q[1];
h q[1];
h q[0];
z q[0];
x q[1];
cz q[2],q... |
T4 | B1_debugging | Debugging | Understand | 3 | Exam | 5 | The following 3-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[3];
x q[1];
y q[1];
s q[2];
cx q[0],q[2];
h q[2];
y q[0];
s q[1];
cz q[2],q[1];
cz q[0],q[1];
cx q[1],q[0];
ry(0.24307604970574218) q[2... |
T4 | B1_debugging | Debugging | Understand | 4 | Research | 1 | The following 4-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[4];
cx q[2],q[3];
h q[1];
h q[3];
cx q[0],q[1];
ry(2.5130239886910046) q[0];
cx q[1],q[3];
h q[2];
rx(2.9813154683108953) q[0];
y q[0];... |
T4 | B1_debugging | Debugging | Understand | 4 | Research | 2 | The following 4-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[4];
cz q[3],q[0];
t q[2];
x q[2];
x q[1];
cx q[1],q[3];
y q[0];
rz(6.208256068892496) q[2];
y q[1];
cx q[2],q[0];
cx q[3],q[2];
s q[2];... |
T4 | B1_debugging | Debugging | Understand | 4 | Research | 3 | The following 4-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[4];
rz(4.98675651542124) q[1];
cz q[3],q[0];
cz q[3],q[2];
rz(2.5907257657475737) q[2];
x q[1];
s q[1];
t q[1];
t q[1];
cz q[2],q[1];
c... |
T4 | B1_debugging | Debugging | Understand | 4 | Research | 4 | The following 4-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[4];
x q[0];
cz q[3],q[0];
ry(2.4258308371489203) q[3];
cz q[2],q[3];
t q[0];
h q[0];
h q[1];
s q[2];
y q[1];
t q[3];
y q[3];
rz(4.97320... |
T4 | B1_debugging | Debugging | Understand | 4 | Research | 5 | The following 4-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[4];
rz(2.739822209913614) q[0];
y q[2];
z q[0];
cz q[3],q[1];
cz q[3],q[1];
cz q[2],q[1];
s q[3];
rz(0.39301171691285414) q[1];
h q[0];... |
T4 | B1_debugging | Debugging | Understand | 5 | Open | 1 | The following 5-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[5];
rz(5.655195634596385) q[2];
cz q[4],q[2];
z q[0];
cz q[4],q[1];
x q[1];
cz q[4],q[1];
cx q[4],q[0];
h q[0];
cx q[1],q[2];
x q[1];
c... |
T4 | B1_debugging | Debugging | Understand | 5 | Open | 2 | The following 5-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[5];
s q[2];
h q[2];
z q[3];
y q[4];
h q[0];
s q[3];
cx q[2],q[3];
h q[3];
s q[4];
x q[4];
z q[1];
y q[3];
x q[2];
x q[0];
cz q[3],q[0];... |
T4 | B1_debugging | Debugging | Understand | 5 | Open | 3 | The following 5-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[5];
cx q[1],q[0];
t q[2];
t q[2];
y q[1];
rz(3.893759820960499) q[3];
s q[0];
h q[3];
z q[4];
rz(1.4826818544450509) q[3];
h q[0];
s q[... |
T4 | B1_debugging | Debugging | Understand | 5 | Open | 4 | The following 5-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[5];
rz(2.37800268252761) q[3];
rx(2.8923780641064187) q[4];
y q[3];
s q[2];
rz(4.302399126381679) q[3];
rz(4.1424760047965155) q[4];
t ... |
T4 | B1_debugging | Debugging | Understand | 5 | Open | 5 | The following 5-qubit quantum circuit has exactly ONE bug (a wrong gate, swapped qubits, or missing gate).
Buggy circuit (OpenQASM 2.0):
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[5];
ry(1.2991082020564804) q[4];
x q[2];
y q[3];
rz(3.487754176137701) q[2];
rx(0.643490595348736) q[4];
s q[1];
cz q[1],q[0];
x q[3];
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.