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 |
|---|---|---|---|---|---|---|
QPC004_A5 | A23B5E53A24DB | 2 | WA | 1746 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
for i in range(n-1, 0, -1):
control_bits = list(range(i, n))
qc.mcx(control_bits, i-1)
return qc
''' |
QPC004_A5 | A23B5E53A24DB | 3 | WA | 1684 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
for i in range(n-1, 0, -1):
control_bits = list(range(i, n))
qc.mcx(control_bits, i-1)
return qc
''' |
QPC004_A5 | A23B5E53A24DB | 4 | WA | 1575 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# 初期状態に基づいて量子減算器を実装
for i in range(n):
qc.x(i) # 全ての量子ビットを反転
for i in range(n - 1, 0, -1):
qc.cx(i, i - 1) # キャリーを伝播
qc.x(0) # 最上位ビットを反転
for i in range(1, n):
qc.cx(i, i - 1) # キャリーを戻す
for i in range(n):
qc.x(i) # ビットを再び反転して元に戻す
return qc
''' |
QPC004_A5 | A34B0337B7B62 | 1 | AC | 2055 ms | 163 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
import numpy as np
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for idx in range(n):
if idx == 0:
qc.x(idx)
else:
qc.mcx(list(range(idx)), idx)
return qc
''' |
QPC004_A5 | A358B7AD513E6 | 1 | RE | 1633 ms | 159 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(1,n):
qc.mcx(range(i), i)
return qc
''' |
QPC004_A5 | A358B7AD513E6 | 2 | AC | 2797 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(1,n):
qc.mcx(list(range(i)), i)
return qc
''' |
QPC004_A5 | A36794C69C106 | 1 | WA | 1565 ms | 142 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in reversed(range(1, n)):
qc.mcx(list(range(i)), i)
qc.x(0)
return qc
''' |
QPC004_A5 | A36794C69C106 | 2 | AC | 1926 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(1, n):
qc.mcx(list(range(i)), i)
return qc
''' |
QPC004_A5 | A3C35E36ABCFE | 1 | WA | 1765 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import MCXGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
for i in range(n-1):
qc.append(MCXGate(i+1), list(range(n-1, n-i-3, -1)))
return qc
''' |
QPC004_A5 | A3C35E36ABCFE | 2 | AC | 2327 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import MCXGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
for i in range(n-1):
qc.append(MCXGate(i+1), list(range(i+2)))
return qc
''' |
QPC004_A5 | A41B90FEDF57D | 1 | WA | 1936 ms | 162 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
def solve(n) -> QuantumCircuit:
qc = QuantumCircuit(n)
carry = QuantumRegister(1)
extra = QuantumRegister(n)
qc.add_bits(carry)
qc.add_bits(extra)
c = carry[0]
qc.x(c)
for i in range(n):
e = extra[i]
qc.x(i)
qc.ccx(i, c, e)
qc.x(i)
qc.cx(c, i)
qc.swap(c, e)
return qc
''' |
QPC004_A5 | A41B90FEDF57D | 2 | AC | 2443 ms | 163 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
def solve(n) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
for i in range(1, n):
qc.mcx(list(range(i)), i)
return qc
''' |
QPC004_A5 | A43670BAA4640 | 1 | WA | 1837 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
qc.cx(n-1,n-2)
for i in range(n-3,-1,-1):
qc.ccx(i+2,i+1,i)
return qc
''' |
QPC004_A5 | A43670BAA4640 | 2 | WA | 1752 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
qc.cx(n-1,n-2)
for i in range(n-3,-1,-1):
qc.ccx(i+2,i+1,i)
return qc
''' |
QPC004_A5 | A43670BAA4640 | 3 | RE | 1736 ms | 159 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
for i in range(n-2,-1,-1):
qc.mcx(range(i+1,n),i)
return qc
''' |
QPC004_A5 | A43670BAA4640 | 4 | AC | 2140 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
controls = [0]
for i in range(1,n):
qc.mcx(controls, i)
controls.append(i)
return qc
''' |
QPC004_A5 | A44DA16D354EC | 1 | WA | 1682 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(range(n))
qc.mcx(list(range(n-1)), n-1)
qc.x(range(n))
return qc
''' |
QPC004_A5 | A44DA16D354EC | 2 | WA | 1597 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(range(n))
qc.mcx(list(range(n-1)), n-1)
qc.x(range(n))
return qc
''' |
QPC004_A5 | A453C2CE69ACF | 1 | AC | 1989 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(1, n):
qc.mcx(list(range(i)), i)
return qc
''' |
QPC004_A5 | A456ACD9D2AC4 | 1 | WA | 1769 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Using the inverse of the increment operation
# To decrement by 1, we apply a series of CNOT and X gates
# Step 1: Apply X to all qubits to flip the representation of (x-1)
qc.x(n - 1)
# Step 2: Construct the decrement using a ripple-carry method
for i in range(n - 1):
qc.cx(i, i + 1) # Carry propagation
# Step 3: Flip the LSB to complete subtraction
qc.x(0)
return qc
''' |
QPC004_A5 | A456ACD9D2AC4 | 2 | WA | 1718 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply X to all qubits to flip the representation for modular subtraction
qc.x(n - 1)
# Ripple borrow propagation for decrementing
for i in range(n - 1):
qc.cx(i, i + 1)
# Final step to complete subtraction by flipping the LSB
qc.x(0)
return qc
''' |
QPC004_A5 | A456ACD9D2AC4 | 3 | WA | 1917 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply X gates to all qubits
for i in range(n):
qc.x(i)
# Apply controlled-NOT gates in decreasing order
for i in range(n-1, 0, -1):
qc.cx(i-1, i)
# Apply X gates to all qubits again
for i in range(n):
qc.x(i)
return qc
''' |
QPC004_A5 | A456ACD9D2AC4 | 4 | WA | 1782 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply inverse of the +1 operation
# This effectively implements the -1 operation
for i in range(n-1, -1, -1):
qc.x(i)
for j in range(i+1, n):
qc.cx(i, j)
return qc
''' |
QPC004_A5 | A456ACD9D2AC4 | 5 | WA | 1827 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# First apply X gates to all qubits
for i in range(n):
qc.x(i)
# Then apply CNOT gates in the correct order
for i in range(n-1):
qc.cx(i, i+1)
return qc
''' |
QPC004_A5 | A49F3829B053F | 1 | AC | 2346 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for _ in range(1, n):
qc.mcx(list(range(_)), _)
return qc
''' |
QPC004_A5 | A58A3D91B08E0 | 1 | RE | 1719 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# 量子ビットをすべてXゲートで反転させます (NOTゲート)
# これは、|x> から |~x> (ビット反転) へのマッピングを作成します。
# |x> が 0 の場合、|1> になります。|x> が 2^n - 1 の場合、|0> になります。
for i in range(n):
qc.x(i)
# nビットの加算器を実装することで、(x-1) mod 2^n を実現します。
# これを行うには、量子フーリエ変換 (QFT) を使用して加算器を構築します。
# まず、QFTの逆変換を適用します。
# QFTの逆変換は、量子ビットの重ね合わせ状態を周波数領域に変換します。
# この変換は、加算操作を位相シフトとして実行できるようにするために必要です。
def qft_dagger(circuit, num_qubits):
"""n量子ビットのQFTの逆変換を適用します。"""
for j in range(num_qubits // 2):
circuit.swap(j, num_qubits - 1 - j)
for j in range(num_qubits):
for m in range(j):
circuit.cp(-2 * qc.pi / (2**(j - m + 1)), m, j)
circuit.h(j)
# QFTを適用します。
# QFTは、量子ビットの重ね合わせ状態を周波数領域に変換します。
# これにより、加算操作を位相シフトとして実行できます。
def qft(circuit, num_qubits):
"""n量子ビットのQFTを適用します。"""
for j in range(num_qubits - 1, -1, -1):
circuit.h(j)
for m in range(j):
circuit.cp(2 * qc.pi / (2**(j - m + 1)), m, j)
for j in range(num_qubits // 2):
circuit.swap(j, num_qubits - 1 - j)
# QFTを適用します。
qft(qc, n)
# -1 を加算することに相当する位相シフトを適用します。
# QFTの性質上、数値の加算は周波数領域での位相シフトに変換されます。
# ここでは、各量子ビットに適切な位相シフトを適用して、-1 を加算する効果を実現します。
for i in range(n):
qc.p(-2 * qc.pi / (2**(n - i)), i)
# QFTの逆変換を適用して、結果を元の基底に戻します。
qft_dagger(qc, n)
# 再びXゲートを適用して、元の状態に戻します。
# これは、最初に適用したXゲートの効果を元に戻し、
# 最終的な結果が (x-1) mod 2^n になるようにします。
for i in range(n):
qc.x(i)
return qc
''' |
QPC004_A5 | A5C15FF4AA64E | 1 | RE | 1841 ms | 158 MiB | '''python
from math import ceil,floor,acos,asin,atan,sqrt,pi,gcd,sin,cos,tan
from qiskit import QuantumCircuit,QuantumRegister
def qft(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in reversed(range(n)):
qc.h(i)
for j in reversed(range(i)):
qc.cp(pi / 2 ** (i - j), j, i)
for i in range(n // 2):
qc.swap(i, n - i - 1)
return qc
def solve(n: int, a: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qft_n =qft(n)
qc.compose(qft_n,qc,inplace=True)
for i in range(n):
theta = 2 * pi * 1 * 2**i / 2**n
qc.p(theta, i)
qc.compose(qft_n.inverse(),qc,inplace=True)
return qc
''' |
QPC004_A5 | A5C15FF4AA64E | 2 | RE | 1583 ms | 158 MiB | '''python
from math import ceil,floor,acos,asin,atan,sqrt,pi,gcd,sin,cos,tan
from qiskit import QuantumCircuit,QuantumRegister
def qft(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in reversed(range(n)):
qc.h(i)
for j in reversed(range(i)):
qc.cp(pi / 2 ** (i - j), j, i)
for i in range(n // 2):
qc.swap(i, n - i - 1)
return qc
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qft_n =qft(n)
qc.compose(qft_n,qc,inplace=True)
for i in range(n):
theta = 2 * pi * 1 * 2**i / 2**n
qc.p(theta, i)
qc.compose(qft_n.inverse(),qc,inplace=True)
return qc
''' |
QPC004_A5 | A5C15FF4AA64E | 3 | RE | 1604 ms | 158 MiB | '''python
from math import ceil,floor,acos,asin,atan,sqrt,pi,gcd,sin,cos,tan
from qiskit import QuantumCircuit,QuantumRegister
def qft(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in reversed(range(n)):
qc.h(i)
for j in reversed(range(i)):
qc.cp(pi / 2 ** (i - j), j, i)
for i in range(n // 2):
qc.swap(i, n - i - 1)
return qc
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qft_n =qft(n)
qc.compose(qft_n,qc,inplace=True)
for i in range(n):
theta = 2 * pi * 1 * 2**i / 2**n
qc.p(theta, i)
qc.compose(qft_n.inverse(),qc,inplace=True)
return qc.inverse()
''' |
QPC004_A5 | A5C15FF4AA64E | 4 | DLE | 1696 ms | 158 MiB | '''python
from math import ceil,floor,acos,asin,atan,sqrt,pi,gcd,sin,cos,tan
from qiskit import QuantumCircuit,QuantumRegister
def qft(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in reversed(range(n)):
qc.h(i)
for j in reversed(range(i)):
qc.cp(pi / 2 ** (i - j), j, i)
for i in range(n // 2):
qc.swap(i, n - i - 1)
return qc
def solve(n: int) -> QuantumCircuit:
qq=QuantumRegister(n)
qc = QuantumCircuit(qq)
# Write your code here:
qft_n =qft(n)
qc.compose(qft_n,qq,inplace=True)
for i in range(n):
theta = 2 * pi * 1 * 2**i / 2**n
qc.p(theta, i)
qc.compose(qft_n.inverse(),qq,inplace=True)
return qc.inverse()
''' |
QPC004_A5 | A5C15FF4AA64E | 5 | RE | 1791 ms | 159 MiB | '''python
from math import ceil,floor,acos,asin,atan,sqrt,pi,gcd,sin,cos,tan
from qiskit import QuantumCircuit,QuantumRegister
def solve(n: int) -> QuantumCircuit:
qq=QuantumRegister(n)
for i in range(n):
qc.x(i)
for j in range(i+1, n):
qc.mcx(list(range(i, j)), j)
qc.x(i)
return qc.inverse()
''' |
QPC004_A5 | A5C15FF4AA64E | 6 | WA | 1732 ms | 160 MiB | '''python
from math import ceil,floor,acos,asin,atan,sqrt,pi,gcd,sin,cos,tan
from qiskit import QuantumCircuit,QuantumRegister
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.x(i)
for j in range(i+1, n):
qc.mcx(list(range(i, j)), j)
qc.x(i)
return qc.inverse()
''' |
QPC004_A5 | A5C15FF4AA64E | 7 | WA | 1895 ms | 162 MiB | '''python
from math import ceil,floor,acos,asin,atan,sqrt,pi,gcd,sin,cos,tan
from qiskit import QuantumCircuit,QuantumRegister
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
for i in range(n-1):
qc.cx(i,i+1)
return qc.inverse()
''' |
QPC004_A5 | A5C15FF4AA64E | 8 | RE | 1611 ms | 158 MiB | '''python
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1,0,-1):
#qc.cx(i,i-1)
qc.cx(i-1,i)
#qc.cx(i,i-1)
return qc
''' |
QPC004_A5 | A5C15FF4AA64E | 9 | WA | 1631 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1,0,-1):
#qc.cx(i,i-1)
qc.cx(i-1,i)
#qc.cx(i,i-1)
return qc
''' |
QPC004_A5 | A5C15FF4AA64E | 10 | WA | 1723 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1,0,-1):
qc.cx(i,i-1)
#qc.cx(i-1,i)
#qc.cx(i,i-1)
return qc
''' |
QPC004_A5 | A5C15FF4AA64E | 11 | RE | 1645 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n,0,-1):
qc.mcx(list(range(i)), i)
qc.x(0)
return qc
''' |
QPC004_A5 | A5C15FF4AA64E | 12 | WA | 1655 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n-1,0,-1):
qc.mcx(list(range(i)), i)
qc.x(0)
return qc
''' |
QPC004_A5 | A5C15FF4AA64E | 13 | RE | 1644 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n-1,-1,-1):
qc.mcx(list(range(i)), i)
qc.x(0)
return qc
''' |
QPC004_A5 | A5C15FF4AA64E | 14 | AC | 2979 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n-1,0,-1):
qc.mcx(list(range(i)), i)
qc.x(0)
return qc.inverse()
''' |
QPC004_A5 | A664F47B7CB57 | 1 | WA | 1621 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
print(i)
if i == 0:
qc.x(0)
else:
qc.cx(i,list(range(0,i)))
return qc
''' |
QPC004_A5 | A664F47B7CB57 | 2 | WA | 1908 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n)[::-1]:
print(i)
if i == 0:
qc.x(0)
else:
qc.mcx(list(range(0,i)),i)
return qc
''' |
QPC004_A5 | A664F47B7CB57 | 3 | AC | 2168 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
print(i)
if i == 0:
qc.x(0)
else:
qc.mcx(list(range(0,i)),i)
return qc
''' |
QPC004_A5 | A6B7E492906C9 | 1 | WA | 1601 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n-2, -1, -1):
qc.cx(i, i+1)
qc.x
return qc
''' |
QPC004_A5 | A6B7E492906C9 | 2 | WA | 1798 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(n-1)
for i in range(n-2, -1, -1):
qc.cx(i, i+1)
return qc
''' |
QPC004_A5 | A6B7E492906C9 | 3 | WA | 1615 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(n-1)
for i in range(n-2, -1, -1):
qc.cx(i+1, i)
return qc
''' |
QPC004_A5 | A6B7E492906C9 | 4 | WA | 1891 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n-1, 0, -1):
qc.cx(i, i-1)
for i in range(n):
qc.x(i)
return qc
''' |
QPC004_A5 | A6B7E492906C9 | 5 | WA | 2812 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n-1):
qc.cx(i, i+1)
for i in range(n):
qc.x(i)
return qc
''' |
QPC004_A5 | A6B7E492906C9 | 6 | WA | 1983 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n-2, -1, -1):
qc.cx(i, i+1)
for i in range(n):
qc.x(i)
return qc
''' |
QPC004_A5 | A6B7E492906C9 | 7 | WA | 1685 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
for i in range(n-1, 0, -1):
qc.cx(i, i-1)
return qc
''' |
QPC004_A5 | A6B7E492906C9 | 8 | WA | 1758 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
for i in range(n-1, 0, -1):
qc.cx(i-1, i)
return qc
''' |
QPC004_A5 | A6B7E492906C9 | 9 | WA | 2014 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
for i in range(n-1):
qc.cx(i, i+1)
return qc
''' |
QPC004_A5 | A6DDCE869E67B | 1 | WA | 2093 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
for i in reversed(range(n-1)):
qc.cx(i+1, i)
return qc
''' |
QPC004_A5 | A6DDCE869E67B | 2 | WA | 2640 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(n-1):
qc.cx(i, i+1)
return qc
''' |
QPC004_A5 | A6DDCE869E67B | 3 | AC | 2148 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import MCXGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
controls = []
qc.x(0)
for i in range(n-1):
controls.append(i)
mcx = MCXGate(len(controls))
qc.append(mcx, controls + [i+1])
return qc
''' |
QPC004_A5 | A7D96FE89A7BE | 1 | RE | 1749 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in reversed(range(1,n)):
qc.mcx(list(range(1,i)),i)
qc.x(0)
return qc
''' |
QPC004_A5 | A7D96FE89A7BE | 2 | AC | 2192 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(1,n):
qc.mcx(list(range(i)),i)
return qc
''' |
QPC004_A5 | A7EC6397830E1 | 1 | UME | '''python
from qiskit import QuantumCircuit
import numpy as np
from qiskit.circuit.library import QFT
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.append(QFT(n), range(n))
for i in range(n):
qc.p(-2*np.pi/2**(i+1), i)
qc.append(QFT(n).inverse(), range(n))
return qc
''' | ||
QPC004_A5 | A80834888A106 | 1 | WA | 1902 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for q in range(0, n-1):
qc.cx(q, q+1)
qc.x(0)
return qc
''' |
QPC004_A5 | A80834888A106 | 2 | RE | 1958 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for q in range(q-1, 0, -1):
qc.cx(q, q-1)
qc.x(n-1)
return qc
''' |
QPC004_A5 | A80834888A106 | 3 | WA | 2258 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for q in range(n-1, 0, -1):
qc.cx(q, q-1)
qc.x(n-1)
return qc
''' |
QPC004_A5 | A80834888A106 | 4 | WA | 1880 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
# for q in range(n-1, 0, -1):
# qc.cx(q, q-1)
for q in range(0, n-1):
qc.cx(q+1, q)
return qc
''' |
QPC004_A5 | A80834888A106 | 5 | WA | 1831 ms | 159 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
# for q in range(n-1, 0, -1):
# qc.cx(q, q-1)
for q in range(0, n-1):
qc.cx(q+1, q)
return qc
''' |
QPC004_A5 | A80834888A106 | 6 | RE | 1853 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(1, n):
qc.mcx(list[range(i)], i)
return qc
''' |
QPC004_A5 | A80834888A106 | 7 | AC | 2267 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(1, n):
qc.mcx(list(range(i)), i)
return qc
''' |
QPC004_A5 | A80D614691F81 | 1 | AC | 2118 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import XGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(1,n):
qc.append(XGate().control(i),qargs=range(i+1))
return qc
''' |
QPC004_A5 | A83B6F203D636 | 1 | WA | 1849 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.x(i)
for i in range(n-1, 0, -1):
qc.cx(i, i-1)
qc.x(i-1)
return qc
''' |
QPC004_A5 | A83B6F203D636 | 2 | WA | 1985 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.x((n-1)-i)
for i in range(n-1, 0, -1):
qc.cx((n-1)-i, (n-1)-(i-1))
qc.x((n-1)-(i-1))
return qc
''' |
QPC004_A5 | A83B6F203D636 | 3 | WA | 1841 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n-1, -1, -1):
qc.x(i)
if i > 0:
qc.cx(i, i-1)
return qc
''' |
QPC004_A5 | A83B6F203D636 | 4 | RE | 1738 ms | 159 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n-1, -1, -1):
qc.cx(i, i)
if i > 0:
qc.cx(i, i-1)
return qc
''' |
QPC004_A5 | A8C2819D88C38 | 1 | RE | 1746 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(n-1)
qc.cx(n-1, n-2)
for i in range(n-2):
x = QuantumRegister(1)
qc.add_bits(x)
qc.ccx(n - 2 - i, n - 1 + i, n - 3- i)
if i < n - 3:
qc.ccx(n - 2 - i, n- 1 + i, n + i)
return qc
''' |
QPC004_A5 | A8C2819D88C38 | 2 | RE | 1815 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(n-1)
qc.cx(n-1, n-2)
for i in range(n-2):
if i < n - 3:
x = QuantumRegister(1)
qc.add_bits(x)
qc.ccx(n - 2 - i, n - 1 + i, n - 3- i)
if i < n - 3:
qc.ccx(n - 2 - i, n- 1 + i, n + i)
return qc
''' |
QPC004_A5 | A8C2819D88C38 | 3 | UME | '''python
from qiskit import ClassicalRegister, QuantumCircuit, QuantumRegister
def solve(n: int) -> QuantumCircuit:
qr = QuantumRegister(n)
cr = ClassicalRegister(1)
qc = QuantumCircuit(qr, cr)
# Write your code here:
qc.x(n-1)
for i in range(n):
qc.cx(n-1 - i, n-2 - i)
qc.measure(qr[n - 2 - i], cr[0])
with qc.if_test((cr[0], 0)) as else_:
break
return qc
''' | ||
QPC004_A5 | A8C2819D88C38 | 4 | UME | '''python
from qiskit import ClassicalRegister, QuantumCircuit, QuantumRegister
def solve(n: int) -> QuantumCircuit:
n=2
qc = QuantumCircuit()
# Write your code here:
qc.x(n-1)
qc.cx(n-1, n - 2)
return qc
''' | ||
QPC004_A5 | A8C2819D88C38 | 5 | RE | 1686 ms | 158 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
def solve(n: int) -> QuantumCircuit:
n=2
qc = QuantumCircuit()
# Write your code here:
qc.x(n-1)
qc.cx(n-1, n - 2)
return qc
''' |
QPC004_A5 | A8C2819D88C38 | 6 | WA | 1673 ms | 161 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
def solve(n: int) -> QuantumCircuit:
n=2
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
qc.cx(n-1, n - 2)
return qc
''' |
QPC004_A5 | A8C2819D88C38 | 7 | WA | 1833 ms | 162 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
def solve(n: int) -> QuantumCircuit:
n=3
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
qc.cx(n-1, n - 2)
return qc
''' |
QPC004_A5 | A8C2819D88C38 | 8 | WA | 1838 ms | 162 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
def solve(n: int) -> QuantumCircuit:
n=5
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
qc.cx(n-1, n - 2)
return qc
''' |
QPC004_A5 | A8C2819D88C38 | 9 | WA | 1752 ms | 163 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
def solve(n: int) -> QuantumCircuit:
n=5
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
qc.cx(n-1, n - 2)
for i in range(n-2):
if i < n - 3:
x = QuantumRegister(1)
qc.add_bits(x)
qc.ccx(n - 2 - i, n - 1 + i, n - 3- i)
if i < n - 3:
qc.ccx(n - 2 - i, n- 1 + i, n + i)
return qc
''' |
QPC004_A5 | A8C2819D88C38 | 10 | WA | 1757 ms | 162 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
def solve(n: int) -> QuantumCircuit:
n=6
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
qc.cx(n-1, n - 2)
for i in range(n-2):
if i < n - 3:
x = QuantumRegister(1)
qc.add_bits(x)
qc.ccx(n - 2 - i, n - 1 + i, n - 3- i)
if i < n - 3:
qc.ccx(n - 2 - i, n- 1 + i, n + i)
return qc
''' |
QPC004_A5 | A8C2819D88C38 | 11 | WA | 1773 ms | 162 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(n-1)
qc.cx(n-1, n - 2)
for i in range(n-2):
if i < n - 3:
x = QuantumRegister(1)
qc.add_bits(x)
qc.ccx(n - 2 - i, n - 1 + i, n - 3- i)
if i < n - 3:
qc.ccx(n - 2 - i, n- 1 + i, n + i)
return qc
''' |
QPC004_A5 | A8C2819D88C38 | 12 | RE | 1797 ms | 158 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
qc.cx(0, 1)
qc.ccx(0, 1, 2)
x = QuantumRegister(1)
qc.add_bits(x)
for i in range(n-2):
if i == 0:
qc.ccx(0, 1, 10)
else:
x = QuantumRegister(1)
qc.add_bits(x)
qc.ccx(i + 1, n + i -1, n + i)
qc.ccx(n + i, i + 2, i + 3)
return qc
''' |
QPC004_A5 | A90BD23098F1D | 1 | RE | 1659 ms | 157 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
if i == 0:
qc.x(qreg[i])
else:
qc.cx(qreg[i-1], qreg[i])
return qc
''' |
QPC004_A5 | A91955BE358B1 | 1 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates.mcx import MCXGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n - 1, 0, -1):
qc.append(MCXGate(num_ctrl_qubits=i, ctrl_state="0" * i),
qargs=list(range(i)) + [i])
qc.x(0)
return qc
''' | ||
QPC004_A5 | A91955BE358B1 | 2 | RE | 1773 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
from math import pi
from qiskit.circuit.library.standard_gates import MCPhaseGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n - 1, 0, -1):
for j in range(i):
qc.x(j)
qc.h(i)
qc.append(MCPhaseGate(pi, num_qubits=i+1), qargs=list(range(i+1)))
qc.h(i)
for j in range(i):
qc.x(j)
qc.x(0)
return qc
''' |
QPC004_A5 | A91955BE358B1 | 3 | DLE | 1767 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
from math import pi
from qiskit.circuit.library.standard_gates import MCPhaseGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n - 1, 0, -1):
for j in range(i):
qc.x(j)
qc.h(i)
qc.append(MCPhaseGate(pi, num_ctrl_qubits=i), qargs=list(range(i+1)))
qc.h(i)
for j in range(i):
qc.x(j)
qc.x(0)
return qc
''' |
QPC004_A5 | A91955BE358B1 | 4 | WA | 1777 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
from math import pi
from qiskit.circuit.library.standard_gates import MCPhaseGate
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(1, n):
for j in range(i):
qc.x(j)
qc.h(i)
qc.append(MCPhaseGate(pi, num_ctrl_qubits=i), qargs=list(range(i)) + [i])
qc.h(i)
for j in range(i):
qc.x(j)
qc.x(0)
return qc
''' |
QPC004_A5 | A91955BE358B1 | 5 | RE | 1671 ms | 158 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
from qiskit.circuit.library.standard_gates import XGate, CXGate, CCXGate
import math
def add_one_in_log_depth(qc: QuantumCircuit, data: QuantumRegister, carry: QuantumRegister):
n = len(data)
for i in range(n):
qc.cx(carry[i], data[i])
for i in range(n):
qc.ccx(data[i], carry[i], carry[i+1])
log_n = math.ceil(math.log2(n))
block_size = 1
while block_size < n:
for start in range(0, n, 2*block_size):
mid = start + block_size
if mid < n:
qc.ccx(carry[start], data[mid], carry[mid])
qc.cx(carry[start], data[mid])
qc.ccx(carry[start], data[mid], carry[mid])
block_size *= 2
for i in range(n):
qc.cx(carry[i], data[i])
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(data)
data = QuantumRegister(n, "data")
carry = QuantumRegister(n+1, "carry")
qc.add_register(carry)
# Step 0: carry[0]を1に初期化 (Xゲート), 他は0のまま
qc.x(carry[0]) # carry[0] = 1
# Step 1: 全ビットを反転 (深さ1扱い: n個のXは並列実行可能)
for i in range(n):
qc.x(data[i])
# Step 2: +1 (mod 2^n) の回路を挿入（深さ O(log n)）
add_one_in_log_depth(qc, data, carry)
# Step 3: 再度全ビットを反転 (深さ1)
for i in range(n):
qc.x(data[i])
return qc
''' |
QPC004_A5 | A91955BE358B1 | 6 | WA | 1958 ms | 162 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
from qiskit.circuit.library.standard_gates import XGate, CXGate, CCXGate
import math
def add_one_in_log_depth(qc: QuantumCircuit, data: QuantumRegister, carry: QuantumRegister):
n = len(data)
for i in range(n):
qc.cx(carry[i], data[i])
for i in range(n):
qc.ccx(data[i], carry[i], carry[i+1])
log_n = math.ceil(math.log2(n))
block_size = 1
while block_size < n:
for start in range(0, n, 2*block_size):
mid = start + block_size
if mid < n:
qc.ccx(carry[start], data[mid], carry[mid])
qc.cx(carry[start], data[mid])
qc.ccx(carry[start], data[mid], carry[mid])
block_size *= 2
for i in range(n):
qc.cx(carry[i], data[i])
def solve(n: int) -> QuantumCircuit:
data = QuantumRegister(n, "data")
qc = QuantumCircuit(data)
carry = QuantumRegister(n+1, "carry")
qc.add_register(carry)
# Step 0: carry[0]を1に初期化 (Xゲート), 他は0のまま
qc.x(carry[0]) # carry[0] = 1
# Step 1: 全ビットを反転 (深さ1扱い: n個のXは並列実行可能)
for i in range(n):
qc.x(data[i])
# Step 2: +1 (mod 2^n) の回路を挿入（深さ O(log n)）
add_one_in_log_depth(qc, data, carry)
# Step 3: 再度全ビットを反転 (深さ1)
for i in range(n):
qc.x(data[i])
return qc
''' |
QPC004_A5 | A91955BE358B1 | 7 | DLE | 1518 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library.standard_gates import MCPhaseGate
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
for i in range(1, n):
qc.h(i)
qc.append(MCPhaseGate(math.pi, num_ctrl_qubits=i), list(range(i)) + [i])
qc.h(i)
return qc
''' |
QPC004_A5 | A91955BE358B1 | 8 | UME | '''python
from qiskit import QuantumCircuit
from qiskit.circuit.library import QFT
import math
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qft = QFT(n, do_swaps=False, approximation_degree=0)
qc.append(qft, list(range(n)))
for j in range(n):
qc.rz(-2*math.pi/2**(j+1), j)
qc.append(qft.inverse(), list(range(n)))
return qc
''' | ||
QPC004_A5 | A91955BE358B1 | 9 | UGE | 1576 ms | 157 MiB | '''python
from qiskit import QuantumCircuit
import math
def parallel_qft(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
def _qft_recursive(qubits):
m = len(qubits)
if m == 1:
qc.h(qubits[0])
else:
# qubit 列をおおよそ半分に分割
mid = m // 2
left = qubits[:mid]
right = qubits[mid:]
# 両ブロック上で並列に QFT を実施
_qft_recursive(left)
_qft_recursive(right)
for i, qi in enumerate(left):
for j, qj in enumerate(right):
angle = 2 * math.pi / (2 ** (i + j + 2))
qc.cp(angle, qj, qi)
_qft_recursive(list(range(n)))
return qc
def parallel_iqft(n: int) -> QuantumCircuit:
return parallel_qft(n).inverse()
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qft_gate = parallel_qft(n).to_gate(label="parallel_QFT")
qc.append(qft_gate, list(range(n)))
for j in range(n):
qc.rz(-2 * math.pi / (2 ** (j + 1)), j)
iqft_gate = parallel_iqft(n).to_gate(label="parallel_iQFT")
qc.append(iqft_gate, list(range(n)))
return qc
''' |
QPC004_A5 | A92B0ECA33F0A | 1 | AC | 2404 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(1, n):
qc.mcx(list(range(i)), i)
return qc
''' |
QPC004_A5 | A9DF07CD84772 | 1 | WA | 1883 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(1,n):
qc.x(i)
for i in range(1, n):
qc.mcx(list(range(i)), i)
for i in range(n):
qc.x(i)
return qc
''' |
QPC004_A5 | A9DF07CD84772 | 2 | WA | 1744 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.x(i)
qc.x(0)
for i in range(1, n):
qc.mcx(list(range(i)), i)
for i in range(n):
qc.x(i)
return qc
''' |
QPC004_A5 | A9DF07CD84772 | 3 | RE | 1816 ms | 157 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.mcx(list(range(i)), i)
return qc
''' |
QPC004_A5 | A9DF07CD84772 | 4 | RE | 1748 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.x(i)
for i in range(n-1):
qc.cx(i, i+1)
qc.ccx(i, i+1, i)
qc.x(n-1)
for i in reversed(range(n-1)):
qc.ccx(i, i+1, i)
qc.cx(i, i+1)
for i in range(n):
qc.x(i)
return qc
''' |
QPC004_A5 | A9DF07CD84772 | 5 | RE | 1735 ms | 159 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n):
qc.x(i)
for i in range(n-1):
qc.cx(i, i+1)
qc.ccx(i, i+1, i)
qc.x(n-1)
for i in reversed(range(n-1)):
qc.ccx(i, i+1, i)
qc.cx(i, i+1)
for i in range(n):
qc.x(i)
return qc
''' |
QPC004_A5 | A9DF07CD84772 | 6 | AC | 2144 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
for i in range(1, n):
qc.mcx(list(range(i)), i)
return qc
''' |
QPC004_A5 | AA45A9B1FE2C3 | 1 | RE | 1528 ms | 141 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.x(0)
for i in range(n):
qc.mcx(list(range(n-i-1)), n-i)
return qc
''' |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.