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_A4 | AA7A4A17C432A | 3 | DLE | 1878 ms | 161 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)
else:
qc.cx(1,i+2)
qc.z(1)
return qc
''' |
QPC002_A4 | AA7A4A17C432A | 4 | AC | 2277 ms | 160 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_A4 | AA98FC6D67D30 | 1 | DLE | 1724 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):
qc.cx(0, i)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | AA98FC6D67D30 | 2 | RE | 1961 ms | 157 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(1, n / 2):
qc.ccx(0, i, i + 1)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | AA98FC6D67D30 | 3 | RE | 1731 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 / 2, 2):
qc.ccx(0, i, i + 1)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | AA98FC6D67D30 | 4 | RE | 1929 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 / 2 - 1, 2):
qc.ccx(0, i, i + 1)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | AA98FC6D67D30 | 5 | RE | 1875 ms | 161 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(1, n, 2):
qc.ccx(0, i, i + 1)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | AA98FC6D67D30 | 6 | DLE | 1858 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):
qc.cx(i, i + 1)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | AA98FC6D67D30 | 7 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.(0, n - 1)
if n % 2 == 0:
for i in range(1, n / 2):
qc.cx(0, i)
for i in range(n - 1, n / 2):
qc.cx(n - 1, i)
else:
for i in range(1, n / 2):
qc.cx(0, i)
for i in range(n - 1, n / 2 - 1):
qc.cx(n - 1, i)
qc.z(n - 1)
return qc
''' | ||
QPC002_A4 | AA98FC6D67D30 | 8 | RE | 1682 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0, n - 1)
if n % 2 == 0:
for i in range(1, n // 2):
qc.cx(0, i)
for i in range(n - 1, n // 2, -1):
qc.cx(n - 1, i)
else:
for i in range(1, n // 2):
qc.cx(0, i)
for i in range(n - 1, n // 2 - 1, -1):
qc.cx(n - 1, i)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | AA98FC6D67D30 | 9 | RE | 1727 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0, n - 1)
if n % 2 == 0:
for i in range(1, n // 2):
qc.cx(0, i)
for i in range(n - 1, n // 2, -1):
qc.cx(n - 1, i)
else:
for i in range(1, n // 2):
qc.cx(0, i)
for i in range(n - 1, n // 2 - 1, -1):
qc.cx(n - 1, i)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | AA98FC6D67D30 | 10 | WA | 2063 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.cx(0, n - 1)
if n % 2 == 0:
for i in range(1, n // 2):
qc.cx(0, i)
for i in range(n - 2, n // 2, -1):
qc.cx(n - 1, i)
else:
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_A4 | AA98FC6D67D30 | 11 | WA | 1839 ms | 159 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):
qc.cx(n - 1, i)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | AA98FC6D67D30 | 12 | AC | 2110 ms | 161 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_A4 | AA9D851E23030 | 1 | AC | 2044 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_A4 | AAA9ECEDC47BE | 1 | AC | 2057 ms | 143 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_A4 | AAC2034AD661D | 1 | DLE | 1809 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(n-1):
qc.cx(i, i+1)
qc.z(0)
return qc
''' |
QPC002_A4 | AAC2034AD661D | 2 | WA | 2055 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(2, n-1, 2):
qc.cx(0, i)
qc.cx(1, i+1)
if n % 2 != 0:
qc.cx(0, n-1)
qc.z(0)
return qc
''' |
QPC002_A4 | AAC2034AD661D | 3 | AC | 2330 ms | 161 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, n-1, 2):
qc.cx(0, i)
qc.cx(1, i+1)
if n % 2 != 0:
qc.cx(0, n-1)
qc.z(0)
return qc
''' |
QPC002_A4 | AAD50D90148A3 | 1 | WA | 3000 ms | 159 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(2, n - 1, 2):
qc.cx(0, i)
qc.cx(1, i + 1)
if n % 2 != 0:
qc.cx(0, n - 1)
qc.z(0)
return qc
''' |
QPC002_A4 | AAD50D90148A3 | 2 | AC | 3000 ms | 160 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, n - 1, 2):
qc.cx(0, i)
qc.cx(1, i + 1)
if n % 2 != 0:
qc.cx(0, n - 1)
qc.z(0)
return qc
''' |
QPC002_A4 | AAD81E9884573 | 1 | WA | 1846 ms | 143 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//2):
qc.cswap(0, 2*i, 2*i+1)
if n % 2 == 1:
qc.cx(0,n-1)
qc.z(0)
return qc
''' |
QPC002_A4 | AAD81E9884573 | 2 | WA | 1111 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//2):
qc.cswap(0, 2*i-1, 2*i)
if n % 2 == 0:
qc.cx(0,n-1)
qc.z(0)
return qc
''' |
QPC002_A4 | AAD81E9884573 | 3 | RE | 1456 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(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_A4 | AAD81E9884573 | 4 | AC | 2016 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 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_A4 | AAD8A73417A2C | 1 | DLE | 1431 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, 1):
if i!=0:
qc.cx(0,i)
qc.z(0)
return qc
''' |
QPC002_A4 | AAD8A73417A2C | 2 | AC | 1772 ms | 153 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,n-1,2):
qc.cx(0,i)
qc.cx(i,i+1)
if n%2!=0:
qc.cx(0,n-1)
qc.z(0)
return qc
''' |
QPC002_A4 | AAD92D87A7E78 | 1 | DLE | 1349 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(n-1):
qc.cx(i,i+1)
qc.z(n-1)
return qc
''' |
QPC002_A4 | AAD92D87A7E78 | 2 | DLE | 1126 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(n-1):
qc.cx(i,i+1)
if n>1:
qc.z(n-1)
return qc
''' |
QPC002_A4 | AAD92D87A7E78 | 3 | DLE | 1266 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n>10:
n = 10
qc.h(0)
for i in range(n-1):
qc.cx(i,i+1)
qc.z(n-1)
return qc
''' |
QPC002_A4 | AAD92D87A7E78 | 4 | WA | 1166 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n>9:
n = 9
qc.h(0)
for i in range(n-1):
qc.cx(i,i+1)
qc.z(n-1)
return qc
''' |
QPC002_A4 | AAD92D87A7E78 | 5 | WA | 1084 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n>10:
n1=10
else:
n1 = n
# Apply CNOT gates to create entanglement
for i in range(n1-1):
qc.cx(i, i + 1)
if qc.depth()<10:
qc.z(n-1)
return qc
''' |
QPC002_A4 | AAE3537E7A4DE | 1 | DLE | 1204 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(1, n):
qc.cx(0, i)
return qc
''' |
QPC002_A4 | AAE3537E7A4DE | 2 | AC | 2139 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_A4 | AB00E195C2A0C | 1 | DLE | 1258 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(0, n-1):
qc.cx(i, i+1)
return qc
''' |
QPC002_A4 | AB00E195C2A0C | 2 | RE | 1178 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(0, n, 2):
qc.cx(i, i+1)
for i in range(1, n, 2):
qc.cx(i, i+1)
return qc
''' |
QPC002_A4 | AB00E195C2A0C | 3 | RE | 1094 ms | 141 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(0, n, 2):
qc.cx(i, i+1)
for i in range(1, n-1, 2):
qc.cx(i, i+1)
return qc
''' |
QPC002_A4 | AB00E195C2A0C | 4 | RE | 1376 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(0, n, 2):
qc.cx(i, i+1)
for i in range(1, n-1, 2):
qc.cx(i, i+1)
return qc
''' |
QPC002_A4 | AB00E195C2A0C | 5 | WA | 1224 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(0, n-1, 2):
qc.cx(i, i+1)
for i in range(1, n-1, 2):
qc.cx(i, i+1)
return qc
''' |
QPC002_A4 | AB00E195C2A0C | 6 | WA | 1596 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(0, n-1, 2):
qc.cx(i, i+1)
for i in range(1, n-2, 2):
qc.cx(i, i+1)
return qc
''' |
QPC002_A4 | AB00E195C2A0C | 7 | WA | 1104 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, 0, 2):
qc.cx(i, i+1)
return qc
''' |
QPC002_A4 | AB00E195C2A0C | 8 | WA | 1263 ms | 141 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_A4 | AB11E5B8D1CA9 | 1 | RE | 1194 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(0,i)
qc.z()
return qc
''' |
QPC002_A4 | AB11E5B8D1CA9 | 2 | DLE | 1443 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-1,i)
qc.z(0)
return qc
''' |
QPC002_A4 | AB11E5B8D1CA9 | 3 | RE | 1209 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
tgt = 1
p == 0
while tgt < n:
for i in range(2**p):
qc.cx(i,tgt)
tgt += 1
p += 1
qc.z(0)
return qc
''' |
QPC002_A4 | AB11E5B8D1CA9 | 4 | RE | 1397 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
tgt = 1
p = 0
while tgt < n:
for i in range(2**p):
qc.cx(i,tgt)
tgt += 1
p += 1
qc.z(0)
return qc
''' |
QPC002_A4 | AB11E5B8D1CA9 | 5 | WA | 1083 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
tgt = 1
p = 0
for i in range(2**p):
if tgt < n:
qc.cx(i,tgt)
tgt += 1
else:
break
p += 1
qc.z(0)
return qc
''' |
QPC002_A4 | AB11E5B8D1CA9 | 6 | RE | 1110 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
tgt = 1
for p in range(math.floor(math.log2(n))):
for i in range(0, n, 2**p):
if tgt < n:
qc.cx(i,tgt)
tgt += 1
else:
break
qc.z(0)
return qc
''' |
QPC002_A4 | AB11E5B8D1CA9 | 7 | RE | 1028 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
tgt = 1
for p in range(math.floor(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_A4 | AB11E5B8D1CA9 | 8 | RE | 1090 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
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_A4 | AB11E5B8D1CA9 | 9 | AC | 2119 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_A4 | AB16FD1D4696D | 1 | DLE | 1170 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(0, n-1):
qc.cx(i, i+1)
qc.z(0)
return qc
''' |
QPC002_A4 | AB16FD1D4696D | 2 | WA | 1265 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
qc.mcx(list(range(1, n)), 0)
qc.z(0)
return qc
''' |
QPC002_A4 | AB16FD1D4696D | 3 | AC | 2151 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_A4 | AB368A3046CDE | 1 | DLE | 1090 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(0, i)
qc.z(0)
return qc
''' |
QPC002_A4 | AB368A3046CDE | 2 | DLE | 1065 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(1, n):
qc.cx(0, i)
qc.z(0)
return qc
''' |
QPC002_A4 | AB368A3046CDE | 3 | DLE | 1112 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(1, n):
qc.cx(0, i)
qc.z(0)
return qc
''' |
QPC002_A4 | AB587F9C2315C | 1 | WA | 1850 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
idx = 1 # 次に設定するやつ
for i in range(0,idx):
# 設定済みのところから
if idx+i==n:
break
qc.cx(i, idx+i)
qc.z(0)
return qc
''' |
QPC002_A4 | AB587F9C2315C | 2 | AC | 2210 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(0)
idx = 1 # 次に設定するやつ
while idx<n:
for i in range(0,idx):
# 設定済みのところから
if idx+i==n:
break
qc.cx(i, idx+i)
idx *= 2
qc.z(0)
return qc
''' |
QPC002_A4 | AB71D270E124B | 1 | AC | 2321 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_A4 | AB8B725668B06 | 1 | DLE | 1728 ms | 163 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(i, i+1)
return qc
''' |
QPC002_A4 | ABF8E56341D49 | 1 | RE | 1179 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for qubit in range(n):
qc.h(qubit)
qc.z(n - 1)
qc.measure_all()
return qc
''' |
QPC002_A4 | ABF8E56341D49 | 2 | WA | 1109 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for qubit in range(n):
qc.h(qubit)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | ABF8E56341D49 | 3 | WA | 1183 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for qubit in range(n):
qc.h(qubit)
qc.z(n - 1)
qc.barrier()
for qubit in range(n):
qc.h(qubit)
return qc
''' |
QPC002_A4 | ABF8E56341D49 | 4 | WA | 1148 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(range(n))
qc.h(0)
qc.x(range(n))
qc.z(0)
return qc
''' |
QPC002_A4 | ABF8E56341D49 | 5 | WA | 1518 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for qubit in range(n):
qc.h(qubit)
qc.z(n - 1)
return qc
''' |
QPC002_A4 | ABF8E56341D49 | 6 | WA | 1096 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(range(n))
for i in range(n // 2):
qc.cx(i, n - i - 1)
return qc
''' |
QPC002_A4 | ABF8E56341D49 | 7 | WA | 1716 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.h(range(n))
for i in range(n - 1):
qc.cx(i, i + 1)
return qc
''' |
QPC002_A4 | ABF8E56341D49 | 8 | DLE | 1130 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(0, i)
qc.z(0)
return qc
''' |
QPC002_A4 | ABF8E56341D49 | 9 | RE | 1562 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
theta = np.pi / 2
phi = 0
lambda_ = 0
for i in range(n):
qc.u(theta, phi, lambda_, i)
return qc
''' |
QPC002_A4 | ABF8E56341D49 | 10 | WA | 1398 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
import numpy as np
theta = np.pi / 2
phi = 0
lambda_ = 0
for i in range(n):
qc.u(theta, phi, lambda_, i)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 1 | WA | 1289 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# Step 1: Apply Hadamard gate to all qubits
for i in range(n):
qc.h(i)
# Step 2: Apply X gates to all qubits
for i in range(n):
qc.x(i)
# Step 3: Apply multi-controlled Z gate
qc.h(0)
qc.mcx(list(range(1, n)), 0) # Multi-controlled X (also called CCX or Toffoli gates)
qc.h(0)
# Step 4: Undo the X gates
for i in range(n):
qc.x(i)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 2 | DLE | 1058 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# Step 1: Apply Hadamard gate to the first qubit
qc.h(0)
# Step 2: Apply CNOT gates from the first qubit to all other qubits
for i in range(1, n):
qc.cx(0, i)
# Step 3: Apply Z gate to the first qubit to flip the sign of the |1...1> state
qc.z(0)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 3 | WA | 1099 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# Step 1: Apply Hadamard gates to all qubits
for i in range(n):
qc.h(i)
# Step 2: Apply a multi-controlled Z gate (this can be achieved with an H-CX-H sandwich)
qc.h(n-1) # Apply H to the last qubit
qc.mcx(list(range(n-1)), n-1) # Apply multi-controlled X gate to the last qubit
qc.h(n-1) # Apply H again to convert to a Z gate
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 4 | WA | 1309 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 X gates to all qubits except the first
for i in range(1, n):
qc.x(i)
# Step 3: Apply a controlled-Z gate with the first qubit as control
qc.cz(0, 1)
# Step 4: Undo the X gates
for i in range(1, n):
qc.x(i)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 5 | WA | 1114 ms | 139 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply Hadamard gate to the first qubit
qc.h(0)
# Apply X (NOT) gate to all qubits except the first
for i in range(1, n):
qc.x(i)
# Apply controlled-Z gate with the first qubit as control and all others as target
qc.cz(0, n-1)
# Apply X (NOT) gate again to all qubits except the first
for i in range(1, n):
qc.x(i)
# Apply Hadamard gate to the first qubit again
qc.h(0)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 6 | RE | 1411 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply Hadamard gate to create the superposition state
qc.h(0)
# Apply a phase flip to the last qubit to create the -1 factor
if n > 1:
qc.x(n-1)
qc.h(n-1)
qc.mct(list(range(n-1)), n-1)
qc.h(n-1)
qc.x(n-1)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 7 | RE | 1112 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply Hadamard gate to all qubits to create superposition
for qubit in range(n):
qc.h(qubit)
# Apply a phase flip to create the -1 factor
qc.x(n-1)
qc.h(n-1)
qc.mct(list(range(n-1)), n-1) # Multi-controlled Toffoli (CCNOT) gate
qc.h(n-1)
qc.x(n-1)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 8 | WA | 1169 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# Apply Hadamard gates to all qubits
qc.h(range(n))
# Apply a controlled Z gate on the last qubit conditioned on the first three qubits being in state |111>
qc.mcx(list(range(n-1)), n-1)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 9 | DLE | 1046 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# Apply Hadamard gate to the first qubit
qc.h(0)
# Apply CNOT gates to entangle the first qubit with the others
for i in range(1, n):
qc.cx(0, i)
# Apply Z gate to the first qubit to introduce the phase flip
qc.z(0)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 10 | RE | 1178 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply Hadamard gates to all qubits
qc.h(range(n))
# Apply a multi-controlled Z gate on all qubits to flip the phase of the |1111> state
qc.append(MCXGate(n-1), list(range(n-1)) + [n-1])
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 11 | DLE | 1153 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply Hadamard gate to the first qubit
qc.h(0)
# Apply CNOT gates to all other qubits
for qubit in range(1, n):
qc.cx(0, qubit)
# Apply a Z gate to introduce the phase flip
qc.z(0)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 12 | WA | 1095 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply Hadamard gate to each qubit
for qubit in range(n):
qc.h(qubit)
# Apply CNOT gates to create the required superposition
for qubit in range(n-1):
qc.cx(qubit, qubit + 1)
# Apply a Z gate to flip the phase of the final state
qc.z(n-1)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 13 | WA | 1242 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 X gates to all qubits
for i in range(n):
qc.x(i)
# Step 3: Apply multi-controlled Z gate using controlled-X (CNOT) gates
qc.h(n-1)
for i in range(n-1):
qc.cx(i, n-1)
qc.h(n-1)
# Step 4: Apply X gates again to all qubits
for i in range(n):
qc.x(i)
return qc
''' |
QPC002_A4 | ABFFD59BA1332 | 14 | AC | 2151 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, n - 1, 2):
qc.cx(0, i)
qc.cx(1, i + 1)
if n % 2 != 0:
qc.cx(0, n - 1)
qc.z(0)
return qc
''' |
QPC002_A4 | AC16553C21030 | 1 | WA | 1501 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.h(i)
for i in range(n):
for j in range(i+1,n):
qc.cz(i,j)
return qc
''' |
QPC002_A4 | AC1EA669B6393 | 1 | DLE | 1543 ms | 140 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.z(0)
for i in range(n-1):
i+=1
qc.cx(0,i)
return qc
''' |
QPC002_A4 | AC24F6DA44F7F | 1 | AC | 1967 ms | 143 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_A4 | AC4061F48D6A8 | 1 | RE | 1307 ms | 141 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)
for i in range((n-2)/2):
qc.cx(0, 2+i)
for i in range((n-2)/2):
qc.cx(1, 2+(n-2)/2+i)
if ((n-2)%2 == 1):
qc.cx(1, n-1)
return qc
''' |
QPC002_A4 | AC4061F48D6A8 | 2 | RE | 1099 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)
qc.cx(0, 1)
for i in range((n-2)/2):
qc.cx(0, 2+i)
for i in range((n-2)/2):
qc.cx(1, 2+(n-2)/2+i)
if ((n-2)%2 == 1):
qc.cx(1, n-1)
return qc
''' |
QPC002_A4 | AC4061F48D6A8 | 3 | AC | 2051 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)
qc.cx(0, 1)
for i in range(int((n-2)/2)):
qc.cx(0, 2+i)
for i in range(int((n-2)/2)):
qc.cx(1, 2+int((n-2)/2)+i)
if ((n-2)%2 == 1):
qc.cx(1, n-1)
return qc
''' |
QPC002_A4 | AC44C1006634B | 1 | DLE | 1160 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
# Step 2: Apply CNOT gates to entangle all qubits
for i in range(1, n):
qc.cx(0, i)
# Step 3: Apply Z gate to the first qubit to introduce the phase
qc.z(0)
# Write your code here:
return qc
''' |
QPC002_A4 | AC44C1006634B | 2 | DLE | 1687 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
# Step 2: Apply CNOT gates to entangle all qubits
for i in range(1, n):
qc.cx(0, i)
qc.x(range(n))
# Step 3: Apply Z gate to the first qubit to introduce the phase
qc.z(0)
# Write your code here:
return qc
''' |
QPC002_A4 | AC44C1006634B | 3 | WA | 1145 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
qc.mcx(list(range(n-1)), n-1)
qc.z(0)
# Write your code here:
return qc
''' |
QPC002_A4 | AC44C1006634B | 4 | WA | 1413 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 multi-controlled X gate
qc.mcx(list(range(n-1)), n-1)
# Step 3: Apply Z gate to the first qubit to introduce the phase
qc.z(0)
# Write your code here:
return qc
''' |
QPC002_A4 | AC44C1006634B | 5 | WA | 1176 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
for i in range(n):
qc.h(i)
# Step 2: Apply a multi-controlled Z gate to flip the phase of |1...1⟩
if n > 1:
qc.mcx(list(range(n-1)), n-1) # Apply X gate controlled by all but the last qubit
qc.z(n-1) # Apply Z gate to the last qubit (which is flipped by MCX)
qc.mcx(list(range(n-1)), n-1)
# Write your code here:
return qc
''' |
QPC002_A4 | AC44C1006634B | 6 | RE | 1099 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
# Apply Hadamard gates to all qubits
for i in range(n):
qc.h(i)
# Apply a phase shift to all qubits
for i in range(n):
qc.u1(math.pi, i)
# Apply Hadamard gates to all qubits again
for i in range(n):
qc.h(i)
return qc
''' |
QPC002_A4 | AC44C1006634B | 7 | RE | 1093 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Step 1: Apply Hadamard gate to the first qubit
# Apply Hadamard gates to all qubits
for i in range(n):
qc.h(i)
# Apply a phase shift to all qubits
for i in range(n):
qc.u1(math.pi, i)
# Apply Hadamard gates to all qubits again
for i in range(n):
qc.h(i)
return qc
''' |
QPC002_A4 | AC44C1006634B | 8 | DLE | 1629 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(1, n):
qc.cx(0, i)
qc.z(0)
return qc
''' |
QPC002_A4 | AC44C1006634B | 9 | DLE | 1083 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.h(0)
for i in range(1, min(n, 10)): # Limit number of CNOT gates to avoid depth issues
qc.cx(0, i)
qc.z(0)
return qc
''' |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.