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_B4 | A8BD8CA411C31 | 1 | RE | 1095 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for j in range(n):
# Apply the Hadamard gate
qc.h(j)
# Apply the controlled phase rotation gates
for k in range(j + 1, n):
qc.cp(np.pi / 2**(k - j), k, j)
# Swap qubits to reverse their order
for i in range(n // 2):
qc.cx(i, n - i - 1)
qc.cx(n - i - 1, i)
qc.cx(i, n - i - 1)
return qc
''' |
QPC002_B4 | A8DAF91B4C7FF | 1 | WA | 2046 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
for j in range(i):
angle = math.pi / (2**(i - j))
qc.cp(angle, j, i)
for i in range(n//2):
qc.swap(i, n - 1 - i)
return qc
''' |
QPC002_B4 | A8DAF91B4C7FF | 2 | WA | 1962 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
for j in range(i):
angle = math.pi / (2**(i - j))
qc.cp(angle, j, i)
return qc
''' |
QPC002_B4 | A8DAF91B4C7FF | 3 | AC | 2109 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in reversed(range(n)):
qc.h(i)
for j in reversed(range(i)):
angle = math.pi / (2**(i - j))
qc.cp(angle, j, i)
for i in range(n//2):
qc.swap(i, n - 1 - i)
return qc
''' |
QPC002_B4 | A9649448D119E | 1 | DLE | 1743 ms | 153 MiB | '''python
from qiskit import QuantumCircuit
import math
# from qiskit.quantum_info import Statevector
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# qc.initialize([0,1,0,0])
# Write your code here:
for i in range(n-1, -1, -1):
qc.h(i)
for j in range(0, i):
qc.cp(2*math.pi/(2**(i-j+1)), j, i)
i = 0
while i<n-i-1:
qc.swap(i, n-i-1)
i += 1
return qc
# if __name__ == "__main__":
# qc = solve(2)
# print(Statevector(qc))
''' |
QPC002_B4 | A9649448D119E | 2 | AC | 1780 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
import math
# from qiskit.quantum_info import Statevector
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# qc.initialize([0,1,0,0])
# Write your code here:
for i in range(n-1, -1, -1):
qc.h(i)
for j in range(i-1, -1, -1):
qc.cp(2*math.pi/(2**(i-j+1)), j, i)
# print(qc.depth())
i = 0
while i<n-i-1:
qc.swap(i, n-i-1)
i += 1
return qc
# if __name__ == "__main__":
# qc = solve(2)
# print(Statevector(qc))
''' |
QPC002_B4 | A97CA62BC09EE | 1 | RE | 1006 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.cx(i, n-i)
qc.cx(n-i, i)
qc.cx(i, n-i)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 2 | RE | 1167 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1):
# qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.cx(i, n-i)
qc.cx(n-i, i)
qc.cx(i, n-i)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 3 | RE | 1151 ms | 139 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
# for i in range(n // 2):
# qc.cx(i, n-i)
# qc.cx(n-i, i)
# qc.cx(i, n-i)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 4 | RE | 1184 ms | 139 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.cx(i, n-i)
qc.cx(n-i, i)
qc.cx(i, n-i)
else:
qc.h(i)
qc.p(2 * math.pi / 2)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 5 | RE | 1381 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
# qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.cx(i, n-i)
qc.cx(n-i, i)
qc.cx(i, n-i)
else:
# qc.h(i)
qc.p(2 * math.pi / 2,)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 6 | RE | 1055 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.p(2 * math.pi / 2,)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 7 | RE | 1184 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n--i)
else:
qc.p(2 * math.pi / 2)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 8 | RE | 1079 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n--i)
else:
qc.h(0)
qc.p(2 * math.pi / 2)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 9 | RE | 1088 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
qc.p(2 * math.pi / 2)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 10 | RE | 1136 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
# for i in range(n // 2):
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
qc.p(2 * math.pi / 2)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 11 | RE | 1052 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
qc.p(2 * math.pi / 2)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 12 | RE | 1045 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, i, j)
k += 1
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
qc.p(2 * math.pi / 2)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 13 | RE | 1154 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(n)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
qc.p(2 * math.pi / 2)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 14 | RE | 1073 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(n-1)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
qc.p(2 * math.pi / 2)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 15 | RE | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
# qc.cp(theta, j, i)
k += 1
qc.h(n-)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
qc.p(2 * math.pi / 2)
return qc
''' | ||
QPC002_B4 | A97CA62BC09EE | 16 | RE | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(n-)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' | ||
QPC002_B4 | A97CA62BC09EE | 17 | RE | 1474 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(n-1)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 18 | RE | 1374 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(n-1)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 19 | RE | 1034 ms | 139 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(n-1)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 20 | WA | 1084 ms | 144 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, 1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 21 | WA | 1513 ms | 183 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, 1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
# for i in range(n // 2):
# # qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 22 | RE | 1111 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,-1,-1):
qc.h(i)
k = 2
for j in range(i-1, 1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
# for i in range(n // 2):
# # qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 23 | RE | 1195 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,-1,-1):
qc.h(i)
k = 2
for j in range(i-1, 0, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
# for i in range(n // 2):
# # qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 24 | RE | 1276 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0,-1):
qc.h(i)
k = 2
for j in range(i-1, -1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
# for i in range(n // 2):
# # qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 25 | RE | 1141 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0,-1):
qc.h(i)
k = 2
for j in range(i-1, -1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 26 | WA | 1057 ms | 142 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 27 | WA | 1168 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
# for i in range(n // 2):
# qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 28 | WA | 1155 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
# for i in range(n // 2):
# qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 29 | RE | 1172 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(0, n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
# for i in range(n // 2):
# qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 30 | RE | 1090 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(0, n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(n-1)
# for i in range(n // 2):
# qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 31 | RE | 1073 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(0, n-1):
qc.h(i)
k = 2
for j in range(i+1, n):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(n-1)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 32 | WA | 1144 ms | 154 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 33 | WA | 1459 ms | 144 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 34 | RE | 1038 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
for i in range(n):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 35 | WA | 1506 ms | 182 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 36 | RE | 1053 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0,-1):
qc.h(i)
k = 2
for j in range(i-1, -1,-1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 37 | RE | 1138 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0,-1):
qc.h(i)
k = 2
for j in range(i-1, -1,-1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 38 | RE | 1382 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
# for i in range(n-1,0):
for i in range(n-1):
ii = n-1-i
qc.h(i)
k = 2
# for j in range(i-1, -1):
for j in range(ii):
jj = n-2-j
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, jj, ii)
k += 1
qc.h(0)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 39 | RE | 1188 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
# for i in range(n-1,0):
for i in range(n-1):
ii = n-1-i
qc.h(ii)
k = 2
# for j in range(i-1, -1):
for j in range(ii):
jj = n-2-j
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, jj, ii)
k += 1
qc.h(0)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 40 | RE | 1286 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
# for i in range(n-1,0):
for i in range(n-1):
ii = n-1-i
qc.h(ii)
k = 2
# for j in range(i-1, -1):
for j in range(ii):
jj = ii-1-j
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, jj, ii)
k += 1
qc.h(0)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 41 | RE | 1240 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
# for i in range(n-1,0):
for i in range(n-1):
ii = n-1-i
qc.h(ii)
k = 2
# for j in range(i-1, -1):
for j in range(ii):
jj = ii-1-j
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, jj, ii)
k += 1
qc.h(0)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 42 | WA | 1162 ms | 153 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
for i in range(n // 2):
# qc.swap(i, n-1-i)
qc.cx(i, n-1-i)
qc.cx(n-1-i, i)
qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 43 | WA | 1084 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
# for i in range(n // 2):
# # qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 44 | RE | 1115 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0,-1):
qc.h(i)
k = 2
for j in range(i-1, -1,-1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
qc.h(0)
# for i in range(n // 2):
# # qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 45 | WA | 1087 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
# for j in range(i-1, -1):
j = i -1
while j >= 0:
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
j -= 1
qc.h(0)
# for i in range(n // 2):
# # qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 46 | RE | 1079 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
# for i in range(n-1,0):
i = n - 1
while i >= 1:
qc.h(i)
k = 2
# for j in range(i-1, -1):
j = i - 1
while j >= 0:
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
j -= 1
qc.h(0)
# for i in range(n // 2):
# # qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 47 | RE | 1269 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
# for i in range(n-1,0):
i = n - 1
while i >= 1:
qc.h(i)
k = 2
# for j in range(i-1, -1):
j = i - 1
while j >= 0:
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
j -= 1
i -= 1
qc.h(0)
# for i in range(n // 2):
# # qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 48 | RE | 1064 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
# for i in range(n-1,0):
i = n - 1
while i >= 1:
qc.h(i)
k = 2
# for j in range(i-1, -1):
j = i - 1
while j >= 0:
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
j -= 1
i -= 1
qc.h(0)
# for i in range(n // 2):
# # qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 49 | RE | 1054 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
# for i in range(n-1,0):
i = n - 1
while i >= 1:
qc.h(i)
k = 2
# for j in range(i-1, -1):
j = i - 1
while j >= 0:
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
j -= 1
i -= 1
qc.h(0)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 50 | RE | 1195 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
# for i in range(n-1,0):
i = n - 1
while i > 0:
qc.h(i)
k = 2
# for j in range(i-1, -1):
j = i - 1
while j >= 0:
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
j -= 1
i -= 1
qc.h(0)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 51 | RE | 1320 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
# for i in range(n-1,0):
i = n - 1
while i > 0:
qc.h(i)
k = 2
# for j in range(i-1, -1):
j = i - 1
while j >= 0:
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
j -= 1
i = i - 1
qc.h(0)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 52 | WA | 1126 ms | 144 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
# for j in range(i-1, -1):
j = i - 1
while j >= 0:
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
j -= 1
qc.h(0)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 53 | WA | 1235 ms | 153 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,0):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
j -= 1
qc.h(0)
for i in range(n // 2):
qc.swap(i, n-1-i)
# qc.cx(i, n-1-i)
# qc.cx(n-1-i, i)
# qc.cx(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 54 | WA | 1039 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,-1):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
j -= 1
for i in range(n // 2):
qc.swap(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 55 | WA | 1481 ms | 153 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if n > 1:
for i in range(n-1,-1):
qc.h(i)
k = 2
for j in range(i-1, -1):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.swap(i, n-1-i)
else:
qc.h(0)
return qc
''' |
QPC002_B4 | A97CA62BC09EE | 56 | RE | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1, -1, -1):
qc.h(i)
k = 2
for j in range(i-1, -1, -):
theta = 2 * math.pi / 2 ^ k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.swap(i, n-1-i)
return qc
''' | ||
QPC002_B4 | A97CA62BC09EE | 57 | AC | 1696 ms | 182 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1, -1, -1):
qc.h(i)
k = 2
for j in range(i-1, -1, -1):
theta = 2 * math.pi / 2 ** k
qc.cp(theta, j, i)
k += 1
for i in range(n // 2):
qc.swap(i, n-1-i)
return qc
''' |
QPC002_B4 | A9BB84B4F7896 | 1 | RE | 1064 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)
for k in range(qubit + 1, n):
qc.cp(2 * np.pi / (2 ** (k - qubit + 1)), k, qubit)
for qubit in range(n // 2):
qc.swap(qubit, n - qubit - 1)
return qc
''' |
QPC002_B4 | A9BB84B4F7896 | 2 | RE | 1164 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for qubit in range(n):
qc.h(qubit)
for k in range(qubit + 1, n):
qc.cp(2 * np.pi / (2 ** (k - qubit + 1)), k, qubit)
for qubit in range(n // 2):
q.swap(qubit, n - qubit - 1)
return qc
''' |
QPC002_B4 | A9BB84B4F7896 | 3 | RE | 1064 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import numpy as n
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for qubit in range(0,n):
qc.h(qubit)
for k in range(qubit + 1, n):
qc.cp(2 * np.pi / (2 ** (k - qubit + 1)), k, qubit)
for qubit in range(0, n // 2):
q.swap(qubit, n - qubit - 1)
return qc
''' |
QPC002_B4 | A9BB84B4F7896 | 4 | RE | 1077 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for qubit in range(n):
qc.h(qubit)
for k in range(qubit + 1, n):
qc.cp(2 * np.pi / (2 ** (k - qubit + 1)), k, qubit)
for qubit in range(n // 2):
q.swap(qubit, n - qubit - 1)
return qc
''' |
QPC002_B4 | A9BB84B4F7896 | 5 | WA | 1450 ms | 154 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def qft(circuit, n):
for qubit in range(n):
circuit.h(qubit)
for k in range(qubit + 1, n):
circuit.cp(2 * np.pi / (2 ** (k - qubit + 1)), k, qubit)
for qubit in range(n // 2):
circuit.swap(qubit, n - qubit - 1)
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qft(qc, n)
return qc
''' |
QPC002_B4 | A9C3D3980B8D3 | 1 | RE | 1079 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc += QFT(num_qubits=n, approximation_degree=0, do_swaps=True, inverse=False, insert_barriers=False, name='qft')
return qc
''' |
QPC002_B4 | A9C3D3980B8D3 | 2 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import QFT
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc += QFT(num_qubits=n, approximation_degree=0, do_swaps=True, inverse=False, insert_barriers=False, name='qft')
return qc
''' | ||
QPC002_B4 | A9C3D3980B8D3 | 3 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import QFT
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
def swap_registers(circuit, n):
for qubit in range(n//2):
circuit.swap(qubit, n-qubit-1)
return circuit
def qft(circuit, n):
"""QFT on the first n qubits in circuit"""
qft_rotations(circuit, n)
swap_registers(circuit, n)
return circuit
def qft_rotations(circuit, n):
"""Performs qft on the first n qubits in circuit (without swaps)"""
if n == 0:
return circuit
n -= 1
circuit.h(n)
for qubit in range(n):
circuit.cp(pi/2**(n-qubit), qubit, n)
# At the end of our function, we call the same function again on
# the next qubits (we reduced n by one earlier in the function)
qft_rotations(circuit, n)
# Let's see how it looks:
qft(qc,n)
return qc
''' | ||
QPC002_B4 | A9C3D3980B8D3 | 4 | RE | 1145 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
def swap_registers(circuit, n):
for qubit in range(n//2):
circuit.swap(qubit, n-qubit-1)
return circuit
def qft(circuit, n):
"""QFT on the first n qubits in circuit"""
qft_rotations(circuit, n)
swap_registers(circuit, n)
return circuit
def qft_rotations(circuit, n):
"""Performs qft on the first n qubits in circuit (without swaps)"""
if n == 0:
return circuit
n -= 1
circuit.h(n)
for qubit in range(n):
circuit.cp(pi/2**(n-qubit), qubit, n)
# At the end of our function, we call the same function again on
# the next qubits (we reduced n by one earlier in the function)
qft_rotations(circuit, n)
# Let's see how it looks:
qft(qc,n)
return qc
''' |
QPC002_B4 | A9C3D3980B8D3 | 5 | DLE | 1139 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
from numpy import pi
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
def swap_registers(circuit, n):
for qubit in range(n//2):
circuit.swap(qubit, n-qubit-1)
return circuit
def qft(circuit, n):
"""QFT on the first n qubits in circuit"""
qft_rotations(circuit, n)
swap_registers(circuit, n)
return circuit
def qft_rotations(circuit, n):
"""Performs qft on the first n qubits in circuit (without swaps)"""
if n == 0:
return circuit
n -= 1
circuit.h(n)
for qubit in range(n):
circuit.cp(pi/2**(n-qubit), qubit, n)
# At the end of our function, we call the same function again on
# the next qubits (we reduced n by one earlier in the function)
qft_rotations(circuit, n)
# Let's see how it looks:
qft(qc,n)
return qc
''' |
QPC002_B4 | A9E441280E0C2 | 1 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import QFTGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc = QFTGate(n)
return qc
''' | ||
QPC002_B4 | AA0897279810A | 1 | RE | 1080 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 j in range(i+1, n):
qc.cp(2 * np.pi / 2**(j-i+1), j, i)
for i in range(n//2):
qc.cx(i, n-i-1)
qc.cx(n-i-1, i)
qc.cx(i, n-i-1)
return qc
''' |
QPC002_B4 | AA0897279810A | 2 | WA | 1161 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.h(i)
for j in range(i+1, n):
qc.cp(2 * np.pi / 2**(j-i+1), j, i)
for i in range(n//2):
qc.cx(i, n-i-1)
qc.cx(n-i-1, i)
qc.cx(i, n-i-1)
return qc
''' |
QPC002_B4 | AA107A4614541 | 1 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in reversed(range(n)):
for j in reversed(range(i))
qc.cp(math.pi / (2 ** (i - j)), j, i)
for i in range(n // 2):
qc.swap(i, n - i - 1)
return qc
''' | ||
QPC002_B4 | AA107A4614541 | 2 | RE | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in reversed(range(n)):
qc.h(i)
for j in reversed(range(i))
qc.cp(math.pi / (2 ** (i - j)), j, i)
for i in range(n // 2):
qc.swap(i, n - i - 1)
return qc
''' | ||
QPC002_B4 | AA107A4614541 | 3 | AC | 2069 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in reversed(range(n)):
qc.h(i)
for j in reversed(range(i)):
qc.cp(math.pi / (2 ** (i - j)), j, i)
for i in range(n // 2):
qc.swap(i, n - i - 1)
return qc
''' |
QPC002_B4 | AA1808EA723C6 | 1 | WA | 1462 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.h(i)
for j in range(i+1,n):
qc.cp(np.pi/(2.0 ** (j-(i+1)+1)), j, i)
return qc
''' |
QPC002_B4 | AA1808EA723C6 | 2 | WA | 1103 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# for i in range(n):
# qc.h(i)
# for j in range(i+1,n):
# qc.cp(np.pi/(2.0 ** (j-(i+1)+1)), j, i)
for i in reversed(range(n)):
qc.h(i)
for j in range(i):
qc.cp(np.pi/(2.0 ** (i-j)), j, i)
return qc
''' |
QPC002_B4 | AA1808EA723C6 | 3 | WA | 1511 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# for i in range(n):
# qc.h(i)
# for j in range(i+1,n):
# qc.cp(np.pi/(2.0 ** (j-(i+1)+1)), j, i)
for i in reversed(range(n)):
qc.h(i)
for j in reversed(range(i)):
qc.cp(np.pi/(2.0 ** (i-j)), j, i)
return qc
''' |
QPC002_B4 | AA1808EA723C6 | 4 | AC | 2299 ms | 183 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# for i in range(n):
# qc.h(i)
# for j in range(i+1,n):
# qc.cp(np.pi/(2.0 ** (j-(i+1)+1)), j, i)
for i in reversed(range(n)):
qc.h(i)
for j in reversed(range(i)):
qc.cp(np.pi/(2.0 ** (i-j)), j, i)
for i in range(n):
if i < n-1-i:
qc.swap(i,n-1-i)
return qc
''' |
QPC002_B4 | AA19E81C076C6 | 1 | WA | 1049 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
from numpy import pi
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for qubit in range(n):
qc.h(qubit)
for j in range(qubit):
qc.cp(pi / 2**(qubit - j), j, qubit)
for qubit in range(n // 2):
qc.swap(qubit, n - qubit - 1)
return qc
''' |
QPC002_B4 | AA19E81C076C6 | 2 | WA | 1166 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
from numpy import pi
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for qubit in range(n):
qc.h(qubit)
for j in range(qubit):
qc.cp(pi / 2**(qubit - j), j, qubit)
return qc
''' |
QPC002_B4 | AA19E81C076C6 | 3 | DLE | 1444 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def qft_rotations(circuit, n):
"""Performs the QFT on the first n qubits in the circuit."""
if n == 0:
return circuit
n -= 1
circuit.h(n)
for qubit in range(n):
circuit.cp(np.pi / 2**(n - qubit), qubit, n)
qft_rotations(circuit, n)
def swap_registers(circuit, n):
"""Swaps the qubits to correct the ordering after QFT."""
for qubit in range(n // 2):
circuit.swap(qubit, n - qubit - 1)
return circuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply the QFT
qft_rotations(qc, n)
# Swap the qubits to correct the ordering
swap_registers(qc, n)
return qc
''' |
QPC002_B4 | AA19E81C076C6 | 4 | WA | 1075 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def qft_rotations_optimized(circuit, n):
"""Performs the QFT on the first n qubits in the circuit."""
for i in range(n):
circuit.h(i)
for j in range(i + 1, n):
circuit.cp(np.pi / 2**(j - i), j, i)
def swap_registers(circuit, n):
"""Swaps the qubits to correct the ordering after QFT."""
for qubit in range(n // 2):
circuit.swap(qubit, n - qubit - 1)
return circuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply the optimized QFT
qft_rotations_optimized(qc, n)
# Swap the qubits to correct the ordering
swap_registers(qc, n)
return qc
''' |
QPC002_B4 | AA19E81C076C6 | 5 | WA | 1585 ms | 153 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def qft_rotations(circuit, n):
"""Performs the QFT on the first n qubits in the circuit."""
for j in range(n):
circuit.h(j)
for k in range(j + 1, n):
circuit.cp(np.pi / 2**(k - j), k, j)
def swap_registers(circuit, n):
"""Swaps the qubits to correct the ordering after QFT."""
for qubit in range(n // 2):
circuit.swap(qubit, n - qubit - 1)
return circuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply the QFT
qft_rotations(qc, n)
# Swap the qubits to correct the ordering
swap_registers(qc, n)
return qc
''' |
QPC002_B4 | AA19E81C076C6 | 6 | WA | 1065 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def optimized_qft(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for j in range(n):
for k in range(j):
qc.cp(np.pi / 2**(j - k), n - 1 - j, n - 1 - k)
qc.h(n - 1 - j)
return qc
def solve(n: int) -> QuantumCircuit:
return optimized_qft(n)
''' |
QPC002_B4 | AA19E81C076C6 | 7 | WA | 1568 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def qft_rotations(circuit, n):
"""Performs the QFT on the first n qubits in the circuit."""
if n == 0:
return circuit
n -= 1
circuit.h(n)
for qubit in range(n):
circuit.cp(np.pi / 2**(n - qubit), qubit, n)
qft_rotations(circuit, n)
def swap_registers(circuit, n):
"""Swaps the qubits to correct the ordering after QFT."""
for qubit in range(n // 2):
circuit.swap(qubit, n - qubit - 1)
return circuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply the QFT
qft_rotations(qc, n)
return qc
''' |
QPC002_B4 | AA19E81C076C6 | 8 | WA | 1108 ms | 144 MiB | '''python
from qiskit import QuantumCircuit
from math import pi
def qft(n):
qc = QuantumCircuit(n)
for i in range(n):
# Apply Hadamard gate
qc.h(i)
# Apply controlled phase rotation gates
for j in range(i + 1, n):
qc.cp(pi / 2**(j - i), j, i)
# Reverse the order of qubits
for i in range(n // 2):
qc.swap(i, n - i - 1)
return qc
def solve(n: int) -> QuantumCircuit:
return qft(n)
# Example usage:
qc = solve(2)
print(qc)
''' |
QPC002_B4 | AA19E81C076C6 | 9 | WA | 1229 ms | 151 MiB | '''python
from qiskit import QuantumCircuit
from numpy import pi
def qft(n):
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
for j in range(i + 1, n):
qc.cp(pi / 2**(j - i), j, i)
for i in range(n // 2):
qc.swap(i, n - i - 1)
return qc
def solve(n: int) -> QuantumCircuit:
return qft(n)
''' |
QPC002_B4 | AA4D538AC9A48 | 1 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import QFT
def solve(n: int) -> QuantumCircuit:
#qc = QuantumCircuit(n)
# Write your code here:
qc = QFT(n)
return qc
''' | ||
QPC002_B4 | AA5C4EF604A56 | 1 | RE | 1203 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates import U1Gate
from math import pi
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n//2):
qc.swap(i, n-i-1)
for i in range(n):
qc.h(i)
for j in range(i+1, n):
qc.append(U1Gate(pi/2**(j-i)).control(j), [j, i])
return qc
''' |
QPC002_B4 | AA5C4EF604A56 | 2 | AC | 1651 ms | 182 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates import U1Gate
from math import pi
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n//2):
qc.swap(i, n-i-1)
for i in range(n):
qc.h(i)
for j in range(i+1, n):
qc.append(U1Gate(pi/2**(j-i)).control(1), [j, i])
return qc
''' |
QPC002_B4 | AA6F97A66AE8B | 1 | WA | 1096 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
from math import pi
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.h(i)
for j in range(1, n-i):
qc.cu(0, 2*pi/(2**(j+1)),0,0,i+j,i)
return qc
''' |
QPC002_B4 | AA6F97A66AE8B | 2 | WA | 1294 ms | 183 MiB | '''python
from qiskit import QuantumCircuit
from math import pi
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.h(i)
for j in range(1, n-i):
qc.cu(0,0,0, 2*pi/(2**(j+1)),i+j,i)
return qc
''' |
QPC002_B4 | AA6F97A66AE8B | 3 | WA | 1114 ms | 144 MiB | '''python
from qiskit import QuantumCircuit
from math import pi
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.h(i)
for j in range(1, n-i):
qc.cu(0,0,0, 2*pi/(2**(j+2)),i+j,i)
return qc
''' |
QPC002_B4 | AA6F97A66AE8B | 4 | WA | 1467 ms | 182 MiB | '''python
from qiskit import QuantumCircuit
from math import pi
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.h(i)
for j in range(1, n-i):
qc.cu(0,0,0, 2*pi/(2**j),i+j,i)
return qc
''' |
QPC002_B4 | AA9E23543A0BA | 1 | WA | 1219 ms | 142 MiB | '''python
from qiskit import QuantumCircuit
from math import pi
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.h(i)
for j in range(i + 1, n):
theta = 2 * pi / (2 ** j)
qc.cp(theta, j, i)
for i in range(n):
j = n - 1 - i
if i >= j:
break
qc.swap(i, j)
return qc
''' |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.