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 | A66B20C778281 | 2 | WA | 1271 ms | 141 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()
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
''' |
QPC002_A5 | A66B20C778281 | 3 | AC | 2176 ms | 143 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()
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)
qc.z(0)
return qc
''' |
QPC002_A5 | A66FDC460C8BE | 1 | AC | 1959 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def get_ghz_circuit(n_bits: int) -> QuantumCircuit:
qc = QuantumCircuit(n_bits)
qc.h(0)
m = 0
while 1 << m < n_bits: m += 1
for k in range(m):
d = 1 << k
for i in range(d):
if i + d < n_bits: qc.cx(i, i + d)
return qc
def solve(n: int) -> QuantumCircuit:
qc = get_ghz_circuit(n)
qc.z(0)
return qc
''' |
QPC002_A5 | A690533D4A87E | 1 | DLE | 1654 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(1, n, 4):
qc.cx(0, i)
if i+1 < n:
qc.cx(i, i+1)
if i+2 < n:
qc.cx(i, i+2)
if i+3 < n:
qc.cx(i, i+3)
qc.z(0)
return qc
''' |
QPC002_A5 | A690533D4A87E | 2 | DLE | 1675 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(1, n, 5):
qc.cx(0, i)
if i+1 < n:
qc.cx(i, i+1)
if i+2 < n:
qc.cx(i, i+2)
if i+3 < n:
qc.cx(i, i+3)
if i+4 < n:
qc.cx(i, i+4)
qc.z(0)
return qc
''' |
QPC002_A5 | A690533D4A87E | 3 | DLE | 1601 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
l = 5
i = 1
while i < n:
qc.cx(0, i)
for j in range(1, l):
if i+j < n:
qc.cx(i, i+j)
i += l
j -= 1
qc.z(0)
return qc
''' |
QPC002_A5 | A690533D4A87E | 4 | DLE | 1738 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
l = 6
i = 1
while i < n:
qc.cx(0, i)
for j in range(1, l):
if i+j < n:
qc.cx(i, i+j)
i += l
j -= 1
qc.z(0)
return qc
''' |
QPC002_A5 | A690533D4A87E | 5 | DLE | 1820 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
l = 4
i = 1
while i < n:
qc.cx(0, i)
for j in range(1, l):
if i+j < n:
qc.cx(i, i+j)
i += l
j -= 1
qc.z(0)
return qc
''' |
QPC002_A5 | A690533D4A87E | 6 | DLE | 1820 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
l = 5
i = 1
while i < n:
qc.cx(0, i)
for j in range(1, l):
if i+j < n:
qc.cx(i, i+j)
i += l
j = max(j-1, 1)
qc.z(0)
return qc
''' |
QPC002_A5 | A690533D4A87E | 7 | DLE | 2111 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(n):
if 2 * i + 1 < n:
qc.cx(i, 2 * i + 1)
if 2 * i + 2 < n:
qc.cx(i, 2 * i + 2)
qc.z(0)
return qc
''' |
QPC002_A5 | A690533D4A87E | 8 | AC | 2279 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
depth = [0] * n
visited = [0] * n
visited[0] = 1
for i in range(1, n):
m = n
p = 0
for j in range(i):
if depth[j] < m:
m = depth[j]
p = j
depth[p] += 1
depth[i] = depth[p]
qc.cx(p, i)
qc.z(0)
return qc
''' |
QPC002_A5 | A6B3F6D0BEE58 | 1 | AC | 1740 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)
tgt = 1
for p in range(math.ceil(math.log2(n))):
for i in range(2**p):
if tgt < n:
qc.cx(i,tgt)
tgt += 1
else:
break
qc.z(0)
return qc
''' |
QPC002_A5 | A6BB33E223E4D | 1 | RE | '''python
from qiskit import QuantumCircuit
from math import ceil, log,
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(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 | A6BB33E223E4D | 2 | RE | '''python
from qiskit import QuantumCircuit
from math import ceil, log,
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(int(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 | A6BB33E223E4D | 3 | RE | '''python
from qiskit import QuantumCircuit
from math import ceil, log,
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(int(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 | A6BB33E223E4D | 4 | RE | '''python
from qiskit import QuantumCircuit
from math import *
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(int(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 | A6BB33E223E4D | 5 | UME | '''python
from qiskit import QuantumCircuit
from math import *
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for i in range(int(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 | A6BB33E223E4D | 6 | AC | 1764 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(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 | A6CB00C2F1DBA | 1 | DLE | 1934 ms | 156 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 to entangle the first qubit with the others
for i in range(1, n):
qc.cx(0, i)
# Step 3: Apply a phase shift to the last qubit to create the negative sign
qc.z(n-1)
return qc
''' |
QPC002_A5 | A6F989CD66F29 | 1 | AC | 2214 ms | 142 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:
for j in range(2**i):
if j+2**i < n:
qc.cx(j, j+2**i)
i += 1
qc.z(0)
return qc
''' |
QPC002_A5 | A740B48962C1D | 1 | AC | 2049 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)
count = 1
while count < n:
add = 0
for i in range(count):
if n - 1 < count + i:
break
qc.cx(i, count + i)
add += 1
count += add
return qc
''' |
QPC002_A5 | A74D572634CD5 | 1 | AC | 2069 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n):
qc = QuantumCircuit(n)
qc.h(0)
for i in range(1,n):
q = 1 << i.bit_length() -1
r = i - q
print(i,q,r)
qc.cx(r,i)
qc.cz(0,1)
return qc
''' |
QPC002_A5 | A780BB8BBA9F1 | 1 | WA | 1372 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.cx(0,1)
for i in range(int(math.log2(n-1))):
for j in range(2**i):
if (j+2**i) > (n-1): continue
qc.cx(j,j+2**i)
qc.z(0)
return qc
''' |
QPC002_A5 | A780BB8BBA9F1 | 2 | AC | 2720 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)
qc.cx(0,1)
for i in range(int(math.log2(n-1))):
for j in range(2**(i+1)):
if (j+2**(i+1)) > (n-1): continue
qc.cx(j,j+2**(i+1))
qc.z(0)
return qc
''' |
QPC002_A5 | A787ABE8A99D7 | 1 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
clist = []
clist.append((0,1))
clist.append((0,2))
clist.append((1,3))
clist.append((1,4))
clist.append((2,5))
clist.append((2,6))
clist.append((3,7))
clist.append((3,8))
clist.append((4,9))
clist.append((4,10))
clist.append((5,11))
clist.append((5,12))
clist.append((6,13))
clist.append((6,14))
for c in clist:
if(c[0] < n and c[1] < n):
qc.cx(c[0], c[1])
return qc
''' | ||
QPC002_A5 | A787ABE8A99D7 | 2 | DLE | 1126 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)
clist = []
clist.append((0,1))
clist.append((0,2))
clist.append((1,3))
clist.append((1,4))
clist.append((2,5))
clist.append((2,6))
clist.append((3,7))
clist.append((3,8))
clist.append((4,9))
clist.append((4,10))
clist.append((5,11))
clist.append((5,12))
clist.append((6,13))
clist.append((6,14))
for c in clist:
if(c[0] < n and c[1] < n):
qc.cx(c[0], c[1])
return qc
''' |
QPC002_A5 | A787ABE8A99D7 | 3 | WA | 1390 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)
clist = []
clist.append((0,1))
clist.append((1,2))
clist.append((2,3))
clist.append((3,4))
clist.append((0,5))
clist.append((0,8))
clist.append((0,10))
clist.append((1,11))
clist.append((1,12))
clist.append((2,13))
clist.append((5,14))
for c in clist:
if(c[0] < n and c[1] < n):
qc.cx(c[0], c[1])
return qc
''' |
QPC002_A5 | A787ABE8A99D7 | 4 | WA | 1171 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)
clist = []
clist.append((0,1))
clist.append((0,5))
clist.append((0,8))
clist.append((0,10))
clist.append((1,2))
clist.append((1,11))
clist.append((1,12))
clist.append((2,3))
clist.append((2,13))
clist.append((3,4))
clist.append((5,14))
for c in clist:
if(c[0] < n and c[1] < n):
qc.cx(c[0], c[1])
return qc
''' |
QPC002_A5 | A787ABE8A99D7 | 5 | WA | 1461 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)
clist = []
clist.append((0,1))
clist.append((1,2))
clist.append((2,3))
clist.append((3,4))
clist.append((0,5))
clist.append((0,8))
clist.append((0,10))
clist.append((1,11))
clist.append((1,12))
clist.append((2,13))
clist.append((5,14))
for c in clist:
if(c[0] < n and c[1] < n):
qc.cx(c[0], c[1])
return qc
''' |
QPC002_A5 | A787ABE8A99D7 | 6 | WA | 1377 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)
clist = []
clist.append((0,1))
clist.append((0,5))
clist.append((0,8))
clist.append((0,10))
clist.append((1,2))
clist.append((1,11))
clist.append((1,12))
clist.append((2,3))
clist.append((2,13))
clist.append((3,4))
clist.append((5,14))
for c in clist:
if(c[0] < n and c[1] < n):
qc.cx(c[0], c[1])
return qc
''' |
QPC002_A5 | A787ABE8A99D7 | 7 | RE | 1468 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)
clist = []
clist.append((0,1))
clist.append((0,5))
clist.append((0,8))
clist.append((0,10))
clist.append((1,2))
clist.append((1,11))
clist.append((1,12))
clist.append((2,3))
clist.append((2,13))
clist.append((3,4))
clist.append((5,14))
clist.appned((8,9))
for c in clist:
if(c[0] < n and c[1] < n):
qc.cx(c[0], c[1])
return qc
''' |
QPC002_A5 | A787ABE8A99D7 | 8 | WA | 1586 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)
clist = []
clist.append((0,1))
clist.append((0,5))
clist.append((0,8))
clist.append((0,10))
clist.append((1,2))
clist.append((1,11))
clist.append((1,12))
clist.append((2,3))
clist.append((2,13))
clist.append((3,4))
clist.append((5,14))
clist.append((8,9))
for c in clist:
if(c[0] < n and c[1] < n):
qc.cx(c[0], c[1])
return qc
''' |
QPC002_A5 | A787ABE8A99D7 | 9 | AC | 2096 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)
clist = []
clist.append((0,1))
clist.append((1,2))
clist.append((2,3))
clist.append((3,4))
clist.append((0,5))
clist.append((5,6))
clist.append((6,7))
clist.append((0,8))
clist.append((8,9))
clist.append((0,10))
clist.append((1,11))
clist.append((1,12))
clist.append((2,13))
clist.append((5,14))
for c in clist:
if(c[0] < n and c[1] < n):
qc.cx(c[0], c[1])
return qc
''' |
QPC002_A5 | A7A4FF88CC34C | 1 | AC | 1883 ms | 145 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):
j = (1<<(i.bit_length()-1))
qc.cx(i-j,i)
qc.z(0)
return qc
''' |
QPC002_A5 | A7A756D1D14CA | 1 | AC | 2019 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)
qc0 = QuantumCircuit(n-1)
for i in range(n-1):
qc0.x(i)
cxgates = qc0.to_gate().control(1)
qc.append(cxgates, range(n))
return qc
''' |
QPC002_A5 | A7AAEF6DDD82B | 1 | AC | 2191 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
qc.h(0)
l = 1
while l < n:
r = min(n, 2 * l)
for i in range(l, r):
qc.cx(i - l, i)
l = r
return qc
''' |
QPC002_A5 | A7EE3050B36EC | 1 | AC | 2876 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.h(0)
controls = [0, 0, 1, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 6, 7,]
for i in range(1, n):
qc.cx(controls[i - 1], i)
return qc
''' |
QPC002_A5 | A7F5AE0FCF428 | 1 | RE | 2022 ms | 153 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc = QuantumCircuit(n)
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 | A7F5AE0FCF428 | 2 | RE | 1548 ms | 153 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc = QuantumCircuit(n)
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.barrier()
qc.z(0)
return qc
''' |
QPC002_A5 | A7F5AE0FCF428 | 3 | AC | 1824 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc = QuantumCircuit(n)
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.barrier()
qc.z(0)
return qc
''' |
QPC002_A5 | A81F12C7D0386 | 1 | DLE | 1901 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
m = 1
qc.h(0)
for i in range(5):
for l in range(i+1):
if m >= n:
break
qc.cx(l,m)
m += 1
if m >= n:
break
qc.z(1)
return qc
''' |
QPC002_A5 | A81F12C7D0386 | 2 | AC | 2163 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
m = 1
qc.h(0)
for i in range(5):
for l in range(2**i):
if m >= n:
break
qc.cx(l,m)
m += 1
if m >= n:
break
qc.z(1)
return qc
''' |
QPC002_A5 | A8209E9E34AD3 | 1 | DLE | 1578 ms | 142 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(n):
if i*2+1<n:
qc.cx(i,i*2+1)
if i*2+2<n:
qc.cx(i,i*2+2)
return qc
''' |
QPC002_A5 | A8209E9E34AD3 | 2 | AC | 2123 ms | 145 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
t=7*math.pi/2
qc.ry(t,0)
li=[0]
nex=[0]
while len(li)<n:
nex=li.copy()
ma=max(li)+1
for i in li:
if ma<n:
qc.cx(i,ma)
nex.append(ma)
ma+=1
li=nex
return qc
''' |
QPC002_A5 | A84267D255FA3 | 1 | AC | 1670 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
d = 1
while d < n:
for i in range(0, d):
if i + d < n:
qc.cx(i, i + d)
print(i, i + d)
d *= 2
qc.z(0)
return qc
# solve(15).draw('mpl').show()
''' |
QPC002_A5 | A86DFF5705F98 | 1 | AC | 2305 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, n-1)
if n>=3:
qc.cx(0, 1)
if n>=4:
qc.cx(n-1, n-2)
if n>=5:
qc.cx(0, 2)
if n>=6:
qc.cx(n-1, n-3)
if n>=7:
qc.cx(1, 3)
if n>=8:
qc.cx(n-2, n-4)
if n>=9:
qc.cx(0, 4)
if n>=10:
qc.cx(n-1, n-5)
if n>=11:
qc.cx(1, 5)
if n>=12:
qc.cx(n-2, n-6)
if n>=13:
qc.cx(2, 6)
if n>=14:
qc.cx(n-3, n-7)
if n>=15:
qc.cx(n-4, n-8)
return qc
''' |
QPC002_A5 | A8AB1A0CB5FB8 | 1 | DLE | 1321 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 | A8AB1A0CB5FB8 | 2 | DLE | 1276 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-1)//2, i)
return qc
''' |
QPC002_A5 | A8AB1A0CB5FB8 | 3 | DLE | 1180 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-1)//3, i)
return qc
''' |
QPC002_A5 | A8AB1A0CB5FB8 | 4 | DLE | 1313 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-1)//4, i)
return qc
''' |
QPC002_A5 | A8AB1A0CB5FB8 | 5 | RE | 1134 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qg.cy(math.pi / 2.0, 0)
# qc.h(0)
# qc.z(0)
for i in range(1, n):
qc.cx((i-1)//2, i)
return qc
''' |
QPC002_A5 | A8AB1A0CB5FB8 | 6 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.ry(math.pi / 2.0, 0)
# qc.h(0)
# qc.z(0)
for i in range(1, n):
qc.cx((i-1)//, i)
return qc
''' | ||
QPC002_A5 | A8AB1A0CB5FB8 | 7 | RE | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.ry(math.pi / 2.0, 0)
# qc.h(0)
# qc.z(0)
for i in range(1, n):
qc.cx((i-1)//, i)
return qc
''' | ||
QPC002_A5 | A8AB1A0CB5FB8 | 8 | WA | 1200 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.ry(math.pi / 2.0, 0)
# qc.h(0)
# qc.z(0)
for i in range(1, n):
qc.cx((i-1)//2, i)
return qc
''' |
QPC002_A5 | A8AB1A0CB5FB8 | 9 | DLE | 1256 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.ry(-math.pi / 2.0, 0)
# qc.h(0)
# qc.z(0)
for i in range(1, n):
qc.cx((i-1)//2, i)
return qc
''' |
QPC002_A5 | A8AB1A0CB5FB8 | 10 | DLE | 1164 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.ry(-math.pi / 2.0, 0)
# qc.h(0)
# qc.z(0)
for i in range(1, n):
qc.cx((i-1)//3, i)
return qc
''' |
QPC002_A5 | A8AB1A0CB5FB8 | 11 | DLE | 1329 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.ry(-math.pi / 2.0, 0)
# qc.h(0)
# qc.z(0)
for i in range(1, n):
qc.cx((i-1)//2, i)
return qc
''' |
QPC002_A5 | A8AED22894413 | 1 | DLE | 1745 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0, n - 1)
for i in range(1, n // 2):
qc.cx(0, i)
for i in range(n - 2, n // 2 - 1, -1):
qc.cx(n - 1, i)
qc.z(n - 1)
return qc
''' |
QPC002_A5 | A8AED22894413 | 2 | AC | 2555 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
entangled = [0]
next_qubit = 1
while next_qubit < n:
new_controls = []
for control in entangled:
if next_qubit < n:
qc.cx(control, next_qubit)
new_controls.append(next_qubit)
next_qubit += 1
entangled += new_controls
qc.z(n - 1)
return qc
''' |
QPC002_A5 | A8FBA9AB14E2A | 1 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
if n <= 5:
for i in range(n - ):
qc.cx(0, i + 1)
elif n <= 11:
half = n // 2
first = n - half - 1
for i in range(first):
qc.cx(0, i + 1)
for i in range(half):
qc.cx(1, i + 1 + first)
elif n == 12:
elif n == 13:
elif n == 14:
elif n == 15:
return qc
''' | ||
QPC002_A5 | A8FBA9AB14E2A | 2 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
if n <= 5:
for i in range(n - ):
qc.cx(0, i + 1)
elif n <= 11:
half = n // 2
first = n - half - 1
for i in range(first):
qc.cx(0, i + 1)
for i in range(half):
qc.cx(1, i + 1 + first)
elif n == 12:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 13:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 14:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(12, 14)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
elif n == 15:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(12, 14)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
qc.cx(14, 15)
return qc
''' | ||
QPC002_A5 | A8FBA9AB14E2A | 3 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
if n <= 5:
for i in range(n - ):
qc.cx(0, i + 1)
elif n <= 11:
half = n // 2
first = n - half - 1
for i in range(first):
qc.cx(0, i + 1)
for i in range(half):
qc.cx(1, i + 1 + first)
elif n == 12:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 13:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 14:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(12, 14)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
else:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(12, 14)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
qc.cx(14, 15)
return qc
''' | ||
QPC002_A5 | A8FBA9AB14E2A | 4 | RE | 1337 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
if n <= 5:
for i in range(n - 1):
qc.cx(0, i + 1)
elif n <= 11:
half = n // 2
first = n - half - 1
for i in range(first):
qc.cx(0, i + 1)
for i in range(half):
qc.cx(1, i + 1 + first)
elif n == 12:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 13:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 14:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(12, 14)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
else:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(12, 14)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
qc.cx(14, 15)
return qc
''' |
QPC002_A5 | A8FBA9AB14E2A | 5 | DLE | 2682 ms | 144 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
if n <= 5:
for i in range(n - 1):
qc.cx(0, i + 1)
elif n <= 8:
half = n // 2
first = n - half - 1
for i in range(first):
qc.cx(0, i + 1)
for i in range(half):
qc.cx(1, i + 1 + first)
elif n == 8:
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
elif n == 9:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
elif n == 10:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
elif n == 11:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
elif n == 12:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 13:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 14:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
else:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(12, 14)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
return qc
''' |
QPC002_A5 | A8FBA9AB14E2A | 6 | DLE | 1081 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.z(0)
if n <= 3:
for i in range(n - 1):
qc.cx(0, i + 1)
elif n <= 8:
half = n // 2
first = n - half - 1
for i in range(first):
qc.cx(0, i + 1)
for i in range(half):
qc.cx(1, i + 1 + first)
elif n == 8:
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
elif n == 8:
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
elif n == 9:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
elif n == 10:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
elif n == 11:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
elif n == 12:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 13:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 14:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
else:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(12, 14)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
return qc
''' |
QPC002_A5 | A8FBA9AB14E2A | 7 | AC | 2458 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)
if n <= 3:
for i in range(n - 1):
qc.cx(0, i + 1)
elif n <= 6:
half = n // 2
first = n - half - 1
for i in range(first):
qc.cx(0, i + 1)
for i in range(half):
qc.cx(1, i + 1 + first)
elif n == 7:
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
elif n == 8:
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
elif n == 8:
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
elif n == 9:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
elif n == 10:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
elif n == 11:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
elif n == 12:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 13:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
elif n == 14:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
else:
qc.cx(0, 8)
qc.cx(0, 4)
qc.cx(8, 12)
qc.cx(0, 2)
qc.cx(4, 6)
qc.cx(8, 10)
qc.cx(12, 14)
qc.cx(0, 1)
qc.cx(2, 3)
qc.cx(4, 5)
qc.cx(6, 7)
qc.cx(8, 9)
qc.cx(10, 11)
qc.cx(12, 13)
return qc
''' |
QPC002_A5 | A8FD270DBAB40 | 1 | AC | 2203 ms | 142 MiB | '''python
from qiskit import QuantumCircuit
def rec(i: int, l: int, qc: QuantumCircuit):
qc.cx(i, i+l//2)
if l//2>1:
rec(i, l//2, qc)
if l-l//2>1:
rec(i+l//2, l-l//2, qc)
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
rec(0, n, qc)
qc.cz(0, n-1)
return qc
''' |
QPC002_A5 | A93CF0F37008F | 1 | DLE | 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.cx(0,n-1)
if n%2 == 0:
for i in range(1, n//2):
qc.cx(0,i)
qc.cx(n-1,n-1-i)
else:
qc.cx(0,n//2)
for i in range(1, n//2):
qc.cx(0,i)
qc.cx(n-1,n-1-i)
qc.z(n-1)
return qc
''' |
QPC002_A5 | A93CF0F37008F | 2 | UGE | 1116 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.append(subsolve(n), range(n))
qc.z(n-1)
return qc
def subsolve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
if n == 1:
return qc
else:
qc.append(subsolve(n//2+n%2), range(n//2+n%2))
qc.append(subsolve(n//2), reversed(range(n//2+n%2,n)))
return qc
''' |
QPC002_A5 | A93CF0F37008F | 3 | WA | 1650 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.append(subsolve(n), range(n))
qc.z(n-1)
return qc.decompose()
def subsolve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
if n == 1:
return qc
else:
qc.append(subsolve(n//2+n%2), range(n//2+n%2))
qc.append(subsolve(n//2), reversed(range(n//2+n%2,n)))
return qc.decompose()
''' |
QPC002_A5 | A99E124B4D58B | 1 | AC | 1766 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
tmp = 0
lim = 1
for i in range(1,n):
qc.cx(tmp,i)
tmp += 1
if tmp == lim:
lim *= 2
tmp = 0
qc.z(0)
return qc
''' |
QPC002_A5 | A99E905975B3F | 1 | AC | 1758 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
for depth in range(4, -1, -1):
for i in range(0, n, 1<<(depth+1)):
if i+(1<<depth) < n:
qc.cx(i, i+(1<<depth))
qc.z(0)
return qc
''' |
QPC002_A5 | A9B4F159EEED2 | 1 | WA | 1146 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 b in range(1, 5):
for i in range(b):
if (1<<b)+i <= n-1:
qc.cx(i, (1<<b)+i)
return qc
''' |
QPC002_A5 | A9B4F159EEED2 | 2 | WA | 1192 ms | 141 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 b in range(5):
for i in range(b):
if (1<<b)+i <= n-1:
qc.cx(i, (1<<b)+i)
return qc
''' |
QPC002_A5 | A9B4F159EEED2 | 3 | AC | 2200 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)
for b in range(6):
for i in range((1<<b)):
if (1<<b)+i <= n-1:
qc.cx(i, (1<<b)+i)
return qc
''' |
QPC002_A5 | A9C40888967A6 | 1 | WA | 1184 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def construct_optimal_tree(n):
def build_tree(start, end):
if start > end:
return []
mid = (start + end) // 2
left_subtree = build_tree(start, mid - 1)
right_subtree = build_tree(mid + 1, end)
result = []
if mid - 1 >= start:
result.append((mid, (start + mid - 1) // 2))
if mid + 1 <= end:
result.append((mid, (mid + 1 + end) // 2))
return result + right_subtree + left_subtree
return build_tree(0, n - 1)
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
vals = construct_optimal_tree(n)
mid = vals[0][0]
qc.h(0)
qc.z(0)
for (i, j) in vals:
qc.cx(i, j)
return qc
''' |
QPC002_A5 | A9E43DBB56CB2 | 1 | AC | 1683 ms | 142 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 m in range(n):
for k in range(2 ** m):
if ((2 ** m) + k) >= n: break
qc.cx(k, 2 ** m + k)
return qc
''' |
QPC002_A5 | A9F29C570D5F3 | 1 | RE | 1042 ms | 148 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 | AA17A5CD51E02 | 1 | WA | 1161 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# Apply Hadamard gate to each qubit
for qubit in range(n):
qc.h(qubit)
# Apply a Z gate to the last qubit
qc.z(n-1)
# We need to add a global phase of π to get the correct sign
# This can be achieved by using a multi-qubit controlled-Z gate
qc.cz(0, n-1) #
return qc
''' |
QPC002_A5 | AA17A5CD51E02 | 2 | AC | 1984 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 | AA3A2B37FE6CB | 1 | AC | 1678 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
def cnot_(sta, end):
if sta >= end - 1:
return
mid = (sta + end) // 2
qc.cx(sta, mid)
cnot_(sta, mid)
cnot_(mid, end)
cnot_(0, n)
qc.z(0)
return qc
solve(15)
''' |
QPC002_A5 | AA5403CC3F5E2 | 1 | WA | 1934 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
half = (n+1)//2
qc.h(0)
qc.cx(0, 1)
for i in range(2, half):
if i % 2 == 0:
qc.cx(0, i)
else:
qc.cx(1, i)
for j in range(half, n):
qc.cx(j - half, j)
qc.z(0)
return qc
''' |
QPC002_A5 | AA5403CC3F5E2 | 2 | WA | 1966 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
half = (n+1)//2
qc.h(0)
qc.cx(0, 1)
for i in range(2, half):
if i % 2 == 0:
qc.cx(0, i)
else:
qc.cx(1, i)
for j in range(half, n):
qc.cx(j - half, j)
qc.z(0)
return qc
''' |
QPC002_A5 | AA5403CC3F5E2 | 3 | DLE | 1912 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
half = (n+1)//2
qc.h(0)
for i in range(1, n):
val = int(math.log2(i) + 1)
qc.cx(i-val, i)
qc.z(0)
return qc
''' |
QPC002_A5 | AA5403CC3F5E2 | 4 | DLE | 1820 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
half = (n+1)//2
qc.h(0)
for i in range(1, n):
val = int(math.log2(i)) + 1
qc.cx(i-val, i)
qc.z(0)
return qc
''' |
QPC002_A5 | AA5403CC3F5E2 | 5 | WA | 1775 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
half = (n+1)//2
qc.h(0)
for i in range(1, n):
val = int(math.log2(i))
val = 2 ** val
qc.z(0)
return qc
''' |
QPC002_A5 | AA5403CC3F5E2 | 6 | AC | 2167 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
half = (n+1)//2
qc.h(0)
for i in range(1, n):
val = int(math.log2(i))
val = 2 ** val
qc.cx(i-val, i)
qc.z(0)
return qc
''' |
QPC002_A5 | AA5E44ECB7F91 | 1 | RE | 1848 ms | 162 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)
qc.cx(0,2)
for i in range(3,n-1,3):
qc.cx(0,i)
qc.cx(1,i+1)
qc.cx(2,i+2)
if n%3==1:
qc.cx(0,n-1)
elif n%3==2:
qc.cx(0,n-1)
qc.cx(1,n-2)
qc.z(0)
return qc
''' |
QPC002_A5 | AA5E44ECB7F91 | 2 | WA | 1897 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)
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.cx(0,1)
qc.z(0)
return qc
''' |
QPC002_A5 | AA5E44ECB7F91 | 3 | AC | 1942 ms | 163 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 | AAC83A4DC9542 | 1 | AC | 2780 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)
for i in range(2, min(4, n)):
qc.cx(i - 2, i)
for i in range(4, min(8, n)):
qc.cx(i - 4, i)
for i in range(8, n):
qc.cx(i - 8, i)
qc.z(0)
return qc
''' |
QPC002_A5 | AAF6CB6C243E0 | 1 | WA | 1520 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0, 1)
old_entangled = [0, 1]
new_entangled = [i for i in old_entangled]
remaining = list(range(2, n))
while len(remaining) != 0:
for i in old_entangled:
tbe = remaining[-1]
qc.cx(i, tbe)
new_entangled.append(tbe)
remaining.pop()
if len(remaining) == 0:
break
old_entangled = [i for i in new_entangled]
return qc
''' |
QPC002_A5 | AAF6CB6C243E0 | 2 | AC | 2135 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0, 1)
old_entangled = [0, 1]
new_entangled = [i for i in old_entangled]
remaining = list(range(2, n))
while len(remaining) != 0:
for i in old_entangled:
tbe = remaining[-1]
qc.cx(i, tbe)
new_entangled.append(tbe)
remaining.pop()
if len(remaining) == 0:
break
old_entangled = [i for i in new_entangled]
qc.z(0)
return qc
''' |
QPC002_A5 | AB21B5C096AED | 1 | RE | 2144 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(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 | AB21B5C096AED | 2 | 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(math.ceil(math.log2(n))):
for j in range(2**i):
if 2**i + j == n:
break
qc.cx(j, 2**i + )
qc.z(0)
return qc
''' | ||
QPC002_A5 | AB21B5C096AED | 3 | AC | 3000 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)
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 | AB43FA1651163 | 1 | WA | 1231 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)
if n%2 != 0:
e = n-1
o = n
else:
e = n
o = n-1
for i in range(0, e, 2):
qc.cx(i, i+1)
for i in range(1, o, 2):
qc.cx(i, i+1)
return qc
''' |
QPC002_A5 | AB43FA1651163 | 2 | WA | 1273 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)
if n%2 != 0:
e = n-1
o = n
else:
e = n
o = n-1
for i in range(0, e, 2):
qc.cx(i, i+1)
for i in range(1, o, 2):
qc.cx(i, i+1)
return qc
''' |
QPC002_A5 | AB43FA1651163 | 3 | RE | 1638 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(n):
qc.h(i, i+1)
if n%2 != 0:
e = n-1
o = n
else:
e = n
o = n-1
for i in range(0, e, 2):
qc.cx(i, i+1)
for i in range(1, o, 2):
qc.cx(i, i+1)
return qc
''' |
QPC002_A5 | AB43FA1651163 | 4 | WA | 1141 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(n):
qc.h(i)
if n%2 != 0:
e = n-1
o = n
else:
e = n
o = n-1
for i in range(0, e, 2):
qc.cx(i, i+1)
for i in range(1, o, 2):
qc.cx(i, i+1)
return qc
''' |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.