problem stringclasses 67
values | user stringlengths 13 13 | submission_order int64 1 57 | result stringclasses 10
values | execution_time stringlengths 0 8 | memory stringclasses 88
values | code stringlengths 47 7.62k |
|---|---|---|---|---|---|---|
QPC002_A5 | A294C07C8E71C | 1 | WA | 2040 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
for i in range(n - 1):
qc.cz(0, i + 1)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 2 | DLE | 1682 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
for i in range(n - 1):
qc.cx(0, i + 1)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 3 | RE | 2250 ms | 157 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
for i in range(1, n):
if i % 2 == 0:
qc.cx(0, i)
else:
qc.cx(1, i)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 4 | DLE | 2045 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
for i in range(1, n):
if i % 2 == 1:
qc.cx(0, i)
else:
qc.cx(1, i)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 5 | DLE | 1620 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
for i in range(1, n):
if i % 3 == 1:
qc.cx(0, i)
elif i % 3 == 2:
qc.cx(1, i)
else:
qc.cx(2, i)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 6 | DLE | 1604 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
if i % 3 == 1:
qc.cx(0, i)
elif i % 3 == 2:
qc.cx(1, i)
else:
qc.cx(2, i)
qc.z(0)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 7 | DLE | 1662 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
if i % 3 != 0:
qc.cx(0, i)
else:
qc.cx(1, i)
qc.z(0)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 8 | DLE | 1811 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
if i % 2 != 0:
qc.cx(0, i)
else:
qc.cx(1, i)
qc.z(0)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 9 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
if i % 4 == 1
qc.cx(0, i)
elif i % 4 == 2:
qc.cx(1, i)
elif i % 4 == 3:
qc.cx(2, i)
else :
qc.cx(3, i)
qc.z(0)
return qc
''' | ||
QPC002_A5 | A294C07C8E71C | 10 | DLE | 1900 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
if i % 4 == 1:
qc.cx(0, i)
elif i % 4 == 2:
qc.cx(1, i)
elif i % 4 == 3:
qc.cx(2, i)
else :
qc.cx(3, i)
qc.z(0)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 11 | RE | 1651 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(0, math.log2(n)):
for j in range(0, pow(2, i)):
qc.cx(j, j + i + 1)
qc.z(0)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 12 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(0, (int)math.log2(n)):
for j in range(0, pow(2, i)):
qc.cx(j, j + i + 1)
qc.z(0)
return qc
''' | ||
QPC002_A5 | A294C07C8E71C | 13 | RE | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(0, (i)math.log2(n)):
for j in range(0, pow(2, i)):
qc.cx(j, j + i + 1)
qc.z(0)
return qc
''' | ||
QPC002_A5 | A294C07C8E71C | 14 | UME | '''python
from qiskit import QuantumCircuit
import mat
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(0, int(math.log2(n))):
for j in range(0, pow(2, i)):
qc.cx(j, j + i + 1)
qc.z(0)
return qc
''' | ||
QPC002_A5 | A294C07C8E71C | 15 | WA | 1736 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(0, int(math.log2(n))):
for j in range(0, pow(2, i)):
qc.cx(j, j + i + 1)
qc.z(0)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 16 | RE | 1622 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(math.ceil(math.log2(n))):
for j in range(2 ** i):
if (j + 2 ** i) > n:
break
qc.cx(j, j + 2 ** i)
qc.z(0)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 17 | RE | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
cnt = 0
for i in range(math.ceil(math.log2(n))):
for j in range(2 ** i):
qc.cx(j, j + 2 ** i)
cnt++
if cnt == n:
break
qc.z(0)
return qc
''' | ||
QPC002_A5 | A294C07C8E71C | 18 | RE | 1615 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
cnt = 0
for i in range(math.ceil(math.log2(n))):
for j in range(2 ** i):
qc.cx(j, j + 2 ** i)
cnt+=1
if cnt == n:
break
if cnt == n:
break
qc.z(0)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 19 | RE | 1690 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
cnt = 0
for i in range(math.ceil(math.log2(n))):
for j in range(2**i):
if cnt == n:
break
qc.cx(j, j + 2**i)
cnt+=1
qc.z(0)
return qc
''' |
QPC002_A5 | A294C07C8E71C | 20 | AC | 2099 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
cnt = 0
for i in range(math.ceil(math.log2(n))):
for j in range(2**i):
if j + 2**i == n:
break
qc.cx(j, j + 2**i)
cnt+=1
qc.z(0)
return qc
''' |
QPC002_A5 | A2E25F599BCCA | 1 | AC | 2262 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
st = list(range(n-1, 0, -1))
nn = 1
while st:
for i in range(nn):
j = st.pop()
qc.cx(i, j)
nn += 1
if len(st) == 0:
break
return qc
''' |
QPC002_A5 | A2E81A1613F50 | 1 | DLE | 1694 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Step 1: Apply Hadamard gate to the first qubit
qc.h(0)
# Step 2: Apply Z gate to the first qubit to introduce the phase
qc.z(0)
# Step 3: Apply CNOT gates with qubit 0 as the control and the others as targets
# We apply CNOT gates in parallel where possible
if n > 1:
for i in range(1, n):
qc.cx(0, i)
return qc
''' |
QPC002_A5 | A2E81A1613F50 | 2 | WA | 1149 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Step 1: Apply Hadamard gate to the first qubit
qc.h(0)
# Step 2: Apply CNOT gates in a modified manner
for i in range(1, n):
qc.cz(0, i)
# Step 3: Apply a final CNOT gate between the first qubit and all others
for i in range(1, n):
qc.cx(0, i)
return qc
''' |
QPC002_A5 | A2E81A1613F50 | 3 | DLE | 1224 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Step 1: Apply Hadamard gate to the first qubit
qc.h(0)
qc.z(0)
# Step 3: Apply a final CNOT gate between the first qubit and all others
for i in range(1, n):
qc.cx(0, i)
return qc
''' |
QPC002_A5 | A2E81A1613F50 | 4 | WA | 1460 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Step 1: Apply Hadamard gate to the first qubit
qc.h(0)
# Step 2: Apply CNOT gates between the first qubit and each of the other qubits
if n > 1:
qc.cx(0, 1) # Depth 2
if n > 2:
qc.ccx(0, 1, 2) # Using Toffoli gate (multi-control XOR) - Depth 3
return qc
''' |
QPC002_A5 | A2E81A1613F50 | 5 | WA | 1474 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Step 1: Apply Hadamard gate to the first qubit
qc.h(0)
# Step 2: Apply a controlled Z (CZ) gate between all pairs of qubits
if n > 1:
qc.cz(0, 1) # Depth 2
if n > 2:
qc.cz(1, 2) # Depth 2 (since it can be in parallel with the first CZ)
if n > 3:
qc.cz(2, 3) # Depth 3 (this is the final depth)
return qc
''' |
QPC002_A5 | A2ED731EC7C1F | 1 | AC | 1866 ms | 157 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
kouho = []
for i in range(n-1):
target = i + 1
if kouho:
a = kouho.pop()
qc.cx(a, target)
else:
qc.cx(0, target)
for j in range(1, target):
kouho.append(j)
qc.z(n-1)
return qc
''' |
QPC002_A5 | A3826F8E99454 | 1 | AC | 1806 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.cx(0,1)
now = 1
while now<=n-1:
for i in range(now):
if now+i+1>=n:
break
qc.cx(i+1,i+1+now)
now *= 2
qc.z(0)
return qc
''' |
QPC002_A5 | A3B7264E87B75 | 1 | AC | 2146 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
used = [False]*n
used[0] = True
ones = [0]
while True:
if len(ones) == n:
break
nones = []
for i in ones:
nones.append(i)
for j in range(0,n):
if not used[j]:
qc.cx(i,j)
used[j] = True
nones.append(j)
break
ones = nones[:]
# Write your code here:
qc.z(n-1)
return qc
''' |
QPC002_A5 | A3CC9DA78BC10 | 1 | RE | 1039 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
for i in range(n):
if i % 2 == 0:
if i != 0:
qc.x(i)
qc.cx(i, i + 1)
for i in range(n):
if i % 2 == 1:
if i != n - 1:
qc.x(i)
qc.cx(i, i + 1)
qc.x(i)
return qc
''' |
QPC002_A5 | A3CC9DA78BC10 | 2 | WA | 1072 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
for i in range(n):
if i % 2 == 0:
if i != 0:
qc.x(i)
if i != n - 1:
qc.cx(i, i + 1)
for i in range(n):
if i % 2 == 1:
if i != n - 1:
qc.x(i)
qc.cx(i, i + 1)
qc.x(i)
return qc
''' |
QPC002_A5 | A3CC9DA78BC10 | 3 | AC | 1932 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
max_qubit = 1
for i in range(4):
for j in range(2 ** i):
qc.cx(j, j + 2 ** i)
max_qubit = max(j + 2 ** i, max_qubit)
if max_qubit == n - 1:
break
if max_qubit == n - 1:
break
return qc
''' |
QPC002_A5 | A3D60120F805D | 1 | AC | 1685 ms | 157 MiB | '''python
import math
import numpy as np
from qiskit import QuantumCircuit, QuantumRegister
from qiskit.circuit.library.standard_gates import (
C3XGate,
C3SXGate,
C4XGate,
CCXGate,
DCXGate,
CHGate,
CPhaseGate,
CRXGate,
CRYGate,
CRZGate,
CSwapGate,
CSXGate,
CUGate,
CU1Gate,
CU3Gate,
CXGate,
CYGate,
CZGate,
CCZGate,
HGate,
IGate,
MCPhaseGate,
PhaseGate,
RCCXGate,
RC3XGate,
RXGate,
RXXGate,
RYGate,
RYYGate,
RZGate,
RZZGate,
RZXGate,
XXMinusYYGate,
XXPlusYYGate,
ECRGate,
SGate,
SdgGate,
CSGate,
CSdgGate,
SwapGate,
iSwapGate,
SXGate,
SXdgGate,
TGate,
TdgGate,
UGate,
U1Gate,
U2Gate,
U3Gate,
XGate,
YGate,
ZGate,
)
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
for b in [8, 4, 2, 1]:
for j in range(b, n, b * 2):
i = j - b
qc.cx(i, j)
return qc
''' |
QPC002_A5 | A3DC9BC9AB84B | 1 | AC | 1945 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n:int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
qc.cx(0,1)
if (n == 3):
qc.cx(0,2)
elif (n==4):
qc.cx(0,2)
qc.cx(1,3)
elif (n==5):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
elif (n==6):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
qc.cx(1,5)
elif (n==7):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
qc.cx(1,5)
qc.cx(2,6)
elif (n==8):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
qc.cx(1,5)
qc.cx(2,6)
qc.cx(3,7)
elif (n==9):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
qc.cx(1,5)
qc.cx(2,6)
qc.cx(3,7)
qc.cx(0,8)
elif (n==10):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
qc.cx(1,5)
qc.cx(2,6)
qc.cx(3,7)
qc.cx(0,8)
qc.cx(1,9)
elif (n==11):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
qc.cx(1,5)
qc.cx(2,6)
qc.cx(3,7)
qc.cx(0,8)
qc.cx(1,9)
qc.cx(2,10)
elif (n==12):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
qc.cx(1,5)
qc.cx(2,6)
qc.cx(3,7)
qc.cx(0,8)
qc.cx(1,9)
qc.cx(2,10)
qc.cx(3,11)
elif (n==13):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
qc.cx(1,5)
qc.cx(2,6)
qc.cx(3,7)
qc.cx(0,8)
qc.cx(1,9)
qc.cx(2,10)
qc.cx(3,11)
qc.cx(4,12)
elif (n==14):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
qc.cx(1,5)
qc.cx(2,6)
qc.cx(3,7)
qc.cx(0,8)
qc.cx(1,9)
qc.cx(2,10)
qc.cx(3,11)
qc.cx(4,12)
qc.cx(5,13)
elif (n==15):
qc.cx(0,2)
qc.cx(1,3)
qc.cx(0,4)
qc.cx(1,5)
qc.cx(2,6)
qc.cx(3,7)
qc.cx(0,8)
qc.cx(1,9)
qc.cx(2,10)
qc.cx(3,11)
qc.cx(4,12)
qc.cx(5,13)
qc.cx(6,14)
return qc
''' |
QPC002_A5 | A3E64874F3980 | 1 | AC | 2083 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
a = [[0, 1], [0, 2], [1, 3], [0, 4], [1, 5], [2, 6], [3, 7], [0, 8], [1, 9], [2, 10], [3, 11], [4, 12], [5, 13], [6, 14]]
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
for i in range(n-1):
qc.cx(a[i][0],a[i][1])
return qc
''' |
QPC002_A5 | A3EEC60127B9B | 1 | RE | 1708 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
if n <= 3:
qc.z(0)
for i in range(1, n):
qc.cx(0, i)
elif n <= 6:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(1, 4)
qc.cx(2, 5)
qc.z(0)
else:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(1, 4)
qc.cx(2, 5)
qc.z(0)
count = 0
while count+6 < n:
qc.cx(count, count+6)
count += 1
return qc
''' |
QPC002_A5 | A3EEC60127B9B | 2 | AC | 1742 ms | 144 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
if n <= 3:
qc.z(0)
for i in range(1, n):
qc.cx(0, i)
elif n <= 6:
qc.cx(0, 1)
qc.cx(1, 2)
count = 0
while count+3 < n:
qc.cx(count, count+3)
count += 1
qc.z(0)
else:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(1, 4)
qc.cx(2, 5)
qc.z(0)
count = 0
while count+6 < n:
qc.cx(count, count+6)
count += 1
return qc
''' |
QPC002_A5 | A4080138B34EA | 1 | DLE | 2227 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
if n == 3:
return solve3()
qc = QuantumCircuit(n)
qc.h(0)
ans = [0 for _ in range(n)]
qc.cx(0, n//2)
ans[0] = 1
ans[n//2] = 1
r = (n//2)//2
while not all(ans):
for i in range(n-r):
if ans[i] == 1 and ans[i+r] == 0:
qc.cx(i, i+r)
ans[i+r] = 1
if r != 1:
r //= 2
else:
break
qc.z(0)
return qc
def solve3():
qc = QuantumCircuit(3)
# Write your code here:
qc.h(0)
for i in range(1, 3):
qc.cx(0, i)
qc.z(0)
return qc
''' |
QPC002_A5 | A4080138B34EA | 2 | AC | 2247 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
if n == 3:
return solve3()
qc = QuantumCircuit(n)
qc.h(0)
ans = [0 for _ in range(n)]
qc.cx(0, n//2)
ans[0] = 1
ans[n//2] = 1
r = (n//2)
while not all(ans):
for i in range(n-r):
if ans[i] == 1 and ans[i+r] == 0:
qc.cx(i, i+r)
ans[i+r] = 1
r //= 2
qc.z(0)
return qc
def solve3():
qc = QuantumCircuit(3)
# Write your code here:
qc.h(0)
for i in range(1, 3):
qc.cx(0, i)
qc.z(0)
return qc
''' |
QPC002_A5 | A431B57D0496D | 1 | RE | 1101 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
step = 2**ceil(log2(n))
while step:
for i in range(0, n, 2 * step):
if i + step < n:
qc.cx(i, i + step)
step //= 2
return qc
''' |
QPC002_A5 | A431B57D0496D | 2 | AC | 2077 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
from math import ceil,log2
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
step = 2**ceil(log2(n))
while step:
for i in range(0, n, 2 * step):
if i + step < n:
qc.cx(i, i + step)
step //= 2
return qc
''' |
QPC002_A5 | A433D21B5349C | 1 | AC | 2965 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
idx1 = 0
next1 = 1
breakF = False
while not breakF:
for i, j in enumerate(range(idx1 + 1, idx1 + next1 + 1)):
if j >= n:
breakF = True
break
qc.cx(i, j)
if breakF:
break
idx1 += next1
next1 *= 2
qc.z(0)
return qc
''' |
QPC002_A5 | A436A8BBD72E2 | 1 | WA | 1536 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply Hadamard to the first qubit
qc.h(0)
# Entangle all other qubits with the first one
for i in range(1, n):
qc.cx(0, i)
# Apply X gates to all qubits
for i in range(n):
qc.x(i)
# Apply Hadamard gates to all qubits except the first one
for i in range(1, n):
qc.h(i)
return qc
''' |
QPC002_A5 | A436A8BBD72E2 | 2 | WA | 1285 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply Hadamard gates to all qubits
for i in range(n):
qc.h(i)
# Apply CNOT gates to create the desired superposition
for i in range(n-1):
qc.cx(i, i+1)
return qc
''' |
QPC002_A5 | A436A8BBD72E2 | 3 | WA | 1155 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply Hadamard gates to all qubits
for i in range(n):
qc.h(i)
# Apply CNOT gates to create the desired entanglement
for i in range(n-1):
qc.cx(i, i+1)
return qc
''' |
QPC002_A5 | A436A8BBD72E2 | 4 | WA | 1498 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply Hadamard gates to all qubits
for i in range(n):
qc.h(i)
# Apply CNOT gates for efficient entanglement (reduce depth)
for i in range(1, n):
for j in range(i):
qc.cx(j, i) # Apply CNOT from lower qubits to higher qubits
return qc
''' |
QPC002_A5 | A45D0458FF08A | 1 | AC | 2008 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
a=1
while a<n:
for i in range(a):
if i+a<n:
qc.cx(i,i+a)
a*=2
qc.z(0)
return qc
''' |
QPC002_A5 | A496D8B504B48 | 1 | AC | 2187 ms | 143 MiB | '''python
import math
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.ry(-math.pi, 0)
log = int(math.log2(n - 1)) + 1
swapped = set([0])
for i in range(log - 1, -1, -1):
done = set()
for j in range(n):
if j not in swapped:
continue
next_j = j + 2**i
print(j, next_j)
if next_j < n and next_j not in swapped:
done.add(next_j)
qc.cx(j, next_j)
swapped |= done
return qc
''' |
QPC002_A5 | A4B7AB71173A3 | 1 | WA | 1272 ms | 150 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
mbit = 0
for j in range(5):
if i>>j&1: mbit = j
qc.cx(i, i-(1<<mbit))
qc.z(n-1)
return qc
''' |
QPC002_A5 | A4B7AB71173A3 | 2 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
mbit = 0
for j in range(5):
if i>>j&1: mbit = j
qc.cx(i, 1<<mbit)
qc.z(n-)
return qc
''' | ||
QPC002_A5 | A4B7AB71173A3 | 3 | RE | 1327 ms | 149 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
mbit = 0
for j in range(5):
if i>>j&1: mbit = j
qc.cx(i, i-1<<mbit)
qc.z(0)
return qc
''' |
QPC002_A5 | A4B7AB71173A3 | 4 | AC | 1736 ms | 154 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
mbit = 0
for j in range(5):
if i>>j&1: mbit = j
qc.cx(i-(1<<mbit), i)
qc.z(0)
return qc
''' |
QPC002_A5 | A4ED07C9B52E7 | 1 | AC | 2202 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
# log depth
import math
l = int(math.ceil(math.log2(n)))
for m in range(l, 0, -1):
for k in range(0, n, 2**m):
if k + 2 ** (m - 1) >= n:
continue
qc.cx(k, k + 2 ** (m - 1))
qc.z(0)
return qc
''' |
QPC002_A5 | A4F592A06E228 | 1 | DLE | 1910 ms | 159 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0,1)
c=0
if n>2:
for i in range(n-2):
if c%2==0:
qc.cx(0,i+2)
c=c+1
else:
qc.cx(1,i+2)
c=c+1
qc.z(1)
return qc
''' |
QPC002_A5 | A4F592A06E228 | 2 | DLE | 2040 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0,1)
c=2
if n>2:
for i in range(n-2):
if c%4==0:
qc.cx(2,i+2)
c=c+1
elif c%3==0:
qc.cx(1,i+2)
c=c+1
elif c%2==0:
qc.cx(0,i+2)
c=c+1
else:
qc.cx(3,i+2)
c=c+1
qc.z(1)
return qc
''' |
QPC002_A5 | A4F592A06E228 | 3 | DLE | 2078 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0,1)
c=2
if n>2:
for i in range(n-2):
if c%4==0:
qc.cx(2,i+2)
c=c+1
elif c%3==0:
qc.cx(1,i+2)
c=c+1
elif c%2==0:
qc.cx(0,i+2)
c=c+1
elif c%5==0:
qc.cx(3,i+2)
c=c+1
else:
qc.cx(4,i+2)
c=c+1
qc.z(1)
return qc
''' |
QPC002_A5 | A4F592A06E228 | 4 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import UnitaryGate
import numpy as np
def solve(n: int) -> QuantumCircuit:
gate = np.array([1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,-1,0])
ug = UnitaryGate(gate, label = "ug")
qc = QuantumCircuit(n)
qc.h(0)
qc.gate(0,1)
c=2
if n>2:
for i in range(n-2):
if c%4==0:
qc.cx(2,i+2)
c=c+1
elif c%3==0:
qc.cx(1,i+2)
c=c+1
elif c%2==0:
qc.cx(0,i+2)
c=c+1
elif c%5==0:
qc.cx(3,i+2)
c=c+1
else:
qc.cx(4,i+2)
c=c+1
qc.barrier()
qc.z(1)
return qc
''' | ||
QPC002_A5 | A4F592A06E228 | 5 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import UnitaryGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0,1)
c=2
if n>2:
for i in range(n-2):
if c%4==0:
qc.cx(2,i+2)
c=c+1
elif c%3==0:
qc.cx(1,i+2)
c=c+1
elif c%2==0:
qc.cx(0,i+2)
c=c+1
elif c%5==0:
qc.cx(3,i+2)
c=c+1
else:
qc.cx(4,i+2)
c=c+1
qc.barrier()
qc.z(1)
return qc
''' | ||
QPC002_A5 | A4F592A06E228 | 6 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import UnitaryGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0,1)
c=2
if n>2:
for i in range(n-2):
if c%4==0:
qc.cx(2,i+2)
c=c+1
elif c%3==0:
qc.cx(1,i+2)
c=c+1
elif c%2==0:
qc.cx(0,i+2)
c=c+1
elif c%5==0:
qc.cx(3,i+2)
c=c+1
else:
qc.cx(4,i+2)
c=c+1
qc.z(1)
return qc
''' | ||
QPC002_A5 | A4F592A06E228 | 7 | DLE | 1763 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0,1)
c=2
if n>2:
for i in range(n-2):
if c%4==0:
qc.cx(2,i+2)
c=c+1
elif c%3==0:
qc.cx(1,i+2)
c=c+1
elif c%2==0:
qc.cx(0,i+2)
c=c+1
elif c%5==0:
qc.cx(3,i+2)
c=c+1
else:
qc.cx(4,i+2)
c=c+1
qc.barrier()
qc.z(1)
return qc
''' |
QPC002_A5 | A4F592A06E228 | 8 | DLE | 2085 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0,1)
c=2
if n>2:
for i in range(n-2):
if c%4==0:
qc.cx(2,i+2)
c=c+1
elif c%3==0:
qc.cx(1,i+2)
c=c+1
elif c%2==0:
qc.cx(0,i+2)
c=c+1
elif c%5==0:
qc.cx(3,i+2)
c=c+1
else:
qc.cx(4,i+2)
c=c+1
qc.z(1)
return qc
''' |
QPC002_A5 | A4F592A06E228 | 9 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0,1)
c=2
if n>2:
for i in range(n-2):
if c%4==0:
qc.cx(2,i+2)
c=c+1
elif c%3==0:
qc.cx(1,i+2)
c=c+1
elif c%2==0:
qc.cx(0,i+2)
c=c+1
elif c%5==0:
qc.cx(3,i+2)
c=c+1
else:
qc.cx(4,i+2)
c=c+1
if n==14
qc.z(3)
else
qc.z(1)
return qc
''' | ||
QPC002_A5 | A4F71F098D984 | 1 | AC | 2164 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
for b in reversed(range(5)):
i = 0
while True:
if i + (1<<b) >= n:
break
qc.cx(i, i + (1<<b))
i += (1<<(b+1))
return qc
''' |
QPC002_A5 | A5094193E3760 | 1 | AC | 2437 ms | 157 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(math.ceil(math.log2(n))):
for j in range(2 ** i):
if 2 ** i + j == n:
break;
qc.cx(j, 2 ** i + j)
qc.z(0)
return qc
''' |
QPC002_A5 | A51775EB09620 | 1 | DLE | 1096 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1,n):
qc.cx(0, i)
qc.z(0)
return qc
''' |
QPC002_A5 | A51775EB09620 | 2 | AC | 1980 ms | 142 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(math.ceil(math.log2(n))):
for j in range(2**i):
if 2**i + j == n:
break
qc.cx(j, 2**i + j)
qc.z(0)
return qc
''' |
QPC002_A5 | A51A4ECAB5A6B | 1 | AC | 2014 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
l = int(np.ceil(np.log2(n)))
for m in range(l, 0, -1):
for k in range(0, n, 2 ** m):
if k + 2 ** (m - 1) >= n: continue
qc.cx(k, k + 2 ** (m - 1))
return qc
''' |
QPC002_A5 | A5259979D3422 | 1 | AC | 2130 ms | 142 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
from qiskit.circuit.library import GlobalPhaseGate
import numpy as np
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
def f(x, y):
if y < n:
qc.cx(x, y)
f(0, 1)
f(0, 2)
f(1, 3)
f(0, 4)
f(1, 5)
f(2, 6)
f(3, 7)
f(0, 8)
f(1, 9)
f(2, 10)
f(3, 11)
f(4, 12)
f(5, 13)
f(6, 14)
f(7, 15)
qc.z(0)
return qc
''' |
QPC002_A5 | A5295D4420A6F | 1 | AC | 1740 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
qc.cx(0,1)
if n>2:
ent_num=1
ent_num_tmp=1
while(True):
for i in range(ent_num+1):
qc.cx(i, ent_num+1+i)
ent_num_tmp+=1
if ent_num+i+1==n-1:
break
else:
ent_num=ent_num_tmp
continue
break
return qc
''' |
QPC002_A5 | A54034382C113 | 1 | DLE | 1787 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
for i in range(1, n):
qc.cx(i // 2, i)
return qc
''' |
QPC002_A5 | A54034382C113 | 2 | DLE | 1883 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
for i in range(1, n):
qc.cx(i // 4, i)
return qc
''' |
QPC002_A5 | A54034382C113 | 3 | DLE | 1560 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
for i in range(1, n):
qc.cx(i // 3, i)
return qc
''' |
QPC002_A5 | A54034382C113 | 4 | DLE | 1491 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
for i in range(2, n + 1):
qc.cx(i // 2 - 1, i - 1)
return qc
''' |
QPC002_A5 | A54034382C113 | 5 | DLE | 1614 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
for i in range(1, n):
qc.cx(i // 2, i)
return qc
''' |
QPC002_A5 | A54034382C113 | 6 | DLE | 1179 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
qc.cx(i // 2 , i)
qc.z(n - 1)
return qc
''' |
QPC002_A5 | A54034382C113 | 7 | DLE | 1509 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
qc.cx(i // 2 , i)
qc.z(1)
return qc
''' |
QPC002_A5 | A54034382C113 | 8 | DLE | 1043 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(1, n):
qc.cx(i // 2 , i)
qc.z(n - 2)
return qc
''' |
QPC002_A5 | A554CF6A0FF3C | 1 | AC | 2960 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
l = int(np.ceil(np.log2(n)))
for m in range(l, 0, -1):
for k in range(0, n, 2 ** m):
if k + 2 ** (m - 1) >= n: continue
qc.cx(k, k + 2 ** (m - 1))
return qc
''' |
QPC002_A5 | A586E780B36C9 | 1 | AC | 2061 ms | 142 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.z(0)
m = 1
while m < n:
for i in range(m):
if i + m < n:
qc.cx(i, i + m)
m *= 2
return qc
''' |
QPC002_A5 | A5AA8AF9531A8 | 1 | AC | 2150 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
x=[1]
for i in range(1,n):
# print(x)
y=min(x)
for j in range(len(x)):
if y==x[j]:
break
qc.cx(j,i)
x[j]+=1
x+=x[j],
qc.z(0)
return qc
''' |
QPC002_A5 | A5B450C5797B5 | 1 | AC | 2256 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.cx(0, 1)
if n > 2:
qc.cx(0, 2)
if n > 3:
qc.cx(1, 3)
if n > 4:
qc.cx(0, 4)
if n > 5:
qc.cx(1, 5)
if n > 6:
qc.cx(2, 6)
if n > 7:
qc.cx(3, 7)
if n > 8:
qc.cx(0, 8)
if n > 9:
qc.cx(1, 9)
if n > 10:
qc.cx(2, 10)
if n > 11:
qc.cx(3, 11)
if n > 12:
qc.cx(4, 12)
if n > 13:
qc.cx(5, 13)
if n > 14:
qc.cx(6, 14)
qc.cz(0, 1)
return qc
''' |
QPC002_A5 | A5BDEFD25DE6A | 1 | WA | 1165 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
i = 0
while 2**i < n:
j = 2**i
for l in range(j):
if j+l == n-1:
break
qc.cx(l,j+l)
i = i+1
qc.z(0)
return qc
''' |
QPC002_A5 | A5BDEFD25DE6A | 2 | WA | 1451 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
# finding the mid qubit
i = 0
while 2**i < n:
j = 2**i
for l in range(j):
if j+l == n-1:
break
qc.cx(l,j+l)
i = i+1
qc.z(0)
return qc
''' |
QPC002_A5 | A5BDEFD25DE6A | 3 | WA | 1119 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
# finding the mid qubit
i = 0
while 2**i < n:
j = 2**i
for l in range(j):
if j+l == n-1:
break
qc.cx(l,j+l)
i = i+1
qc.barrier()
qc.z(0)
return qc
''' |
QPC002_A5 | A5BDEFD25DE6A | 4 | WA | 1142 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
# finding the mid qubit
i = 0
while 2**i < n:
j = 2**i
for l in range(j):
if j+l == n-1:
break
qc.cx(l,j+l)
i = i+1
#qc.barrier()
#qc.z(0)
return qc
''' |
QPC002_A5 | A5BDEFD25DE6A | 5 | WA | 1058 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
# finding the mid qubit
i = 0
while 2**i < n:
j = 2**i
for l in range(j):
if j+l == n-1:
break
qc.cx(l,j+l)
i = i+1
#qc.barrier()
#qc.z(0)
return qc
''' |
QPC002_A5 | A5BDEFD25DE6A | 6 | WA | 1140 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
# finding the mid qubit
i = 0
while 2**i < n:
j = 2**i
for l in range(j):
if j+l == n-1:
break
qc.cx(l,j+l)
i = i+1
#qc.barrier()
qc.z(0)
return qc
''' |
QPC002_A5 | A5BDEFD25DE6A | 7 | AC | 2055 ms | 142 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
l = int(np.ceil(np.log2(n)))
for m in range(l, 0, -1):
for k in range(0, n, 2 ** m):
if k + 2 ** (m - 1) >= n: continue
qc.cx(k, k + 2 ** (m - 1))
#qc.barrier()
qc.z(0)
return qc
''' |
QPC002_A5 | A5C364721EB68 | 1 | AC | 2057 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
if n == 2:
qc.cx(0, 1)
elif n == 3:
qc.cx(0, 1)
qc.cx(1, 2)
elif n== 4:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
elif n == 5:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
elif n == 6:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
qc.cx(2, 5)
elif n == 7:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
qc.cx(2, 5)
qc.cx(1, 6)
elif n == 8:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
qc.cx(2, 5)
qc.cx(1, 6)
qc.cx(0, 7)
elif n == 9:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
qc.cx(2, 5)
qc.cx(1, 6)
qc.cx(0, 7)
qc.cx(7, 8)
elif n == 10:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
qc.cx(2, 5)
qc.cx(1, 6)
qc.cx(0, 7)
qc.cx(7, 8)
qc.cx(6, 9)
elif n == 11:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
qc.cx(2, 5)
qc.cx(1, 6)
qc.cx(0, 7)
qc.cx(7, 8)
qc.cx(6, 9)
qc.cx(5, 10)
elif n == 12:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
qc.cx(2, 5)
qc.cx(1, 6)
qc.cx(0, 7)
qc.cx(7, 8)
qc.cx(6, 9)
qc.cx(5, 10)
qc.cx(4, 11)
elif n == 13:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
qc.cx(2, 5)
qc.cx(1, 6)
qc.cx(0, 7)
qc.cx(7, 8)
qc.cx(6, 9)
qc.cx(5, 10)
qc.cx(4, 11)
qc.cx(3, 12)
elif n == 14:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
qc.cx(2, 5)
qc.cx(1, 6)
qc.cx(0, 7)
qc.cx(7, 8)
qc.cx(6, 9)
qc.cx(5, 10)
qc.cx(4, 11)
qc.cx(3, 12)
qc.cx(2, 13)
elif n == 15:
qc.cx(0, 1)
qc.cx(1, 2)
qc.cx(0, 3)
qc.cx(3, 4)
qc.cx(2, 5)
qc.cx(1, 6)
qc.cx(0, 7)
qc.cx(7, 8)
qc.cx(6, 9)
qc.cx(5, 10)
qc.cx(4, 11)
qc.cx(3, 12)
qc.cx(2, 13)
qc.cx(1, 14)
return qc
''' |
QPC002_A5 | A5E698C5EE7FA | 1 | RE | 2181 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(n-4):
if i % 3 == 0:
qc.cx(0, i+1)
elif i % 3 == 1:
qc.cx(1, i+1)
elif i % 3 == 2:
qc.cx(2, i+1)
qc.cx(3, n-3)
qc.cx(4, n-2)
qc.cx(5, n-1)
qc.z(0)
return qc
''' |
QPC002_A5 | A5E698C5EE7FA | 2 | DLE | 1954 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(n-1):
if i % 15 == 0:
qc.cx(0, i+1)
elif i % 15 == 1:
qc.cx(1, i+1)
elif i % 15 == 2:
qc.cx(2, i+1)
elif i % 15 == 3:
qc.cx(3, i+1)
elif i % 15 == 4:
qc.cx(4, i+1)
elif i % 15 == 5:
qc.cx(5, i+1)
elif i % 15 == 6:
qc.cx(6, i+1)
elif i % 15 == 7:
qc.cx(7, i+1)
elif i % 15 == 8:
qc.cx(8, i+1)
elif i % 15 == 9:
qc.cx(9, i+1)
elif i % 15 == 10:
qc.cx(10, i+1)
elif i % 15 == 11:
qc.cx(11, i+1)
elif i % 15 == 12:
qc.cx(12, i+1)
elif i % 15 == 13:
qc.cx(13, i+1)
elif i % 15 == 14:
qc.cx(14, i+1)
qc.z(0)
return qc
''' |
QPC002_A5 | A5E698C5EE7FA | 3 | DLE | 1900 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0,1)
for i in range(n-2):
if i % 14 == 0:
qc.cx(0, i+2)
elif i % 14 == 1:
qc.cx(1, i+2)
elif i % 14 == 2:
qc.cx(2, i+2)
elif i % 14 == 3:
qc.cx(3, i+2)
elif i % 14 == 4:
qc.cx(4, i+2)
elif i % 14 == 5:
qc.cx(5, i+2)
elif i % 14 == 6:
qc.cx(6, i+2)
elif i % 14 == 7:
qc.cx(7, i+2)
elif i % 14 == 8:
qc.cx(8, i+2)
elif i % 14 == 9:
qc.cx(9, i+2)
elif i % 14 == 10:
qc.cx(10, i+2)
elif i % 14 == 11:
qc.cx(11, i+2)
elif i % 14 == 12:
qc.cx(12, i+2)
elif i % 14 == 13:
qc.cx(13, i+2)
qc.z(0)
return qc
''' |
QPC002_A5 | A5E698C5EE7FA | 4 | AC | 2344 ms | 160 MiB | '''python
import math
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(int(math.log2(n)) + 1):
for j in range(2**i):
if 2**i + j == n:
break
qc.cx(j, 2**i + j)
qc.z(0)
return qc
''' |
QPC002_A5 | A618CBC1A08D3 | 1 | DLE | 1216 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
def entangle(idx1, idx2):
if idx2 > n - 1:
return
qc.cx(idx1, idx2)
entangle(idx2, (idx2 + 1) * 2 - 1)
entangle(idx2, (idx2 + 1) * 2)
entangle(0, 1)
entangle(0, 2)
qc.z(n- 1)
return qc
''' |
QPC002_A5 | A618CBC1A08D3 | 2 | RE | 1376 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for giver in range(math.ceil(math.log2(n))):
for taker in range(2 ** i):
if 2**giver + taker == n:
break
qc.cx(taker, 2**giver + taker)
qc.z(0)
return qc
''' |
QPC002_A5 | A618CBC1A08D3 | 3 | RE | 1138 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for giver in range(math.ceil(math.log2(n))):
for taker in range(2 ** i):
if 2**giver + taker == n:
break
qc.cx(taker, 2**giver + taker)
qc.z(0)
return qc
''' |
QPC002_A5 | A618CBC1A08D3 | 4 | AC | 2059 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for giver in range(math.ceil(math.log2(n))):
for taker in range(2 ** giver):
if 2**giver + taker == n:
break
qc.cx(taker, 2**giver + taker)
qc.z(0)
return qc
''' |
QPC002_A5 | A66572FBE768B | 1 | RE | 1322 ms | 157 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(math.ceil(math.log2(n))):
for j in range(2 ** i):
if 2 ** i + j == n:
break
qc.cx(j, 2 ** i + j)
qc.z(0)
return qc
''' |
QPC002_A5 | A66572FBE768B | 2 | AC | 1932 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(math.ceil(math.log2(n))):
for j in range(2 ** i):
if 2 ** i + j == n:
break
qc.cx(j, 2 ** i + j)
qc.z(0)
return qc
''' |
QPC002_A5 | A66B20C778281 | 1 | RE | 1119 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def get_min_depth(depth):
min_val = min(depth.values())
for (k, v) in depth.items():
if v == min_val:
return k
def get_unentangled_qubit(e, n):
for i in range(n):
if i not in e:
return i
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.cx(0, 1)
entangled_qubits = [0, 1]
depth = dict()
for i in range(n):
depth[i] = 0
depth[0] = 2
depth[1] = 2
while len(entangled_qubits) != n:
c = get_min_depth(depth)
t = get_unentangled_qubit(entangled_qubits, n)
qc.cx(c, t)
depth[c] = depth[c] + 1
depth[t] = depth[c]
entangled_qubits.append(t)
return qc
''' |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.