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 |
|---|---|---|---|---|---|---|
QPC001_C2 | AB33DE6DF37CE | 6 | AC | 1710 ms | 93 MiB | '''python
from qiskit import QuantumCircuit, Aer, transpile, assemble
from qiskit.circuit.library import XGate, HGate, U3Gate, RYGate
from math import acos, sqrt, log2
def uniform_algorithm(M, n):
# バイナリ表記の逆順で1の位置を取得
binary_str = bin(M)[2:][::-1]
print(binary_str)
locations_of_1 = [i for i, bit in enumerate(binary_str) if bit == '1']
print(locations_of_1)
# 量子回路の初期化
qc = QuantumCircuit(n)
if n == 1:
if M == 2:
qc.h(0)
elif M == 1:
qc.x(0)
qc.x(0)
elif not log2(M).is_integer():
# Xゲートを指定の位置に適用
for loc in locations_of_1[1:]:
qc.append(XGate(), [loc])
# M0が偶数の場合、右端のl0ビットに対してHadamardゲートを適用
M0 = 2 ** locations_of_1[0]
if M0 % 2 == 0:
for i in range(locations_of_1[0]):
qc.append(HGate(), [i])
# 回転ゲートのパラメータ
theta0 = -2 * acos(sqrt(M0 / M))
# RYゲートを適用
qc.append(RYGate(theta0), [locations_of_1[1]])
# 制御Hadamardゲートを適用
for i in range(locations_of_1[0], locations_of_1[1]):
qc.x(locations_of_1[1])
qc.append(HGate().control(), [locations_of_1[1], i])
qc.x(locations_of_1[1])
# k回の繰り返し
Mm = M0
print(len(locations_of_1))
for m in range(1, len(locations_of_1)-1):
print(m)
# 回転ゲートのパラメータ
theta_m = -2 * acos(sqrt(2**locations_of_1[m] / (M - Mm)))
# 制御RYゲートを適用
qc.x(locations_of_1[m])
qc.append(RYGate(theta_m).control(), [locations_of_1[m], locations_of_1[m+1]])
qc.x(locations_of_1[m])
# 制御Hadamardゲートを適用
for i in range(locations_of_1[m], locations_of_1[m+1]):
qc.x(locations_of_1[m+1])
qc.append(HGate().control(), [locations_of_1[m+1],i])
qc.x(locations_of_1[m+1])
Mm += 2**locations_of_1[m]
else:
qc.h(range(int(log2(M))))
return qc
def solve(n: int, L: int) -> QuantumCircuit:
qc = uniform_algorithm(L,n)
# Write your code here:
return qc
''' |
QPC001_C2 | AB96879705541 | 1 | TLE | 6000 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
coeff = 1/math.sqrt(L)
qc.initialize([coeff]*L + [0]*(2**n-L))
return qc.decompose(reps=5)
''' |
QPC001_C2 | AB96879705541 | 2 | TLE | 6000 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
coeff = 1/math.sqrt(L)
qc.initialize([coeff]*L + [0]*(2**n-L))
return qc.decompose(reps=10)
''' |
QPC001_C2 | AB96879705541 | 3 | TLE | 6000 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
coeff = 1/math.sqrt(L)
qc.initialize([coeff]*L + [0]*(2**n-L))
return qc.decompose(reps=15)
''' |
QPC001_C2 | AB96879705541 | 4 | TLE | 6000 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
coeff = 1/math.sqrt(L)
qc.initialize([coeff]*L + [0]*(2**n-L))
return qc.decompose(reps=20)
''' |
QPC001_C2 | ABB6FAEFC2BAC | 1 | RE | 1050 ms | 90 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
l=L-1
k=0
while l>0:
maxi=0
for i in range(n-1-k,-1,-1):
if 1<<i > l:
continue
if 1<<i <=l and 1<<(i+1)>l:
maxi=max(maxi,i)
print(1<<(i))
# if i>0:
l2=L-1
for k1 in range(n-1,i,-1):
if not (1<<k1)&l2:
qc.x(k1)
clist=list(range(n-1,i,-1))+[i]
cu3_gate = U3Gate(-math.acos(math.sqrt((1<<i))/math.sqrt(l+1))*2,math.pi,0).control(len(clist)-1)
print(clist)
qc.append(cu3_gate,clist)
l2=L-1
for k1 in range(n-1,i,-1):
if not (1<<k1)&l2:
qc.x(k1)
qc.x(i)
for j in range(n-1,maxi,-1):
qc.x(j)
for j in range(0,i):
clist=list(range(n-1,i-1,-1))+[j]
c3h_gate = HGate().control(len(clist)-1)
print(clist)
qc.append(c3h_gate,clist)
qc.x(i)
for j in range(n-1,maxi,-1):
qc.x(j)
k+=1
l=l-(1<<i) # 最上位ビット削除
return qc
''' |
QPC001_C2 | ABB6FAEFC2BAC | 2 | RE | 1063 ms | 90 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
l=L-1
k=0
while l>0:
maxi=0
for i in range(n-1-k,-1,-1):
if 1<<i > l:
continue
if 1<<i <=l and 1<<(i+1)>l:
maxi=max(maxi,i)
print(1<<(i))
# if i>0:
l2=L-1
for k1 in range(n-1,i,-1):
if not (1<<k1)&l2:
qc.x(k1)
clist=list(range(n-1,i,-1))+[i]
if len(clist)>1:
cu3_gate = U3Gate(-math.acos(math.sqrt((1<<i))/math.sqrt(l+1))*2,math.pi,0).control(len(clist)-1)
print(clist)
qc.append(cu3_gate,clist)
else:
qc.u(-math.acos(math.sqrt((1<<i))/math.sqrt(l+1))*2,math.pi,0,i)
l2=L-1
for k1 in range(n-1,i,-1):
if not (1<<k1)&l2:
qc.x(k1)
qc.x(i)
for j in range(n-1,maxi,-1):
qc.x(j)
for j in range(0,i):
clist=list(range(n-1,i-1,-1))+[j]
c3h_gate = HGate().control(len(clist)-1)
print(clist)
qc.append(c3h_gate,clist)
qc.x(i)
for j in range(n-1,maxi,-1):
qc.x(j)
k+=1
l=l-(1<<i) # 最上位ビット削除
return qc
''' |
QPC001_C2 | ABEB3CA7A6027 | 1 | UGE | 1256 ms | 82 MiB | '''python
from qiskit import QuantumCircuit
def c1(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if L == 1:
return qc
while True:
print(n)
if L > 2 ** (n - 1):
qc.h(range(n))
return qc
n -= 1
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(500):
c = c1(n, L)
qc.append(c, range(n))
return qc
''' |
QPC001_C2 | ABEB3CA7A6027 | 2 | UGE | 933 ms | 83 MiB | '''python
from qiskit import QuantumCircuit
def c1(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if L == 1:
return qc
while True:
print(n)
if L > 2 ** (n - 1):
qc.h(range(n))
return qc
n -= 1
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
c = c1(n, L)
for _ in range(500):
qc.append(c, range(n))
return qc
''' |
QPC001_C2 | ABEB3CA7A6027 | 3 | UME | '''python
from qiskit import QuantumCircuit
from qiskit import Aer, transpile, execute
def c1(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if L == 1:
return qc
while True:
print(n)
if L > 2 ** (n - 1):
qc.h(range(n))
return qc
n -= 1
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
c = c1(n, L)
for _ in range(500):
qc &= c
return qc
''' | ||
QPC001_C2 | ABEB3CA7A6027 | 4 | WA | 1225 ms | 100 MiB | '''python
from qiskit import QuantumCircuit
def c1(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if L == 1:
return qc
while True:
print(n)
if L > 2 ** (n - 1):
qc.h(range(n))
return qc
n -= 1
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
c = c1(n, L)
for _ in range(500):
qc &= c
return qc
solve(10, 100)
''' |
QPC001_C2 | ABEB3CA7A6027 | 5 | AC | 1342 ms | 93 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import ZGate, PhaseGate
import math
def Rt(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
if not (L >> i) & 1:
continue
for j in range(i + 1, n):
if not (L >> j) & 1:
qc.x(j)
qc.x(i)
if i == n - 1:
qc.p(math.pi / 3, i)
else:
qc.append(PhaseGate(math.pi / 3).control(n - i - 1), range(i, n))
qc.x(i)
for j in range(i + 1, n):
if not (L >> j) & 1:
qc.x(j)
return qc
def Rs(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(range(n))
if n == 1:
qc.p(math.pi / 3, 0)
else:
qc.append(PhaseGate(math.pi / 3).control(n - 1), range(n))
qc.x(range(n))
return qc
def U(m: int, n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
if m == 0:
qc.h(range(n))
return qc
u = U(m - 1, n, L)
qc.compose(u, inplace=True)
qc.compose(Rt(n, L), inplace=True)
qc.compose(u.inverse(), inplace=True)
qc.compose(Rs(n), inplace=True)
qc.compose(u, inplace=True)
return qc
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
if L == 1:
return qc
k = math.ceil(math.log2(L))
qc.compose(U(3, k, L), inplace=True)
return qc
''' |
QPC001_C2 | ABF3A98409189 | 1 | RE | 2308 ms | 160 MiB | '''python
import math
from qiskit import QuantumCircuit
from qiskit.circuit.library import ZGate
def less_than_oracle(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
if (L & (1 << i)) == 0:
qc.x(i)
for i in range(n):
if (L & (1 << i)) != 0:
qc.x(i)
if i + 1 < n:
qc.append(ZGate().control(n - i - 1), range(i, n))
else:
qc.z(i)
qc.x(i)
for i in range(n):
if (L & (1 << i)) == 0:
qc.x(i)
return qc
def diffusion_oracle(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
qc.x(i)
qc.append(ZGate().control(n - 1), range(n))
for i in range(n):
qc.x(i)
qc.h(i)
return qc
def make_three_uniform() -> QuantumCircuit:
qc = QuantumCircuit(2)
qc.h(0)
qc.ry(math.asin(1 / 3), 0)
qc.ch(0, 1)
qc.x(0)
return qc
def solve(n: int, L: int) -> QuantumCircuit:
assert L < 2 ** n
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
if L == (2 ** n) // 2:
qc.h(n-1)
return qc
if L == (2 ** n) // 4 * 3:
qc.h(n-1)
qc.h(n-2)
qc.append(make_three_uniform().to_gate(), [n - 2, n - 1])
return qc
theta = math.asin((L / (2 ** n)) ** 0.5)
# print(f"{theta = }")
less = less_than_oracle(n, L)
diff = diffusion_oracle(n)
for i in range(400):
if math.sin((2 * i + 1) * theta) ** 2 > 0.9999:
# print(f'break! {i = }')
break
qc.append(less.to_gate(), range(n))
qc.append(diff.to_gate(), range(n))
return qc
# if __name__ == "__main__":
# from qiskit.quantum_info import Statevector
# import numpy as np
# import random
# n = random.randint(2, 10)
# L = random.randint(1, 2 ** n - 1)
# # n = 2
# # L = 2**(n-2)*3
# # theta = L/N, and only broken when n/(4 theta) is a half integer
# print(f"{n = } {L = }")
# qc = solve(n, L)
# sv = Statevector(qc)
# # print(sv)
# prob = (np.abs(sv) ** 2)
# print(sum(prob[i] for i in range(L)))
# print(f"{qc.depth() = }")
# # sv = Statevector.from_label('+++')
# # print(sv.evolve(qc))
''' |
QPC001_C2 | ABF3A98409189 | 2 | UGE | 1685 ms | 158 MiB | '''python
import math
from qiskit import QuantumCircuit
from qiskit.circuit.library import ZGate
def less_than_oracle(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
if (L & (1 << i)) == 0:
qc.x(i)
for i in range(n):
if (L & (1 << i)) != 0:
qc.x(i)
if i + 1 < n:
qc.append(ZGate().control(n - i - 1), range(i, n))
else:
qc.z(i)
qc.x(i)
for i in range(n):
if (L & (1 << i)) == 0:
qc.x(i)
return qc
def diffusion_oracle(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
qc.x(i)
qc.append(ZGate().control(n - 1), range(n))
for i in range(n):
qc.x(i)
qc.h(i)
return qc
def make_three_uniform() -> QuantumCircuit:
qc = QuantumCircuit(2)
qc.h(0)
qc.ry(math.asin(1 / 3), 0)
qc.ch(0, 1)
qc.x(0)
return qc
def solve(n: int, L: int) -> QuantumCircuit:
assert L <= 2 ** n
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
if L == (2 ** n):
return qc
if L == (2 ** n) // 2:
qc.h(n-1)
return qc
if L == (2 ** n) // 4 * 3:
qc.h(n-1)
qc.h(n-2)
qc.append(make_three_uniform().to_gate(), [n - 2, n - 1])
return qc
theta = math.asin((L / (2 ** n)) ** 0.5)
# print(f"{theta = }")
less = less_than_oracle(n, L)
diff = diffusion_oracle(n)
for i in range(400):
if math.sin((2 * i + 1) * theta) ** 2 > 0.9999:
# print(f'break! {i = }')
break
qc.append(less.to_gate(), range(n))
qc.append(diff.to_gate(), range(n))
return qc
# if __name__ == "__main__":
# from qiskit.quantum_info import Statevector
# import numpy as np
# import random
# n = random.randint(2, 10)
# L = random.randint(1, 2 ** n - 1)
# # n = 2
# # L = 2**(n-2)*3
# # theta = L/N, and only broken when n/(4 theta) is a half integer
# print(f"{n = } {L = }")
# qc = solve(n, L)
# sv = Statevector(qc)
# # print(sv)
# prob = (np.abs(sv) ** 2)
# print(sum(prob[i] for i in range(L)))
# print(f"{qc.depth() = }")
# # sv = Statevector.from_label('+++')
# # print(sv.evolve(qc))
''' |
QPC001_C2 | AC13A274AD134 | 1 | WA | 1032 ms | 90 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.h(i)
for k in range(1, n):
if L <= 2**(n-k):
qc.x(n-k)
qc.h(n-k)
return qc
''' |
QPC001_C2 | AD27568DCFEF4 | 1 | RE | 907 ms | 79 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int, L: int) -> QuantumCircuit:
if L == (1<<n):
qc = QuantumCircuit(n)
return qc
else:
numbin = bin(L + (1<<n))[3:]
qc = QuantumCircuit(n)
numbin = numbin.rstrip("0")
print(numbin)
if numbin[0]== "1":
qc.x(n-1)
qc.z(n-1)
qc.x(n-1)
else:
qc.x(n-1)
for pos, v in enumerate(numbin[1:]):
pos += 1
if v=="0":
qc.x(n-1-pos)
else:
qc.x(n-1-pos)
nn = pos + 1
circuit=QuantumCircuit(nn)
circuit.h(nn-1)
gate = MCXGate(nn-1)
circuit.append(gate, range(nn))
circuit.h(nn-1)
qc.append(circuit.to_gate(), range(n-1,n-2-pos,-1))
qc.x(n-pos-1)
for pos, v in enumerate(numbin):
if v == "0":
qc.x(n-pos-1)
qc = qc.decompose()
return qc
''' |
QPC001_C2 | AD27568DCFEF4 | 2 | RE | 1216 ms | 80 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import ZGate, MCXGate, GroverOperator
import math
def get_oracle(n,L):
if L == (1<<n):
qc = QuantumCircuit(n)
return qc
numbin = bin(L + (1<<n))[3:]
qc = QuantumCircuit(n)
numbin = numbin.rstrip("0")
print(numbin)
if numbin[0]== "1":
qc.x(n-1)
qc.z(n-1)
qc.x(n-1)
else:
qc.x(n-1)
for pos, v in enumerate(numbin[1:]):
pos += 1
if v=="0":
qc.x(n-1-pos)
else:
qc.x(n-1-pos)
nn = pos + 1
circuit=QuantumCircuit(nn)
circuit.h(nn-1)
gate = MCXGate(nn-1)
circuit.append(gate, range(nn))
circuit.h(nn-1)
qc.append(circuit.to_gate(), range(n-1,n-2-pos,-1))
qc.x(n-pos-1)
for pos, v in enumerate(numbin):
if v == "0":
qc.x(n-pos-1)
qc = qc.decompose()
return qc
def mirror(oracle: QuantumCircuit, n_qubits: int, barrier: bool = False) -> QuantumCircuit:
qc = QuantumCircuit(n_qubits)
qc.append(oracle.inverse(), list(range(n_qubits)))
qc.x(list(range(n_qubits)))
qc.h(n_qubits-1)
qc.mcx(list(range(n_qubits-1)), n_qubits-1)
qc.h(n_qubits-1)
qc.x(list(range(n_qubits)))
qc.append(oracle, list(range(n_qubits)))
qc.global_phase = math.pi
return qc
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
oracle = get_oracle(n, L)
horacle = QuantumCircuit(n)
for i in range(n):
horacle.h(i)
for i in range(10):
gop = GroverOperator(oracle)
qc.append(gop, list(range(n)))
mirror(horacle, n)
return qc
''' |
QPC001_C2 | AD27568DCFEF4 | 3 | WA | 1168 ms | 91 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import ZGate, MCXGate, GroverOperator
import math
def get_oracle(n,L):
if L == (1<<n):
qc = QuantumCircuit(n)
return qc
numbin = bin(L + (1<<n))[3:]
qc = QuantumCircuit(n)
numbin = numbin.rstrip("0")
print(numbin)
if numbin[0]== "1":
qc.x(n-1)
qc.z(n-1)
qc.x(n-1)
else:
qc.x(n-1)
for pos, v in enumerate(numbin[1:]):
pos += 1
if v=="0":
qc.x(n-1-pos)
else:
qc.x(n-1-pos)
nn = pos + 1
circuit=QuantumCircuit(nn)
circuit.h(nn-1)
gate = MCXGate(nn-1)
circuit.append(gate, range(nn))
circuit.h(nn-1)
qc.append(circuit.to_gate(), range(n-1,n-2-pos,-1))
qc.x(n-pos-1)
for pos, v in enumerate(numbin):
if v == "0":
qc.x(n-pos-1)
qc = qc.decompose()
return qc
def mirror(oracle: QuantumCircuit, n_qubits: int, barrier: bool = False) -> QuantumCircuit:
qc = QuantumCircuit(n_qubits)
qc.append(oracle.inverse(), list(range(n_qubits)))
qc.x(list(range(n_qubits)))
qc.h(n_qubits-1)
qc.mcx(list(range(n_qubits-1)), n_qubits-1)
qc.h(n_qubits-1)
qc.x(list(range(n_qubits)))
qc.append(oracle, list(range(n_qubits)))
qc.global_phase = math.pi
return qc
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
oracle = get_oracle(n, L)
horacle = QuantumCircuit(n)
for i in range(n):
horacle.h(i)
for i in range(10):
gop = GroverOperator(oracle)
qc.append(gop, list(range(n)))
qc = qc.decompose().decompose()
return qc
''' |
QPC001_C2 | AD27568DCFEF4 | 4 | WA | 1132 ms | 91 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import ZGate, MCXGate, GroverOperator
import math
def get_oracle(n,L):
if L == (1<<n):
qc = QuantumCircuit(n)
return qc
numbin = bin(L + (1<<n))[3:]
qc = QuantumCircuit(n)
numbin = numbin.rstrip("0")
print(numbin)
if numbin[0]== "1":
qc.x(n-1)
qc.z(n-1)
qc.x(n-1)
else:
qc.x(n-1)
for pos, v in enumerate(numbin[1:]):
pos += 1
if v=="0":
qc.x(n-1-pos)
else:
qc.x(n-1-pos)
nn = pos + 1
circuit=QuantumCircuit(nn)
circuit.h(nn-1)
gate = MCXGate(nn-1)
circuit.append(gate, range(nn))
circuit.h(nn-1)
qc.append(circuit.to_gate(), range(n-1,n-2-pos,-1))
qc.x(n-pos-1)
for pos, v in enumerate(numbin):
if v == "0":
qc.x(n-pos-1)
qc = qc.decompose()
return qc
def mirror(oracle: QuantumCircuit, n_qubits: int, barrier: bool = False) -> QuantumCircuit:
qc = QuantumCircuit(n_qubits)
qc.append(oracle.inverse(), list(range(n_qubits)))
qc.x(list(range(n_qubits)))
qc.h(n_qubits-1)
qc.mcx(list(range(n_qubits-1)), n_qubits-1)
qc.h(n_qubits-1)
qc.x(list(range(n_qubits)))
qc.append(oracle, list(range(n_qubits)))
qc.global_phase = math.pi
return qc
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
oracle = get_oracle(n, L)
#horacle = QuantumCircuit(n)
#for i in range(n):
# horacle.h(i)
for i in range(2*(1<<(n//2))):
gop = GroverOperator(oracle)
qc.append(gop, list(range(n)))
qc = qc.decompose().decompose()
return qc
''' |
QPC001_C2 | AD27568DCFEF4 | 5 | RE | 815 ms | 79 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import RYGate, HGate, XGate
import math
def dist(L, n):
if L == 1:
return [1.0]
ret = []
for i in range(n):
if L < (1<<(i+1)):
ret.append(max(L - (1<<i),0))
break
else:
if i==0:
ret.append(2)
else:
ret.append(1<<i)
return [r/L for r in ret if r>0]
def w_state(n_qubits: int, L, control, ctrl_state) -> QuantumCircuit:
qc = QuantumCircuit(n_qubits)
seq = dist(L, n_qubits)
#print(seq)
RY = RYGate(-math.asin(seq[0]**0.5)*2)
#qc.append(RY, [0])
if len(control)>0:
RY = RY.control(len(control),ctrl_state=ctrl_state)
qc.append(RY, control + [0])
for i in range(1, len(seq)):
RY = RYGate(-math.asin((seq[i]/sum(seq[i:]))**0.5)*2)
RY = RY.control(len(control)+i,ctrl_state= "0"*i + ctrl_state)
qc.append(RY, control + [j for j in range(i)] + [i])
return qc
def solve() -> QuantumCircuit:
n = 4
L = 6
# qc = QuantumCircuit(4)
# qc.h(0)
# xg = XGate()
# xg = xg.control(2,ctrl_state="01")
# qc.append(xg, [0,1,2])
# return qc
dis = dist(L, n)
binlist = []
for i in range(len(dis)):
if ((1<<i) & L) > 0:
binlist.append(1)
else:
binlist.append(0)
qc = QuantumCircuit(n)
#return w_state(n,L,[], "")
b = 1<<(len(binlist)-1)
l = L
for i in range(len(binlist)):
if binlist[-i-1] == 1:
if i>0:
ctrls = list(range(len(binlist)))[-i:]
else:
ctrls = []
st = bin(L)[2:2+i]
#print(ctrls,st,l)
_qc = w_state(n, l, ctrls, st)
l -= b
qc.append(_qc, range(n))
for j in range(len(binlist)-i-1):
new_st = st + "".join(["1" if j==k else "0" for k in range(1,len(binlist)-i)][::-1])
newctrl = [k for k in range(len(binlist) - len(new_st), len(binlist))]
#print("newst", new_st, newctrl, j)
if j==0:
xg = XGate()
xg = xg.control(len(newctrl), ctrl_state=new_st)
qc.append(xg, newctrl + [0])
hg = HGate()
hg = hg.control(len(newctrl), ctrl_state=new_st)
qc.append(hg, newctrl + [0])
else:
for k in range(j):
hg = HGate()
hg = hg.control(len(newctrl), ctrl_state=new_st)
qc.append(hg, newctrl + [k])
#break
b //= 2
qc = qc.decompose().decompose()
# for k in range(j):
# print(j,k)
# hg = HGate()
# hg = hg.control(len(ctrls)+1, ctrl_state=st+"1")
# qc.append(hg, ctrls + [j] + [k])
return qc
''' |
QPC001_C2 | AD27568DCFEF4 | 6 | RE | 1175 ms | 91 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import RYGate, HGate, XGate
import math
def dist(L, n):
if L == 1:
return [1.0]
ret = []
for i in range(n):
if L < (1<<(i+1)):
ret.append(max(L - (1<<i),0))
break
else:
if i==0:
ret.append(2)
else:
ret.append(1<<i)
return [r/L for r in ret if r>0]
def w_state(n_qubits: int, L, control, ctrl_state) -> QuantumCircuit:
qc = QuantumCircuit(n_qubits)
seq = dist(L, n_qubits)
#print(seq)
RY = RYGate(-math.asin(seq[0]**0.5)*2)
#qc.append(RY, [0])
if len(control)>0:
RY = RY.control(len(control),ctrl_state=ctrl_state)
qc.append(RY, control + [0])
for i in range(1, len(seq)):
RY = RYGate(-math.asin((seq[i]/sum(seq[i:]))**0.5)*2)
RY = RY.control(len(control)+i,ctrl_state= "0"*i + ctrl_state)
qc.append(RY, control + [j for j in range(i)] + [i])
return qc
def solve(n: int, L: int) -> QuantumCircuit:
# qc = QuantumCircuit(4)
# qc.h(0)
# xg = XGate()
# xg = xg.control(2,ctrl_state="01")
# qc.append(xg, [0,1,2])
# return qc
dis = dist(L, n)
binlist = []
for i in range(len(dis)):
if ((1<<i) & L) > 0:
binlist.append(1)
else:
binlist.append(0)
qc = QuantumCircuit(n)
#return w_state(n,L,[], "")
b = 1<<(len(binlist)-1)
l = L
for i in range(len(binlist)):
if binlist[-i-1] == 1:
if i>0:
ctrls = list(range(len(binlist)))[-i:]
else:
ctrls = []
st = bin(L)[2:2+i]
#print(ctrls,st,l)
_qc = w_state(n, l, ctrls, st)
l -= b
qc.append(_qc, range(n))
for j in range(len(binlist)-i-1):
new_st = st + "".join(["1" if j==k else "0" for k in range(1,len(binlist)-i)][::-1])
newctrl = [k for k in range(len(binlist) - len(new_st), len(binlist))]
#print("newst", new_st, newctrl, j)
if j==0:
xg = XGate()
xg = xg.control(len(newctrl), ctrl_state=new_st)
qc.append(xg, newctrl + [0])
hg = HGate()
hg = hg.control(len(newctrl), ctrl_state=new_st)
qc.append(hg, newctrl + [0])
else:
for k in range(j):
hg = HGate()
hg = hg.control(len(newctrl), ctrl_state=new_st)
qc.append(hg, newctrl + [k])
#break
b //= 2
qc = qc.decompose().decompose()
# for k in range(j):
# print(j,k)
# hg = HGate()
# hg = hg.control(len(ctrls)+1, ctrl_state=st+"1")
# qc.append(hg, ctrls + [j] + [k])
return qc
''' |
QPC001_C2 | AD27568DCFEF4 | 7 | DLE | 1996 ms | 93 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import RYGate, HGate, XGate
import math
def dist(L, n):
if L == 1:
return [1.0]
ret = []
for i in range(n):
if L < (1<<(i+1)):
ret.append(max(L - (1<<i),0))
break
else:
if i==0:
ret.append(2)
else:
ret.append(1<<i)
return [r/L for r in ret if r>0]
def w_state(n_qubits: int, L, control, ctrl_state) -> QuantumCircuit:
qc = QuantumCircuit(n_qubits)
seq = dist(L, n_qubits)
#print(seq)
RY = RYGate(-math.asin(seq[0]**0.5)*2)
#qc.append(RY, [0])
if len(control)>0:
RY = RY.control(len(control),ctrl_state=ctrl_state)
qc.append(RY, control + [0])
for i in range(1, len(seq)):
RY = RYGate(-math.asin((seq[i]/sum(seq[i:]))**0.5)*2)
RY = RY.control(len(control)+i,ctrl_state= "0"*i + ctrl_state)
qc.append(RY, control + [j for j in range(i)] + [i])
return qc
def solve(n: int, L: int) -> QuantumCircuit:
if L == 1:
return QuantumCircuit(n)
elif L==2:
qc = QuantumCircuit(n)
qc.h(0)
return qc
for i in range(2,n+1):
if L==(1<<i):
qc = QuantumCircuit(n)
for j in range(i):
qc.h(j)
return qc
# qc = QuantumCircuit(4)
# qc.h(0)
# xg = XGate()
# xg = xg.control(2,ctrl_state="01")
# qc.append(xg, [0,1,2])
# return qc
L += 1
dis = dist(L, n)
binlist = []
for i in range(len(dis)):
if ((1<<i) & (L-1)) > 0:
binlist.append(1)
else:
binlist.append(0)
#print(binlist)
qc = QuantumCircuit(n)
#return w_state(n,L,[], "")
b = 1<<(len(binlist)-1)
L = L -1
l = L
for i in range(len(binlist)):
if binlist[-i-1] == 1:
if i>0:
ctrls = list(range(len(binlist)))[-i:]
else:
ctrls = []
st = bin(L)[2:2+i]
#print(ctrls,st,l)
_qc = w_state(n, l, ctrls, st)
l -= b
qc.append(_qc, range(n))
for j in range(len(binlist)-i-1):
new_st = st + "".join(["1" if j==k else "0" for k in range(1,len(binlist)-i)][::-1])
newctrl = [k for k in range(len(binlist) - len(new_st), len(binlist))]
if j>1:
new_st = new_st[:-j+1]
newctrl = newctrl[j-1:]
#print("newst", new_st, newctrl, j)
if j==0:
xg = XGate()
xg = xg.control(len(newctrl), ctrl_state=new_st)
qc.append(xg, newctrl + [0])
hg = HGate()
hg = hg.control(len(newctrl), ctrl_state=new_st)
qc.append(hg, newctrl + [0])
else:
for k in range(j):
hg = HGate()
hg = hg.control(len(newctrl), ctrl_state=new_st)
qc.append(hg, newctrl + [k])
#break
b //= 2
xg = XGate()
xg = xg.control(n-1, ctrl_state=bin(L + (1<<n))[3:-1])
qc.append(xg, list(range(1,n)) + [0])
qc = qc.decompose().decompose()
# for k in range(j):
# print(j,k)
# hg = HGate()
# hg = hg.control(len(ctrls)+1, ctrl_state=st+"1")
# qc.append(hg, ctrls + [j] + [k])
return qc
''' |
QPC001_C2 | AD27568DCFEF4 | 8 | TLE | 4000 ms | 102 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import RYGate, HGate, XGate
import math
def dist(L, n):
if L == 1:
return [1.0]
ret = []
for i in range(n):
if L < (1<<(i+1)):
ret.append(max(L - (1<<i),0))
break
else:
if i==0:
ret.append(2)
else:
ret.append(1<<i)
return [r/L for r in ret if r>0]
def w_state(n_qubits: int, L, control, ctrl_state) -> QuantumCircuit:
qc = QuantumCircuit(n_qubits)
seq = dist(L, n_qubits)
#print(seq)
RY = RYGate(-math.asin(seq[0]**0.5)*2)
#qc.append(RY, [0])
if len(control)>0:
RY = RY.control(len(control),ctrl_state=ctrl_state)
qc.append(RY, control + [0])
for i in range(1, len(seq)):
RY = RYGate(-math.asin((seq[i]/sum(seq[i:]))**0.5)*2)
RY = RY.control(len(control)+i,ctrl_state= "0"*i + ctrl_state)
qc.append(RY, control + [j for j in range(i)] + [i])
return qc
def solve(n: int, L: int) -> QuantumCircuit:
if L == 1:
return QuantumCircuit(n)
elif L==2:
qc = QuantumCircuit(n)
qc.h(0)
return qc
for i in range(2,n+1):
if L==(1<<i):
qc = QuantumCircuit(n)
for j in range(i):
qc.h(j)
return qc
# qc = QuantumCircuit(4)
# qc.h(0)
# xg = XGate()
# xg = xg.control(2,ctrl_state="01")
# qc.append(xg, [0,1,2])
# return qc
L += 1
dis = dist(L, n)
binlist = []
for i in range(len(dis)):
if ((1<<i) & (L-1)) > 0:
binlist.append(1)
else:
binlist.append(0)
#print(binlist)
qc = QuantumCircuit(n)
#return w_state(n,L,[], "")
b = 1<<(len(binlist)-1)
L = L -1
l = L
for i in range(len(binlist)):
if binlist[-i-1] == 1:
if i>0:
ctrls = list(range(len(binlist)))[-i:]
else:
ctrls = []
st = bin(L)[2:2+i]
#print(ctrls,st,l)
_qc = w_state(n, l, ctrls, st)
l -= b
qc.append(_qc, range(n))
for j in range(len(binlist)-i-1):
new_st = st + "".join(["1" if j==k else "0" for k in range(1,len(binlist)-i)][::-1])
newctrl = [k for k in range(len(binlist) - len(new_st), len(binlist))]
if j>1:
new_st = new_st[:-j+1]
newctrl = newctrl[j-1:]
#print("newst", new_st, newctrl, j)
if j==0:
xg = XGate()
xg = xg.control(len(newctrl), ctrl_state=new_st)
qc.append(xg, newctrl + [0])
hg = HGate()
hg = hg.control(len(newctrl), ctrl_state=new_st)
qc.append(hg, newctrl + [0])
else:
for k in range(j):
hg = HGate()
hg = hg.control(len(newctrl), ctrl_state=new_st)
qc.append(hg, newctrl + [k])
#break
b //= 2
xg = XGate()
xg = xg.control(n-1, ctrl_state=bin(L + (1<<n))[3:-1])
qc.append(xg, list(range(1,n)) + [0])
qc = qc.decompose()
# for k in range(j):
# print(j,k)
# hg = HGate()
# hg = hg.control(len(ctrls)+1, ctrl_state=st+"1")
# qc.append(hg, ctrls + [j] + [k])
return qc
''' |
QPC001_C2 | AD27568DCFEF4 | 9 | WA | 1804 ms | 95 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import RYGate, HGate, XGate
import math
def dist(L, n):
if L <= 2:
return [1.0]
ret = []
for i in range(n):
if L < (1<<(i+1)):
ret.append(max(L - (1<<i),0))
break
else:
if i==0:
ret.append(2)
else:
ret.append(1<<i)
return [r/L for r in ret if r>0]
def w_state(n_qubits: int, L, control, ctrl_state) -> QuantumCircuit:
qc = QuantumCircuit(n_qubits)
seq = dist(L, n_qubits)
#print(seq)
RY = RYGate(-math.asin((seq[-1])**0.5)*2)
#qc.append(RY, [0])
if len(control)>0:
RY = RY.control(len(control),ctrl_state=ctrl_state)
qc.append(RY, control + [len(seq)-1])
return qc
def solve(n:int, L:int) -> QuantumCircuit:
if L == 1:
return QuantumCircuit(n)
elif L==2:
qc = QuantumCircuit(n)
qc.h(0)
return qc
for i in range(2,n+1):
if L==(1<<i):
qc = QuantumCircuit(n)
for j in range(i):
qc.h(j)
return qc
# qc = QuantumCircuit(4)
# qc.h(0)
# xg = XGate()
# xg = xg.control(2,ctrl_state="01")
# qc.append(xg, [0,1,2])
# return qc
L += 1
dis = dist(L, n)
binlist = []
for i in range(len(dis)):
if ((1<<i) & (L-1)) > 0:
binlist.append(1)
else:
binlist.append(0)
#print(binlist)
qc = QuantumCircuit(n)
#return w_state(n,L,[], "")
b = 1<<(len(binlist)-1)
L = L -1
l = L
for i in range(len(binlist)):
if binlist[-i-1] == 1:
if i>0:
ctrls = list(range(len(binlist)))[-i:]
else:
ctrls = []
st = bin(L)[2:2+i]
#print(ctrls,st,l)
_qc = w_state(n, l, ctrls, st)
l -= b
qc.append(_qc, range(n))
new_st = st + "0"
newctrl = [k for k in range(len(binlist) - len(new_st), len(binlist))]
for j in range(len(binlist)-i-1):
hg = HGate()
hg = hg.control(len(newctrl), ctrl_state=new_st)
qc.append(hg, newctrl + [j])
#break
b //= 2
xg = XGate()
xg = xg.control(n-1, ctrl_state=bin(L + (1<<n))[3:-1])
qc.append(xg, list(range(1,n)) + [0])
qc = qc.decompose()
# for k in range(j):
# print(j,k)
# hg = HGate()
# hg = hg.control(len(ctrls)+1, ctrl_state=st+"1")
# qc.append(hg, ctrls + [j] + [k])
return qc
''' |
QPC001_C2 | AD3961B3E29FC | 1 | UME | '''python
from qiskit import QuantumCircuit
import math
from qiskit import QuantumCircuit
from qiskit.quantum_info import Statevector
import qiskit.circuit.library as qis
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
L -= 1
bits = []
ones = []
for i in range(n-1, -1, -1):
if L & (1<<i) != 0:
bits += [(i, ones.copy(), 1)]
ones += [i]
else:
bits += [(i, ones.copy(), 0)]
for target, controls, bit in bits:
for lsb_ctrl_i in range(len(controls), 0, -1):
ctrl_subset = controls[0:lsb_ctrl_i]
ctrl_state = (1<< (lsb_ctrl_i - 1)) - 1
gate = qis.HGate().control(num_ctrl_qubits=len(ctrl_subset), ctrl_state=ctrl_state)
qc.append(gate, ctrl_subset + [target])
if bit == 1:
left = 1<<target
right = (L % left) + 1
wanted_cos = (left/(left + right))**0.5
theta = math.acos(wanted_cos)*2
gate = qis.RXGate(theta=theta)
if len(controls) != 0:
gate = gate.control(num_ctrl_qubits=len(controls))
qc.append(gate, controls + [target])
return qc
''' | ||
QPC001_C2 | AD3961B3E29FC | 2 | TLE | 6000 ms | 147 MiB | '''python
import math
from qiskit import QuantumCircuit
import qiskit.circuit.library as qis
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
L -= 1
bits = []
ones = []
for i in range(n-1, -1, -1):
if L & (1<<i) != 0:
bits += [(i, ones.copy(), 1)]
ones += [i]
else:
bits += [(i, ones.copy(), 0)]
for target, controls, bit in bits:
for lsb_ctrl_i in range(len(controls), 0, -1):
ctrl_subset = controls[0:lsb_ctrl_i]
ctrl_state = (1<< (lsb_ctrl_i - 1)) - 1
gate = qis.HGate().control(num_ctrl_qubits=len(ctrl_subset), ctrl_state=ctrl_state)
qc.append(gate, ctrl_subset + [target])
if bit == 1:
left = 1<<target
right = (L % left) + 1
wanted_cos = (left/(left + right))**0.5
theta = math.acos(wanted_cos)*2
gate = qis.RXGate(theta=theta)
if len(controls) != 0:
gate = gate.control(num_ctrl_qubits=len(controls))
qc.append(gate, controls + [target])
return qc
''' |
QPC001_C2 | AD3961B3E29FC | 3 | TLE | 6000 ms | 147 MiB | '''python
import math
from qiskit import QuantumCircuit
import qiskit.circuit.library as qis
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
L -= 1
bits = []
ones = []
for i in range(n-1, -1, -1):
if L & (1<<i) != 0:
bits += [(i, len(ones), 1)]
ones += [i]
else:
bits += [(i, len(ones), 0)]
for target, up_to_i_controls, bit in bits:
for lsb_ctrl_i in range(up_to_i_controls, 0, -1):
ctrl_subset = ones[0:lsb_ctrl_i]
ctrl_state = (1<< (lsb_ctrl_i - 1)) - 1
gate = qis.HGate().control(num_ctrl_qubits=len(ctrl_subset), ctrl_state=ctrl_state)
qc.append(gate, ctrl_subset + [target])
if bit == 1:
controls = ones[0:up_to_i_controls]
left = 1<<target
right = (L % left) + 1
wanted_cos = (left/(left + right))**0.5
theta = math.acos(wanted_cos)*2
gate = qis.RXGate(theta=theta)
if len(controls) != 0:
gate = gate.control(num_ctrl_qubits=len(controls))
qc.append(gate, controls + [target])
return qc
''' |
QPC001_C2 | AD3961B3E29FC | 4 | RE | 1406 ms | 140 MiB | '''python
import math
from qiskit import QuantumCircuit
import qiskit.circuit.library as qis
def solve(n: int, L: int) -> QuantumCircuit:
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
L -= 1
ones = []
for target in range(n-1, -1, -1):
bit = L & (1<<target) != 0
for lsb_ctrl_i in range(len(ones), 0, -1):
ctrl_subset = ones[0:lsb_ctrl_i]
ctrl_state = (1<< (lsb_ctrl_i - 1)) - 1
gate = qis.HGate().control(num_ctrl_qubits=len(ctrl_subset), ctrl_state=ctrl_state)
qc.append(gate, ctrl_subset + [target])
if bit == 1:
left = 1<<target
right = (L % left) + 1
wanted_cos = (left/(left + right))**0.5
theta = math.acos(wanted_cos)*2
gate = qis.RXGate(theta=theta)
if len(ones) != 0:
gate = gate.control(num_ctrl_qubits=len(ones))
qc.append(gate, ones + [target])
ones.append(target)
return qc
''' |
QPC001_C2 | AD3961B3E29FC | 5 | RE | 1352 ms | 140 MiB | '''python
import math
from qiskit import QuantumCircuit
import qiskit.circuit.library as qis
def solve(n: int, L: int) -> QuantumCircuit:
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
L -= 1
ones = []
for target in range(n-1, -1, -1):
bit = L & (1<<target) != 0
for lsb_ctrl_i in range(len(ones), 0, -1):
ctrl_subset = ones[0:lsb_ctrl_i]
ctrl_state = (1<< (lsb_ctrl_i - 1)) - 1
gate = qis.HGate().control(num_ctrl_qubits=len(ctrl_subset), ctrl_state=ctrl_state)
qc.append(gate, ctrl_subset + [target])
if bit == 1:
left = 1<<target
right = (L % left) + 1
wanted_cos = (left/(left + right))**0.5
theta = math.acos(wanted_cos)*2
gate = qis.RXGate(theta=theta)
if len(ones) != 0:
gate = gate.control(num_ctrl_qubits=len(ones))
qc.append(gate, ones + [target])
ones.append(target)
return qc
''' |
QPC001_C2 | AD3961B3E29FC | 6 | TLE | 6000 ms | 147 MiB | '''python
import math
from qiskit import QuantumCircuit
import qiskit.circuit.library as qis
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
L -= 1
ones = []
for target in range(n-1, -1, -1):
bit = L & (1<<target) != 0
for lsb_ctrl_i in range(len(ones), 0, -1):
ctrl_subset = ones[0:lsb_ctrl_i]
ctrl_state = (1<< (lsb_ctrl_i - 1)) - 1
gate = qis.HGate().control(num_ctrl_qubits=len(ctrl_subset), ctrl_state=ctrl_state)
qc.append(gate, ctrl_subset + [target])
if bit == 1:
left = 1<<target
right = (L % left) + 1
wanted_cos = (left/(left + right))**0.5
theta = math.acos(wanted_cos)*2
gate = qis.RXGate(theta=theta)
if len(ones) != 0:
gate = gate.control(num_ctrl_qubits=len(ones))
qc.append(gate, ones + [target])
ones.append(target)
return qc
''' |
QPC001_C2 | AD3961B3E29FC | 7 | TLE | 6000 ms | 147 MiB | '''python
import math
from qiskit import QuantumCircuit
import qiskit.circuit.library as qis
import numpy as np
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
L -= 1
ones = []
one_count = 0
inds = np.arange(n)
lefts = np.vectorize(lambda x: 1<<x)(inds)
wanted_coss = np.vectorize(lambda left: (left / (left + ((L%left) + 1))) ** 0.5)(lefts)
thetas = np.vectorize(lambda w: math.acos(w) * 2)(wanted_coss)
for target in range(n-1, -1, -1):
bit = L & (1<<target) != 0
for lsb_ctrl_i in range(len(ones), 0, -1):
ctrl_subset = ones[0:lsb_ctrl_i]
ctrl_state = (1<< (lsb_ctrl_i - 1)) - 1
gate = qis.HGate().control(num_ctrl_qubits=len(ctrl_subset), ctrl_state=ctrl_state)
qc.append(gate, ctrl_subset + [target], copy=False)
if bit == 1:
theta = thetas[target]
gate = qis.RXGate(theta=theta)
if one_count != 0:
gate = gate.control(num_ctrl_qubits=one_count)
qc.append(gate, ones + [target], copy=False)
ones.append(target)
one_count += 1
return qc
''' |
QPC001_C2 | AD3961B3E29FC | 8 | UGE | 1502 ms | 141 MiB | '''python
import math
from qiskit import QuantumCircuit
from qiskit.circuit.library import HGate, RXGate
import numpy as np
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
L -= 1
ones = []
one_count = 0
inds = np.arange(n)
lefts = np.vectorize(lambda x: 1<<x)(inds)
wanted_coss = np.vectorize(lambda left: (left / (left + ((L%left) + 1))) ** 0.5)(lefts)
thetas = np.vectorize(lambda w: math.acos(w) * 2)(wanted_coss)
for target in range(n-1, -1, -1):
bit = L & (1<<target) != 0
for lsb_ctrl_i in range(one_count, 0, -1):
ctrl_subset = ones[0:lsb_ctrl_i]
ctrl_state = (1<< (lsb_ctrl_i - 1)) - 1
gate = HGate().control(num_ctrl_qubits=lsb_ctrl_i, ctrl_state=ctrl_state, annotated=True)
qc.append(gate, ctrl_subset + [target], copy=False)
if bit == 1:
theta = thetas[target]
gate = RXGate(theta=theta)
if one_count != 0:
gate = gate.control(num_ctrl_qubits=one_count, annotated=True)
qc.append(gate, ones + [target], copy=False)
ones.append(target)
one_count += 1
return qc
''' |
QPC001_C2 | AD3961B3E29FC | 9 | TLE | 6000 ms | 147 MiB | '''python
import math
from qiskit import QuantumCircuit
from qiskit.circuit.library import HGate, RXGate
import numpy as np
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
L -= 1
ones = []
one_count = 0
inds = np.arange(n)
lefts = np.vectorize(lambda x: 1<<x)(inds)
wanted_coss = np.vectorize(lambda left: (left / (left + ((L%left) + 1))) ** 0.5)(lefts)
thetas = np.vectorize(lambda w: math.acos(w) * 2)(wanted_coss)
CHs = [HGate()] + [HGate().control(num_ctrl_qubits=i, ctrl_state=(1<<(i-1))-1) for i in range(1, n)]
for target in range(n-1, -1, -1):
bit = L & (1<<target) != 0
for lsb_ctrl_i in range(len(ones), 0, -1):
ctrl_subset = ones[0:lsb_ctrl_i]
gate = CHs[lsb_ctrl_i]
qc.append(gate, ctrl_subset + [target])
if bit == 1:
theta = thetas[target]
gate = RXGate(theta=theta)
if one_count != 0:
gate = gate.control(num_ctrl_qubits=one_count)
qc.append(gate, ones + [target], copy=False)
ones.append(target)
one_count += 1
return qc
''' |
QPC001_C2 | AD3BAEA132211 | 1 | WA | 1862 ms | 144 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import HGate, RYGate
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
M = L
i = n-1
if (L>>i)&1 == 0:
qc.x(i)
else:
theta = -2*math.acos(math.sqrt(2**i/M))
qc.x(i)
qc.ry(theta,i)
CH = HGate().control(n-i)
for j in range(i):
qc.append(CH,list(range(n-1,i-1,-1))+[j])
qc.x(i)
M -= 2**i
for i in range(n-2,-1,-1):
if (L>>i)&1 == 0:
qc.x(i)
else:
theta = -2*math.acos(math.sqrt(2**i/M))
qc.x(i)
qc.append(RYGate(theta).control(n-i-1),range(n-1,i-1,-1))
CH = HGate().control(n-i)
for j in range(i):
qc.append(CH,list(range(n-1,i-1,-1))+[j])
qc.x(i)
M -= 2**i
qc_copy = qc.copy()
for j in range(n-1,i-1,-1):
if (L>>j)&1 == 0:
qc_copy.x(j)
for i in range(n-1,-1,-1):
if (L>>i)&1 == 0:
qc.x(i)
return qc
''' |
QPC001_C2 | AD3BAEA132211 | 2 | AC | 1943 ms | 146 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import HGate, RYGate
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if L==(1<<n):
for i in range(n):
qc.h(i)
else:
M = L
i = n-1
if (L>>i)&1 == 0:
qc.x(i)
else:
theta = -2*math.acos(math.sqrt(2**i/M))
qc.x(i)
qc.ry(theta,i)
CH = HGate().control(n-i)
for j in range(i):
qc.append(CH,list(range(n-1,i-1,-1))+[j])
qc.x(i)
M -= 2**i
for i in range(n-2,-1,-1):
if (L>>i)&1 == 0:
qc.x(i)
else:
theta = -2*math.acos(math.sqrt(2**i/M))
qc.x(i)
qc.append(RYGate(theta).control(n-i-1),range(n-1,i-1,-1))
CH = HGate().control(n-i)
for j in range(i):
qc.append(CH,list(range(n-1,i-1,-1))+[j])
qc.x(i)
M -= 2**i
qc_copy = qc.copy()
for j in range(n-1,i-1,-1):
if (L>>j)&1 == 0:
qc_copy.x(j)
for i in range(n-1,-1,-1):
if (L>>i)&1 == 0:
qc.x(i)
return qc
''' |
QPC001_C2 | AD5933DFFB1E2 | 1 | RE | 1887 ms | 157 MiB | '''python
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if L == 2**n:
for i in range(n):
qc.h(i)
else:
L_code = format(L, f'0{n}b')
m = [n-1-i for i in range(n) if L_code[i] == "1"]
l = [L]
for i in range(len(m)-1):
l.append(l[-1]-2**m[i])
qc.x(m[0])
for i in range(len(m)-1):
split_one_hot(qc,m[i],m[i+1],2**m[i]/l[i])
for i in range(n-1,-1,-1):
if i in m and i !=0:
qc.append(multi_ch(i,n), qargs=range(n-1,-1,-1))
qc.x(i)
for i in range(n-1,-1,-1):
if L_code[i] == "0":
if i != 0:
qc.append(XGate().control(i),qargs=range(n-1,n-2-i,-1))
else:
qc.x(n-1-i)
print(m,l)
return qc
def split_one_hot(qc,m1,m2,l):
print(m1,m2,l)
qc.cry(2*math.acos(math.sqrt(l)),m1,m2)
qc.cx(m2,m1)
def multi_ch(i,n):
# Hゲートだけのサブ回路作成
qch = QuantumCircuit(i)
for j in range(i):
qch.h(j)
# ゲート化 → 多重制御化
h_gate = qch.to_gate()
print(n-i-1)
controlled_h_gate = h_gate.control(n-i)
return controlled_h_gate
''' |
QPC001_C2 | AD5933DFFB1E2 | 2 | AC | 2982 ms | 165 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import XGate
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
if L == 2**n:
for i in range(n):
qc.h(i)
else:
L_code = format(L, f'0{n}b')
m = [n-1-i for i in range(n) if L_code[i] == "1"]
l = [L]
for i in range(len(m)-1):
l.append(l[-1]-2**m[i])
qc.x(m[0])
for i in range(len(m)-1):
split_one_hot(qc,m[i],m[i+1],2**m[i]/l[i])
for i in range(n-1,-1,-1):
if i in m and i !=0:
qc.append(multi_ch(i,n), qargs=range(n-1,-1,-1))
qc.x(i)
for i in range(n-1,-1,-1):
if L_code[i] == "0":
if i != 0:
qc.append(XGate().control(i),qargs=range(n-1,n-2-i,-1))
else:
qc.x(n-1-i)
print(m,l)
return qc
def split_one_hot(qc,m1,m2,l):
print(m1,m2,l)
qc.cry(2*math.acos(math.sqrt(l)),m1,m2)
qc.cx(m2,m1)
def multi_ch(i,n):
# Hゲートだけのサブ回路作成
qch = QuantumCircuit(i)
for j in range(i):
qch.h(j)
# ゲート化 → 多重制御化
h_gate = qch.to_gate()
print(n-i-1)
controlled_h_gate = h_gate.control(n-i)
return controlled_h_gate
''' |
QPC001_C2 | AD9280603CD8A | 1 | AC | 3806 ms | 103 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import HGate
from qiskit.circuit.library import RYGate
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
L2 = L
for i in range(n - 1, -1, -1):
if L2 > (1 << i):
print(i)
for j in range(i + 1, n):
if (((L - 1) >> j) & 1) == 0:
qc.x(j)
theta = math.atan2(math.sqrt(L2 - (1 << i)), math.sqrt(1 << i)) * 2
if i == n - 1:
qc.ry(theta, n - 1)
else:
qc.append(RYGate(theta).control(n - 1 - i), list(range(i + 1, n)) + [i])
qc.x(i)
for j in range(i):
qc.append(HGate().control(n - i), list(range(i, n)) + [j])
qc.x(i)
L2 = L2 - (1 << i)
for j in range(i + 1, n):
if (((L - 1) >> j) & 1) == 0:
qc.x(j)
return qc
''' |
QPC001_C2 | AE70FFAA589E6 | 1 | UGE | 1703 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# 量子状態の次元は 2^n なので、状態ベクトルの長さは 2**n となる
dim = 2 ** n
# 状態ベクトルを初期化
# i = 0, 1, ..., L-1 の各成分に 1/sqrt(L) を設定し、
# それ以外の成分は 0 とする。
# これにより、目的の状態
# |ψ⟩ = (1/√L) (|0⟩ + |1⟩ + ... + |L-1⟩)
# が得られる
state = [0.0] * dim
amp = 1 / np.sqrt(L)
for i in range(L):
state[i] = amp
# 初期状態から目的の状態へ初期化する
# Qiskit ではデフォルトでリトルエンディアンとなっているため、
# list(range(n)) で各量子ビットを指定する
qc.initialize(state, list(range(n)))
return qc
''' |
QPC001_C2 | AE70FFAA589E6 | 2 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import StatePreparation
import numpy as np
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# 2^n 次元の状態ベクトルを用意する．
# 添字 i = 0,1,...,L-1 に対して振幅 1/sqrt(L) を与え，
# i >= L の部分は 0 とする．
dim = 2 ** n
state = np.zeros(dim, dtype=complex)
amp = 1 / np.sqrt(L)
for i in range(L):
state[i] = amp
# StatePreparation クラスは内部で Möttönen型のアルゴリズムにより
# 標準ゲート（Ry, Rz, CNOT など）を用いた回路へ分解される．
# これにより，Initialize などの禁止ゲートを使うことなく目的の状態を作る．
sp = StatePreparation(state)
qc.append(sp, qc.qubits)
return qc
''' | ||
QPC001_C2 | AE70FFAA589E6 | 3 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates import RYGate
import math
import itertools
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# 量子ビットの番号は 0～n-1，
# リトルエンディアンでは整数値は ∑_{j=0}^{n-1} 2^j * (qubit j の値) として読む
# ここでは，最も重みの大きい qubit（番号 n-1）から順に回転を設定する
for k in range(n-1, -1, -1):
# 上位ビットとして制御する qubit の集合は {q_{k+1},...,q_{n-1}}
control_indices = list(range(k+1, n))
# 制御対象の上位ビットの割り当て（分岐）をすべて走査
for prefix in itertools.product([0, 1], repeat=len(control_indices)):
# prefix に対応して，上位ビットが取る値により整数値への寄与は
# P = ∑_{j in control_indices} (bit_j * 2^j)
P = 0
for ctrl, bit in zip(control_indices, prefix):
P += bit * (2 ** ctrl)
# 現在決定する qubitは q_k の重み 2^k で寄与する
# 下位（q_{0}～q_{k-1}）で作れる状態数は 2^k 個
# よって，q_k に 0 を割り当てた場合の有効状態数は
if P >= L:
N0 = 0
else:
N0 = min(2 ** k, L - P)
# q_k に 1 を割り当てた場合は，寄与が 2^k 加わるので
if P + (2 ** k) >= L:
N1 = 0
else:
N1 = min(2 ** k, L - (P + (2 ** k)))
N_total = N0 + N1
# もしこの分岐で有効な状態がなければスキップ
if N_total == 0:
continue
# 回転角は，理想的には
# cos(θ/2) = √(N0/(N0+N1))，すなわち θ = 2·arccos(√(N0/N_total))
# ただし，N0=0 のときは θ = π，また N1=0 のときは θ = 0 とする
if N0 == 0:
theta = math.pi
elif N1 == 0:
theta = 0.0
else:
theta = 2 * math.acos(math.sqrt(N0 / N_total))
# 角度が 0 ならゲート不要
if abs(theta) < 1e-10:
continue
# 制御付き RY ゲートを作成
base_gate = RYGate(theta)
num_controls = len(control_indices)
if num_controls > 0:
controlled_gate = base_gate.control(num_controls)
# デフォルトでは制御は「|1>」の場合に作用するため，
# 制御すべき値が 0 のときは X ゲートで反転させる
for ctrl, bit in zip(control_indices, prefix):
if bit == 0:
qc.x(ctrl)
# 制御 qubit（上位ビット）＋対象 qubit q_k の順番で追加
qc.append(controlled_gate, control_indices + [k])
for ctrl, bit in zip(control_indices, prefix):
if bit == 0:
qc.x(ctrl)
else:
# 制御 qubitがない場合は単純に RY ゲートを適用
qc.append(base_gate, [k])
return qc
''' | ||
QPC001_C2 | AE70FFAA589E6 | 4 | RE | 1410 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates import RYGate
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# 量子ビットの番号は 0～n-1，
# リトルエンディアンでは整数値は ∑_{j=0}^{n-1} 2^j * (qubit j の値) として読む
# ここでは，最も重みの大きい qubit（番号 n-1）から順に回転を設定する
for k in range(n-1, -1, -1):
# 上位ビットとして制御する qubit の集合は {q_{k+1},...,q_{n-1}}
control_indices = list(range(k+1, n))
# 制御対象の上位ビットの割り当て（分岐）をすべて走査
for prefix in itertools.product([0, 1], repeat=len(control_indices)):
# prefix に対応して，上位ビットが取る値により整数値への寄与は
# P = ∑_{j in control_indices} (bit_j * 2^j)
P = 0
for ctrl, bit in zip(control_indices, prefix):
P += bit * (2 ** ctrl)
# 現在決定する qubitは q_k の重み 2^k で寄与する
# 下位（q_{0}～q_{k-1}）で作れる状態数は 2^k 個
# よって，q_k に 0 を割り当てた場合の有効状態数は
if P >= L:
N0 = 0
else:
N0 = min(2 ** k, L - P)
# q_k に 1 を割り当てた場合は，寄与が 2^k 加わるので
if P + (2 ** k) >= L:
N1 = 0
else:
N1 = min(2 ** k, L - (P + (2 ** k)))
N_total = N0 + N1
# もしこの分岐で有効な状態がなければスキップ
if N_total == 0:
continue
# 回転角は，理想的には
# cos(θ/2) = √(N0/(N0+N1))，すなわち θ = 2·arccos(√(N0/N_total))
# ただし，N0=0 のときは θ = π，また N1=0 のときは θ = 0 とする
if N0 == 0:
theta = math.pi
elif N1 == 0:
theta = 0.0
else:
theta = 2 * math.acos(math.sqrt(N0 / N_total))
# 角度が 0 ならゲート不要
if abs(theta) < 1e-10:
continue
# 制御付き RY ゲートを作成
base_gate = RYGate(theta)
num_controls = len(control_indices)
if num_controls > 0:
controlled_gate = base_gate.control(num_controls)
# デフォルトでは制御は「|1>」の場合に作用するため，
# 制御すべき値が 0 のときは X ゲートで反転させる
for ctrl, bit in zip(control_indices, prefix):
if bit == 0:
qc.x(ctrl)
# 制御 qubit（上位ビット）＋対象 qubit q_k の順番で追加
qc.append(controlled_gate, control_indices + [k])
for ctrl, bit in zip(control_indices, prefix):
if bit == 0:
qc.x(ctrl)
else:
# 制御 qubitがない場合は単純に RY ゲートを適用
qc.append(base_gate, [k])
return qc
''' |
QPC001_C2 | AE70FFAA589E6 | 5 | DLE | 2419 ms | 172 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates import RYGate
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# リトルエンディアン：整数は q_0 が最下位ビットとして解釈される
# k: 現在制御対象とする qubit（重み 2^k）のインデックス．
# 上位ビットは q_{k+1}, ..., q_{n-1} となるため，k は n-1 から 0 まで走査する
for k in range(n-1, -1, -1):
# 上位ビットのインデックス
control_indices = list(range(k+1, n))
num_controls = len(control_indices)
# control_indices に対応する全割り当て（ビット列）を生成する．
# itertools.product を使わず，0 から 2^(num_controls)-1 までの整数の2進数表現を用いる
if num_controls == 0:
prefixes = [[]]
else:
prefixes = []
for x in range(2 ** num_controls):
prefix = []
# 桁数は num_controls．
# 制御ビットの順序は control_indices の順序と合わせるため，
# 最上位桁から順に取り出す
for i in range(num_controls):
# i = 0 で最上位ビット，i = num_controls-1 で最下位ビットとなるようにする
bit = (x >> (num_controls - 1 - i)) & 1
prefix.append(bit)
prefixes.append(prefix)
# 各分岐（上位ビットの特定の割り当て）ごとに，
# q_k に適用する制御付き RY ゲートを決定する
for prefix in prefixes:
# 上位ビットが与える整数値 P = sum_{j in control_indices} (bit_j * 2^j)
P = 0
for ctrl, bit in zip(control_indices, prefix):
P += bit * (2 ** ctrl)
# q_k の重みは 2^k
# q_k に 0 を割り当てた場合の，有効な状態数 N0:
if P >= L:
N0 = 0
else:
N0 = min(2 ** k, L - P)
# q_k に 1 を割り当てた場合の，有効な状態数 N1:
if P + (2 ** k) >= L:
N1 = 0
else:
N1 = min(2 ** k, L - (P + (2 ** k)))
N_total = N0 + N1
if N_total == 0:
continue
# 回転角 θ を決定する．
# 特に，N0 == 0 のときは θ = π，N1 == 0 のときは θ = 0 とする．
if N0 == 0:
theta = math.pi
elif N1 == 0:
theta = 0.0
else:
theta = 2 * math.acos(math.sqrt(N0 / N_total))
# 角度が 0 に近ければゲートを省略
if abs(theta) < 1e-10:
continue
base_gate = RYGate(theta)
if num_controls > 0:
# 制御付きゲートを作成
controlled_gate = base_gate.control(num_controls)
# 標準では制御が |1⟩ のときに作用するため，
# 制御すべき値が 0 の場合は前後に X ゲートを挿入する
for ctrl, bit in zip(control_indices, prefix):
if bit == 0:
qc.x(ctrl)
qc.append(controlled_gate, control_indices + [k])
for ctrl, bit in zip(control_indices, prefix):
if bit == 0:
qc.x(ctrl)
else:
# 制御ビットがなければ，そのまま RY ゲートを適用
qc.append(base_gate, [k])
return qc
''' |
QPC001_C2 | AE70FFAA589E6 | 6 | TLE | 3000 ms | 187 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates import RYGate, HGate
import math
# 補助関数：サブ回路の各命令を「制御付き」にしてメイン回路 qc に追加する
def add_controlled_subcircuit(qc, subcircuit, control_qubit, target_qubits, control_value):
# 制御すべき値が 0 の場合は、前後に X を入れて反転制御とする
if control_value == 0:
qc.x(control_qubit)
# サブ回路に含まれる各命令について
for instr, qargs, _ in subcircuit.data:
# サブ回路内の量子ビットの位置を target_qubits に対応付ける
new_qargs = []
for q in qargs:
idx = subcircuit.qubits.index(q)
new_qargs.append(target_qubits[idx])
# 制御付き版のゲートを作成（1 つの制御を追加）
controlled_gate = instr.control(1)
# 制御 qubit を先頭に、対象 qubit をその後に指定して追加
qc.append(controlled_gate, [control_qubit] + new_qargs)
if control_value == 0:
qc.x(control_qubit)
# 再帰的に、指定された量子ビット集合 q_list 上で
# 状態 |ψ⟩ = 1/√L ∑_{i=0}^{L-1} |i⟩ (リトルエンディアン) を作る回路を返す
def prepare_state(q_list, L):
n = len(q_list)
qc = QuantumCircuit(n)
if n == 0:
return qc
# 1量子ビットの場合
if n == 1:
if L == 1:
# 状態 |0⟩ のままでよい
return qc
elif L == 2:
# (|0⟩+|1⟩)/√2 を作る → H ゲート
qc.h(q_list[0])
return qc
# もし L = 2^n なら全状態に均一振幅 → 各 qubit に H
if L == 2**n:
for q in q_list:
qc.h(q)
return qc
# n ≥ 2 かつ L < 2^n の場合
# q_list の最後の量子ビットを MSB (q_m)、残りを下位 (Q_low) とする
N_low = 2**(n-1)
if L <= N_low:
# 下位側だけに状態が存在する → q_m は |0⟩ のまま、
# 下位 n-1 量子ビットで問題を再帰的に解く
sub_qc = prepare_state(q_list[:-1], L)
qc.compose(sub_qc, qubits=range(n-1), inplace=True)
return qc
else:
# L > N_low なら、ブロック分割
L0 = N_low # q_m=0 側に対応する状態数（0～2^(n-1)-1）
L1 = L - N_low # q_m=1 側（残り）の状態数
# q_m に対して、以下を満たすよう RY 回転を適用
# cos(θ/2)=√(L0/L), sin(θ/2)=√(L1/L)
theta = 2 * math.acos(math.sqrt(L0 / L))
qc.ry(theta, q_list[-1])
# --- 下位側の回路を条件付きで適用 ---
# branch 0 (q_m = 0)：下位側は「全状態（2^(n-1) 個）」＝ uniform
uniform = QuantumCircuit(n-1)
for i in range(n-1):
uniform.h(uniform.qubits[i])
# branch 1 (q_m = 1)：下位側を再帰的に L1 個の状態に準備
rec = prepare_state(list(range(n-1)), L1)
# controlled subcircuit を追加
# まず、q_m が 1 のときに rec を適用
add_controlled_subcircuit(qc, rec, control_qubit=q_list[-1], target_qubits=q_list[:-1], control_value=1)
# 次に、q_m が 0 のときに uniform を適用
add_controlled_subcircuit(qc, uniform, control_qubit=q_list[-1], target_qubits=q_list[:-1], control_value=0)
return qc
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# 特別ケース：もし L = 2^n なら全状態に均一 →各 qubitに H を適用
if L == 2**n:
for q in range(n):
qc.h(q)
return qc
# 再帰的状態準備回路を作成（リトルエンディアン：qubit 0 が LSB，qubit n-1 が MSB）
prep = prepare_state(list(range(n)), L)
qc.compose(prep, qubits=range(n), inplace=True)
return qc
''' |
QPC001_C2 | AE70FFAA589E6 | 7 | TLE | 3000 ms | 176 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates import RYGate, HGate
import math
# サブ回路を一括で制御付き化する補助関数
def add_controlled_subcircuit(qc, subcircuit, control_qubit, target_qubits, control_value):
# subcircuit をゲート化して一括制御付きゲートに変換
gate = subcircuit.to_gate()
controlled_gate = gate.control(1)
if control_value == 0:
qc.x(control_qubit)
qc.append(controlled_gate, [control_qubit] + target_qubits)
if control_value == 0:
qc.x(control_qubit)
# memo[(n, L)] に対して既に作成した回路を記憶する
memo = {}
# n 量子ビット上で、状態 |ψ⟩ = 1/√L ∑_{i=0}^{L-1} |i⟩ を作る回路（ローカル回路）を返す関数
def prepare_state(n, L):
if (n, L) in memo:
return memo[(n, L)]
qc = QuantumCircuit(n)
if n == 0:
memo[(n, L)] = qc
return qc
# 1量子ビットの場合
if n == 1:
if L == 1:
memo[(n, L)] = qc # |0⟩ のままでよい
return qc
elif L == 2:
qc.h(0) # (|0⟩+|1⟩)/√2
memo[(n, L)] = qc
return qc
# すべての状態が有効なら、各 qubit に H を適用
if L == 2**n:
for i in range(n):
qc.h(i)
memo[(n, L)] = qc
return qc
# n ≥ 2 かつ L < 2^n の場合
# ※ローカル回路では qubit 0～n-2 を下位、qubit n-1 を MSB とする（リトルエンディアン）
if L <= 2**(n-1):
# 有効な状態は下位側にすべて含まれる：MSBは |0⟩ のまま
sub = prepare_state(n-1, L)
qc.compose(sub, qubits=list(range(n-1)), inplace=True)
memo[(n, L)] = qc
return qc
else:
# L > 2^(n-1)
L0 = 2**(n-1) # branch q_{n-1} = 0 側の状態数
L1 = L - L0 # branch q_{n-1} = 1 側の状態数
# q_{n-1} に対して RY 回転： cos(θ/2)=√(L0/L), sin(θ/2)=√(L1/L)
theta = 2 * math.acos(math.sqrt(L0 / L))
qc.ry(theta, n-1)
# branch 1 (q_{n-1} = 1)：下位 n-1 量子ビットで再帰的に L1 個の状態を作る
rec = prepare_state(n-1, L1)
add_controlled_subcircuit(qc, rec, control_qubit=n-1, target_qubits=list(range(n-1)), control_value=1)
# branch 0 (q_{n-1} = 0)：下位 n-1 量子ビットで全状態（2^(n-1) 個）を均一に作る
uniform = QuantumCircuit(n-1)
for i in range(n-1):
uniform.h(i)
add_controlled_subcircuit(qc, uniform, control_qubit=n-1, target_qubits=list(range(n-1)), control_value=0)
memo[(n, L)] = qc
return qc
def solve(n: int, L: int) -> QuantumCircuit:
global memo
memo = {} # 各呼び出しでメモをリセット
# 特別ケース：全状態が有効なら各 qubit に H を適用
if L == 2**n:
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
return qc
# 再帰的状態準備回路（ローカル回路）をそのまま返す
qc = prepare_state(n, L)
return qc
''' |
QPC001_C2 | AE70FFAA589E6 | 8 | RE | 1464 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates import RYGate
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# controlled_gate_cache のキーは (num_controls, rounded_theta) で、
# 値は対応する controlled-RY ゲート
controlled_gate_cache = {}
# 事前に 2^i を計算しておく（i=0,...,n）
pows = [1 << i for i in range(n+1)] # 1<<i は 2^i
# 量子ビットの番号は 0～n-1（リトルエンディアン：qubit 0 が最下位）
# k を MSB側からLSB側へ（n-1 から 0）順に処理
for k in range(n-1, -1, -1):
# 上位（MSB側）の qubit のリスト（制御に使う）
control_indices = list(range(k+1, n))
num_controls = len(control_indices)
# 上位ビットの全割り当てを作成（itertools を使わずに 0～2^(num_controls)-1 でループ）
if num_controls == 0:
prefixes = [[]]
else:
num_prefixes = 1 << num_controls
prefixes = []
for x in range(num_prefixes):
prefix = []
for i in range(num_controls):
# 上位桁から順に取り出す
bit = (x >> (num_controls - 1 - i)) & 1
prefix.append(bit)
prefixes.append(prefix)
# 各分岐について回転角を計算し、controlled-RY ゲートを追加
for prefix in prefixes:
# 上位ビット（control_indices）の割り当てから整数 P を計算
# P = ∑_{ctrl in control_indices} (bit × 2^(ctrl))
P = 0
for ctrl, bit in zip(control_indices, prefix):
P += bit * (1 << ctrl)
# 現在対象とする qubit k の重みは 2^k
if P >= L:
N0 = 0
else:
N0 = min(pows[k], L - P)
if P + pows[k] >= L:
N1 = 0
else:
N1 = min(pows[k], L - (P + pows[k]))
N_total = N0 + N1
if N_total == 0:
continue
# 回転角 θ を決定
# ・もし N0 == 0 なら、θ = π（必ず 1 を選ぶ）
# ・もし N1 == 0 なら、θ = 0（変化なし）
# ・それ以外なら、cos(θ/2) = √(N0/N_total)
if N0 == 0:
theta = math.pi
elif N1 == 0:
theta = 0.0
else:
ratio = N0 / N_total
# 浮動小数点の誤差対策
if ratio < 0: ratio = 0
if ratio > 1: ratio = 1
theta = 2 * math.acos(math.sqrt(ratio))
if abs(theta) < 1e-10:
continue
# controlled-RY ゲートのキャッシュキー
key = (num_controls, round(theta, 12))
if key in controlled_gate_cache:
controlled_gate = controlled_gate_cache[key]
else:
controlled_gate = RYGate(theta).control(num_controls)
controlled_gate_cache[key] = controlled_gate
# 制御付きの場合、標準では制御が |1⟩ で作用するため、
# 制御すべきビットが 0 の場合は X ゲートを前後に挿入して反転制御とする
if num_controls > 0:
for ctrl, bit in zip(control_indices, prefix):
if bit == 0:
qc.x(ctrl)
qc.append(controlled_gate, control_indices + [k])
for ctrl, bit in zip(control_indices, prefix):
if bit == 0:
qc.x(ctrl)
else:
qc.append(RYGate(theta), [k])
return qc
''' |
QPC001_C2 | AE70FFAA589E6 | 9 | TLE | 3000 ms | 184 MiB | '''python
from qiskit import QuantumCircuit
import math
def prepare_uniform(n, L):
"""
n 量子ビット上で、状態
|ψ⟩ = 1/√L ∑_{i=0}^{L-1} |i⟩
（リトルエンディアン: qubit 0 が LSB, qubit n-1 が MSB）
を作る QuantumCircuit を返す。
"""
qc = QuantumCircuit(n)
if n == 0:
return qc
# 1量子ビットの場合
if n == 1:
if L == 1:
return qc # |0⟩ のまま
elif L == 2:
qc.h(0) # (|0⟩+|1⟩)/√2
return qc
# 全状態が有効なら、すべての qubit に H を適用
if L == 2**n:
for i in range(n):
qc.h(i)
return qc
# ここから n ≥ 2 かつ L < 2^n の場合
m = 2**(n-1) # 下位 n-1 量子ビットで作れる状態数
if L <= m:
# 有効な状態は MSB = 0 側にのみ存在
sub = prepare_uniform(n-1, L)
qc.compose(sub, qubits=list(range(n-1)), inplace=True)
# MSB (qubit n-1) はそのまま |0⟩ のまま
return qc
else:
# L > m の場合
L0 = m # MSB = 0 側の状態数（全ての状態）
L1 = L - m # MSB = 1 側の状態数
# MSB (qubit n-1) に対して RY 回転を適用
theta = 2 * math.acos(math.sqrt(L0 / L))
qc.ry(theta, n-1)
# branch for MSB = 0: 下位 n-1 量子ビットに対して「全状態の均一状態」
qc0 = QuantumCircuit(n-1)
for i in range(n-1):
qc0.h(i)
# branch for MSB = 1: 下位 n-1 量子ビットに対して再帰的に L1 個の状態を作る
qc1 = prepare_uniform(n-1, L1)
# 制御付きゲートとしてまとめる（.to_gate() を用いて一括で制御付きに）
gate1 = qc1.to_gate()
cgate1 = gate1.control(1)
gate0 = qc0.to_gate()
cgate0 = gate0.control(1)
# branch 1: MSB が |1⟩ のときに下位に qc1 を適用（制御が |1⟩ でそのまま作用）
qc.append(cgate1, [n-1] + list(range(n-1)))
# branch 0: MSB が |0⟩ のときに下位に qc0 を適用（制御が |0⟩ となるよう、前後に X を挿入）
qc.x(n-1)
qc.append(cgate0, [n-1] + list(range(n-1)))
qc.x(n-1)
return qc
def solve(n: int, L: int) -> QuantumCircuit:
"""
入力:
n: 量子ビット数
L: 有効な状態数（1 ≤ L ≤ 2^n）
出力:
測定時に状態 |0⟩, |1⟩, ..., |L-1⟩ が等確率で観測される状態
|ψ⟩ = 1/√L ∑_{i=0}^{L-1} |i⟩ を作り出す QuantumCircuit
"""
qc = QuantumCircuit(n)
# 特別ケース：全状態が有効なら各 qubit に H を適用
if L == 2**n:
for i in range(n):
qc.h(i)
return qc
# 再帰的状態準備回路を生成し、メイン回路に合成
prep = prepare_uniform(n, L)
qc.compose(prep, qubits=range(n), inplace=True)
return qc
''' |
QPC001_C2 | AE70FFAA589E6 | 10 | DLE | 1587 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates import RYGate
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# controlled_gate_cache のキーは (num_controls, rounded_theta)
controlled_gate_cache = {}
# 事前に 2^(i) を計算（i=0,...,n）
pows = [1 << i for i in range(n+1)]
# レベル k = 0,...,n-1 について処理する
# ※レベル 0 →接頭辞は空（1 通り）：このときターゲットは qubit n-1（MSB）
# レベル k のとき、接頭辞の長さは k、対象の qubitは q_{n-1-k}、制御 qubitは q_{n-1},…,q_{n-k}
for k in range(0, n):
target = n - 1 - k
num_controls = k # 接頭辞の長さ
num_prefixes = 1 << k # 2^k 通り
for b in range(num_prefixes):
# ノードの offset = b * 2^(n-k)
offset = b * (1 << (n - k))
if offset >= L:
continue # この枝は全て零
width = 1 << (n - k)
half = 1 << (n - k - 1) # 2^(n-k-1)
# 左側の非零葉数
left_count = min(half, L - offset) if offset < L else 0
# 右側の非零葉数
if offset + half < L:
right_count = min(half, L - (offset + half))
else:
right_count = 0
# 回転角の決定
if left_count == 0:
theta = math.pi
elif right_count == 0:
theta = 0.0
else:
theta = 2 * math.atan(math.sqrt(right_count / left_count))
if abs(theta) < 1e-10:
continue # わずかな回転ならスキップ
if num_controls == 0:
# 制御が不要の場合：単にターゲット qubitに RY を適用
qc.ry(theta, target)
else:
key = (num_controls, round(theta, 12))
if key in controlled_gate_cache:
controlled_ry = controlled_gate_cache[key]
else:
base_gate = RYGate(theta)
controlled_ry = base_gate.control(num_controls)
controlled_gate_cache[key] = controlled_ry
# 制御 qubitのリスト（順序は: q_{n-1}, q_{n-2}, …, q_{n-k}）
controls = [n - 1 - i for i in range(num_controls)]
# 接頭辞 b の各桁（長さ k）のうち、値が 0 の場合は X ゲートで反転
for i in range(num_controls):
desired = (b >> (k - 1 - i)) & 1
if desired == 0:
qc.x(controls[i])
# 制御付きゲートを追加
qc.append(controlled_ry, controls + [target])
# 反転用の X ゲートを元に戻す
for i in range(num_controls):
desired = (b >> (k - 1 - i)) & 1
if desired == 0:
qc.x(controls[i])
return qc
''' |
QPC001_C2 | AE70FFAA589E6 | 11 | TLE | 3000 ms | 191 MiB | '''python
from qiskit import QuantumCircuit
import math
def prepare_state_be(n: int, L: int) -> QuantumCircuit:
"""
大端（big‐endian）表現で、n 量子ビット上に
|ψ⟩ = (1/√L) ∑_{i=0}^{L-1} |i⟩
（ただし、i は 0～2^n-1 のうち、i < L のものにのみ非零振幅）
を作る回路を再帰的に構成する。
※ここでは、量子回路の 0 番目の qubit を MSB として扱う。
"""
qc = QuantumCircuit(n)
if n == 0:
return qc
# 1量子ビットの場合
if n == 1:
if L == 1:
# |0>
return qc
elif L == 2:
# (|0>+|1>)/√2
qc.h(0)
return qc
# 2^({n-1}) を T とする
T = 1 << (n - 1) # 2^(n-1)
L0 = L if L < T else T # 数は min(L, 2^(n-1))
L1 = L - L0 # 残り（L1 は 0 の場合もあり）
p0 = L0 / L
# R_y 回転の角度 θ で、cos(θ/2)=√p0, sin(θ/2)=√(1-p0)
theta = 2 * math.acos(math.sqrt(p0))
qc.ry(theta, 0) # 0 番目（MSB）に適用
# 残り n-1 量子ビットは、qubits 1...n-1
if L0 > 0:
# branch for MSB = 0 : 対象は下位部分で i in {0, ..., L0-1}
sub0 = prepare_state_be(n - 1, L0)
# 制御が 0 で作用するようにする：X を前後に入れる
qc.x(0)
qc.append(sub0.to_gate().control(1), [0] + list(range(1, n)))
qc.x(0)
if L1 > 0:
# branch for MSB = 1 : 対象は下位部分で i in {0, ..., L1-1}
sub1 = prepare_state_be(n - 1, L1)
qc.append(sub1.to_gate().control(1), [0] + list(range(1, n)))
return qc
def reverse_qubits(qc: QuantumCircuit) -> QuantumCircuit:
"""
量子回路 qc の qubit の順序を反転（SWAP を用いてリトルエンディアンにする）。
ここでは、qc.qubits[0] を最下位とするリトルエンディアンに変換する。
"""
n = qc.num_qubits
for i in range(n // 2):
qc.swap(i, n - 1 - i)
return qc
def solve(n: int, L: int) -> QuantumCircuit:
"""
入力: 量子ビット数 n, 有効な状態数 L (1 ≤ L ≤ 2^n)
出力: 測定時に、状態 |0>, |1>, …, |L-1> が等確率で観測され、
かつ振幅の二乗和が 1（正規化済み）の状態 |ψ⟩ を作る回路。
※内部では、大端表現で状態準備を行い、最後に SWAP でリトルエンディアンに変換する。
"""
# 特別ケース：L == 2^n なら単に各 qubit に H を適用
if L == (1 << n):
qc = QuantumCircuit(n)
for i in range(n):
qc.h(i)
return qc
# まず、大端表現で状態準備回路を作る
qc_be = prepare_state_be(n, L)
# 次に、qubit の順序を反転してリトルエンディアンにする
qc_le = reverse_qubits(qc_be)
return qc_le
''' |
QPC001_C2 | AE70FFAA589E6 | 12 | WA | 2039 ms | 165 MiB | '''python
import math
from qiskit import QuantumCircuit
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# まず，対象となる状態ベクトル (長さ 2^n) を
# little–endianで「i < L なら1/sqrt(L)，それ以外は 0」と定義する．
# しかし，uniformly–controlled rotation のアルゴリズムは
# 回路中で big–endian順（すなわち反転した順番）の状態を作るので，
# ここではまず psi_big[j] = 1/sqrt(L) if bit_reverse(j) < L, else 0
# と定義する．bit_reverse(j) は n–bit の j のビット反転．
N = 2**n
psi_big = [0.0] * N
for j in range(N):
# bit–reverse: j の n–bit 表現のビット順を反転する
rev = 0
temp = j
for _ in range(n):
rev = (rev << 1) | (temp & 1)
temp //= 2
if rev < L:
psi_big[j] = 1.0 / math.sqrt(L)
else:
psi_big[j] = 0.0
# uniformly–controlled Ry のアルゴリズム
# 以下のループは，k=0,1,...,n–1 で，
# それぞれ「対象ワイヤ target = n-k-1 に，
# 以前に処理した（上位）ワイヤの状態 j（k–bit文字列）に対して，
# 角度 theta(j) = 2 arccos sqrt( (sum_{l=0}^{2^(n-k-1)-1}|a_{j*2^(n-k)+l}|^2)
# /(sum_{l=0}^{2^(n-k)-1}|a_{j*2^(n-k)+l}|^2 ) )
# を用いた Ry を適用する」というものです．
#
# 注意: ここでは制御付きゲートは「通常制御が 1 のとき作動する」ので，
# もし制御ビットに対応する j のビットが 0 であれば，
# そのビットに対して X–ゲートを前後に適用しています．
for k in range(n):
step = 2 ** (n - k) # ブロックの長さ
half = 2 ** (n - k - 1) # ブロック前半の長さ
# k 進段では，j = 0,...,2^k - 1 の各制御パターンに対して
for j in range(2 ** k):
base = j * step
# denominator = sum_{l=0}^{step-1} |psi_big[base+l]|^2
denom = 0.0
for l in range(step):
denom += psi_big[base + l] ** 2
if abs(denom) < 1e-12:
continue # このブロックはゼロベクトルなのでスキップ
num = 0.0
for l in range(half):
num += psi_big[base + l] ** 2
ratio = num / denom
# 浮動小数点誤差対策：ratio ∈ [0,1]に
ratio = min(max(ratio, 0.0), 1.0)
theta = 2 * math.acos(math.sqrt(ratio))
if abs(theta) < 1e-12:
continue # 回転角がほぼ 0 なら省略
target = n - k - 1 # この段の対象ワイヤ
if k == 0:
# 制御ビットがない場合は通常の Ry
qc.ry(theta, target)
else:
# 制御ビットは，これまでに処理済みの上位ワイヤ（big–endian順）
# ここでは，制御ワイヤは [n-1, n-2, …, n-k]（降順）とする．
control_qubits = list(range(n - k, n))
# 制御パターンは，j を k–bit の 2進数で表したもの
bin_str = format(j, '0{}b'.format(k))
# もし対応するビットが '0' なら X–ゲートで反転（前後に挿入）
for idx, bit in zip(control_qubits, bin_str):
if bit == '0':
qc.x(idx)
# 多重制御付き Ry（ancilla なしモード）
qc.mcry(theta, control_qubits, target, None, mode='noancilla')
for idx, bit in zip(control_qubits, bin_str):
if bit == '0':
qc.x(idx)
# ここまでの手続きで，psi_big を作る回路ができあがっている．
# しかし，psi_big で作られた状態は回路中では big–endian表記となっているので，
# 最後にワイヤの順番を反転する（SWAP）ことで little–endian に合わせる．
for i in range(n // 2):
qc.swap(i, n - i - 1)
return qc
''' |
QPC001_C2 | AEB7ECC5D922C | 1 | WA | 959 ms | 90 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# グローバル位相は無視して良いので、全部ひっくり返す場合は何もしない
if L == 1 << n:
for i in range(n):
qc.h(i)
return qc
# 引く
# L2 = (1 << n) - L
# print("L2 = ", L2)
# for i in range(n):
# if L2 & (1 << (n - i - 1)) != 0:
# print("i = ", i)
# controls = []
# for k in range(i):
# controls.append(n-1-k)
# if len(controls) > 0:
# qc.mcp(math.pi, controls, n-1-i)
# else:
# qc.z(n-1-i)
# qc.x(n-1-i)
# for i in reversed(range(n)):
# if L2 & (1 << (n - i - 1)) != 0:
# qc.x(n-1-i)
return qc
''' |
QPC001_C2 | AEB7ECC5D922C | 2 | WA | 1024 ms | 90 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# グローバル位相は無視して良いので、全部ひっくり返す場合は何もしない
if L == 1 << n:
for i in range(n):
qc.h(i)
return qc
rem = L
controls = []
for i in reversed(range(n)):
if rem >= 1 << i:
n0 = 1 << i
n1 = rem - n0
print(f"i = {i}, {rem} -> {n0}, {n1}")
r0 = math.acos(math.sqrt(n0/(n0+n1)))*2.0
r1 = math.acos(math.sqrt(n1/(n0+n1)))*2.0
if len(controls) > 0:
for k in controls:
qc.x(k)
qc.mcry(r0, controls, i)
qc.x(i)
controls.append(i)
for k in range(i):
qc.ry(math.pi / 4.0, k)
qc.mcrz(math.pi, controls, k)
qc.ry(-math.pi / 4.0, k)
controls = controls[:-1]
qc.x(i)
for k in controls:
qc.x(k)
else:
qc.ry(r1, i)
rem = n1
controls.append(i)
return qc
''' |
QPC001_C2 | AEB7ECC5D922C | 3 | WA | 1223 ms | 91 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# グローバル位相は無視して良いので、全部ひっくり返す場合は何もしない
if L == 1 << n:
for i in range(n):
qc.h(i)
return qc
rem = L
controls = []
for i in reversed(range(n)):
if rem >= 1 << i:
n0 = 1 << i
n1 = rem - n0
print(f"i = {i}, {rem} -> {n0}, {n1}")
r0 = math.acos(math.sqrt(n0/(n0+n1)))*2.0
r1 = math.acos(math.sqrt(n1/(n0+n1)))*2.0
if len(controls) > 0:
for k in controls:
qc.x(k)
qc.mcry(r0, controls, i)
qc.x(i)
controls.append(i)
for k in range(i):
qc.ry(math.pi / 4.0, k)
# qc.mcrz(math.pi, controls, k)
qc.ry(-math.pi / 4.0, k)
controls = controls[:-1]
qc.x(i)
for k in controls:
qc.x(k)
else:
qc.ry(r1, i)
rem = n1
controls.append(i)
return qc
''' |
QPC001_C2 | AEB7ECC5D922C | 4 | WA | 1041 ms | 90 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# グローバル位相は無視して良いので、全部ひっくり返す場合は何もしない
if L == 1 << n:
for i in range(n):
qc.h(i)
return qc
rem = L
controls = []
for i in reversed(range(n)):
if rem >= 1 << i:
n0 = 1 << i
n1 = rem - n0
print(f"i = {i}, {rem} -> {n0}, {n1}")
r0 = math.acos(math.sqrt(n0/(n0+n1)))*2.0
r1 = math.acos(math.sqrt(n1/(n0+n1)))*2.0
if len(controls) > 0:
for k in controls:
qc.x(k)
# qc.mcry(r0, controls, i)
qc.x(i)
controls.append(i)
for k in range(i):
qc.ry(math.pi / 4.0, k)
# qc.mcrz(math.pi, controls, k)
qc.ry(-math.pi / 4.0, k)
controls = controls[:-1]
qc.x(i)
for k in controls:
qc.x(k)
else:
qc.ry(r1, i)
rem = n1
controls.append(i)
return qc
''' |
QPC001_C2 | AEB7ECC5D922C | 5 | WA | 949 ms | 90 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# グローバル位相は無視して良いので、全部ひっくり返す場合は何もしない
if L == 1 << n:
for i in range(n):
qc.h(i)
return qc
rem = L
controls = []
for i in reversed(range(n)):
if rem >= 1 << i:
n0 = 1 << i
n1 = rem - n0
print(f"i = {i}, {rem} -> {n0}, {n1}")
r0 = math.acos(math.sqrt(n0/(n0+n1)))*2.0
r1 = math.acos(math.sqrt(n1/(n0+n1)))*2.0
if len(controls) > 0:
for k in controls:
qc.x(k)
#qc.mcry(r0, controls, i)
qc.x(i)
controls.append(i)
for k in range(i):
qc.ry(math.pi / 4.0, k)
qc.mcrz(math.pi, controls, k)
qc.ry(-math.pi / 4.0, k)
controls = controls[:-1]
qc.x(i)
for k in controls:
qc.x(k)
else:
qc.ry(r1, i)
rem = n1
controls.append(i)
return qc
''' |
QPC001_C2 | AEB7ECC5D922C | 6 | WA | 1259 ms | 90 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# グローバル位相は無視して良いので、全部ひっくり返す場合は何もしない
if L == 1 << n:
for i in range(n):
qc.h(i)
return qc
rem = L
controls = []
for i in reversed(range(n)):
if rem >= 1 << i:
n0 = 1 << i
n1 = rem - n0
print(f"i = {i}, {rem} -> {n0}, {n1}")
r0 = math.acos(math.sqrt(n0/(n0+n1)))*2.0
r1 = math.acos(math.sqrt(n1/(n0+n1)))*2.0
if len(controls) > 0:
for k in controls:
qc.x(k)
qc.mcry(r0, controls, i)
qc.x(i)
controls.append(i)
for k in range(i):
qc.ry(math.pi / 4.0, k)
qc.mcp(math.pi, controls, k)
qc.ry(-math.pi / 4.0, k)
controls = controls[:-1]
qc.x(i)
for k in controls:
qc.x(k)
else:
qc.ry(r1, i)
rem = n1
controls.append(i)
return qc
''' |
QPC001_C2 | AEB7ECC5D922C | 7 | WA | 995 ms | 91 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# グローバル位相は無視して良いので、全部ひっくり返す場合は何もしない
if L == 1 << n:
for i in range(n):
qc.h(i)
return qc
rem = L
controls = []
for i in reversed(range(n)):
if rem >= 1 << i:
n0 = 1 << i
n1 = rem - n0
print(f"i = {i}, {rem} -> {n0}, {n1}")
r0 = math.acos(math.sqrt(n0/(n0+n1)))*2.0
r1 = math.acos(math.sqrt(n1/(n0+n1)))*2.0
if len(controls) > 0:
for k in controls:
qc.x(k)
qc.mcry(r0, controls, i)
qc.x(i)
controls.append(i)
for k in range(i):
qc.ry(-math.pi / 4.0, k)
qc.mcp(math.pi, controls, k)
qc.ry(math.pi / 4.0, k)
controls = controls[:-1]
qc.x(i)
for k in controls:
qc.x(k)
else:
qc.ry(r1, i)
rem = n1
controls.append(i)
return qc
''' |
QPC001_C2 | AEB7ECC5D922C | 8 | WA | 987 ms | 90 MiB | '''python
from qiskit import QuantumCircuit
import math
def solve(n: int, L: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# グローバル位相は無視して良いので、全部ひっくり返す場合は何もしない
if L == 1 << n:
for i in range(n):
qc.h(i)
return qc
rem = L
controls = []
for i in reversed(range(n)):
if rem >= 1 << i:
n0 = 1 << i
n1 = rem - n0
print(f"i = {i}, {rem} -> {n0}, {n1}")
r0 = math.acos(math.sqrt(n0/(n0+n1)))*2.0
r1 = math.acos(math.sqrt(n1/(n0+n1)))*2.0
if len(controls) > 0:
for k in controls:
qc.x(k)
# qc.mcry(r0, controls, i)
qc.ry(r0, i)
qc.x(i)
controls.append(i)
for k in range(i):
print(f"k = {k}")
qc.ry(math.pi / 4.0, k)
qc.mcp(math.pi, controls, k)
qc.ry(-math.pi / 4.0, k)
controls = controls[:-1]
qc.x(i)
for k in controls:
qc.x(k)
else:
qc.ry(r1, i)
rem = n1
controls.append(i)
return qc
''' |
QPC002_A1 | A0088922EB389 | 1 | WA | 1997 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.rz(3.14159, 0)
# Write your code here:
return qc
''' |
QPC002_A1 | A0088922EB389 | 2 | RE | 1474 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.i(0) # Identit operation to maintain |0⟩ state
qc.z(0) # Wrte your code here:
return qc
''' |
QPC002_A1 | A0088922EB389 | 3 | RE | 1133 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.rz(np.pi/2, 0)
# Wrte your code here:
return qc
''' |
QPC002_A1 | A0088922EB389 | 4 | WA | 1606 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.z(0)
# Wrte your code here:
return qc
''' |
QPC002_A1 | A02D4975E26AC | 1 | AC | 1596 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0314B43EA985 | 1 | WA | 1440 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
return qc
''' |
QPC002_A1 | A0314B43EA985 | 2 | WA | 1196 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.rz(np.pi, 0)
return qc
''' |
QPC002_A1 | A0314B43EA985 | 3 | WA | 1105 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
import numpy as np
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.z(0)
return qc
''' |
QPC002_A1 | A0314B43EA985 | 4 | AC | 1447 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0638B5F1FE8E | 1 | AC | 1436 ms | 155 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A06A20112A437 | 1 | AC | 1418 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A06A23ED1FB09 | 1 | AC | 1395 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0859F6BEEFE8 | 1 | AC | 1378 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A08BCA6C8470F | 1 | RE | 1377 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.g(0)
return qc
''' |
QPC002_A1 | A08BCA6C8470F | 2 | WA | 1096 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.h(0)
return qc
''' |
QPC002_A1 | A08BCA6C8470F | 3 | WA | 1383 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.h(-1)
return qc
''' |
QPC002_A1 | A08BCA6C8470F | 4 | RE | 1452 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.h(i)
return qc
''' |
QPC002_A1 | A08BCA6C8470F | 5 | WA | 1490 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.x(0)
return qc
''' |
QPC002_A1 | A08BCA6C8470F | 6 | WA | 1365 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.y(0)
return qc
''' |
QPC002_A1 | A08BCA6C8470F | 7 | WA | 1398 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.s(0)
qc.s(0)
return qc
''' |
QPC002_A1 | A08BCA6C8470F | 8 | AC | 1558 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0997082DAD11 | 1 | RE | 1495 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(1)
qc.z(1)
qc.x(1)
return qc
''' |
QPC002_A1 | A0997082DAD11 | 2 | RE | 1332 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.z(1)
return qc
''' |
QPC002_A1 | A0997082DAD11 | 3 | WA | 1403 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.z(0)
return qc
''' |
QPC002_A1 | A0997082DAD11 | 4 | AC | 1481 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0ABA2D9E64BD | 1 | WA | 1600 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.y(0)
qc.y(0)
return qc
''' |
QPC002_A1 | A0ABA2D9E64BD | 2 | AC | 1344 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.x(0)
qc.h(0)
qc.x(0)
qc.h(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0CBC047ECE2C | 1 | AC | 1401 ms | 155 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0D133F34F2F8 | 1 | WA | 1372 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
return qc
''' |
QPC002_A1 | A0D133F34F2F8 | 2 | AC | 1095 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0E9C48D93C6C | 1 | RE | 1269 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qz.x(0)
return qc
''' |
QPC002_A1 | A0E9C48D93C6C | 2 | AC | 1413 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0ED03DB80E91 | 1 | WA | 1505 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.z(0)
return qc
''' |
QPC002_A1 | A0ED03DB80E91 | 2 | AC | 1019 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.h(0)
qc.x(0)
qc.h(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0EFBED772E8C | 1 | AC | 1099 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A0FF8F4C15B7C | 1 | AC | 1544 ms | 139 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A103B161D8729 | 1 | AC | 1249 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A105FB564F144 | 1 | AC | 1140 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
QPC002_A1 | A10B7C9112EBF | 1 | WA | 1406 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.z(0)
return qc
''' |
QPC002_A1 | A10B7C9112EBF | 2 | WA | 1392 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.rz(3.14159, 0)
return qc
''' |
QPC002_A1 | A10B7C9112EBF | 3 | RE | 1503 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.rz(0)
return qc
''' |
QPC002_A1 | A10B7C9112EBF | 4 | AC | 1417 ms | 140 MiB | '''python
from qiskit import QuantumCircuit
def solve() -> QuantumCircuit:
qc = QuantumCircuit(1)
# Write your code here:
qc.x(0)
qc.z(0)
qc.x(0)
return qc
''' |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.