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_A4 | AB8A5DF0518FC | 1 | DLE | 2696 ms | 156 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in reversed(range(n-1)):
i_first=i
i_second=(i+1) % n
qc.cx(i_first, i_second)
qc.cx(i_second, i_first)
qc.cx(i_first, i_second)
return qc
''' |
QPC004_A4 | AB8A5DF0518FC | 2 | AC | 2201 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in reversed(range(n-1)):
i_first=i
i_second=(i+1) % n
qc.cx(i_first, i_second)
qc.cx(i_second, i_first)
return qc
''' |
QPC004_A4 | ABAA1B789E683 | 1 | AC | 1978 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n - 1):
index = n - i - 1
qc.cx(index - 1, index)
qc.cx(index, index - 1)
return qc
''' |
QPC004_A4 | ABBA7DB5DA7B2 | 1 | WA | 2011 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def swap(qc: QuantumCircuit, a: int, b: int) -> None:
qc.cx(a, b)
qc.cx(b, a)
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n - 1, 0, -1):
swap(qc, i, i - 1)
return qc
''' |
QPC004_A4 | ABBA7DB5DA7B2 | 2 | AC | 2273 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def swap(qc: QuantumCircuit, a: int, b: int) -> None:
qc.cx(a, b)
qc.cx(b, a)
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
for i in range(n - 1, 0, -1):
swap(qc, i - 1, i)
return qc
''' |
QPC004_A4 | ABD16D4296A3F | 1 | WA | 2125 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-2,-1,-1):
qc.iswap(i,i+1)
return qc
''' |
QPC004_A4 | ABD16D4296A3F | 2 | AC | 2240 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-2,-1,-1):
qc.dcx(i,i+1)
qc.cx(i,i+1)
return qc
''' |
QPC004_A4 | ABD7F27330D26 | 1 | AC | 1927 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
# import matplotlib.pyplot
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in reversed(range(0, n-1)):
qc.cx(i, i + 1)
qc.cx(i + 1, i)
return qc
# solve(3).draw("mpl")
''' |
QPC004_A4 | AC5224FDC038B | 1 | WA | 1868 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n - 2, -1):
qc.cx(i + 1, i)
qc.cx(i, i + 1)
return qc
''' |
QPC004_A4 | AC5224FDC038B | 2 | WA | 1713 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 - 2, -1):
qc.cx(i, i + 1)
qc.cx(i + 1, i)
return qc
''' |
QPC004_A4 | AC5224FDC038B | 3 | AC | 2347 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 - 2, -1, -1):
qc.cx(i, i + 1)
qc.cx(i + 1, i)
return qc
''' |
QPC004_A4 | ACBC09138DA91 | 1 | AC | 2212 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(1,n,2):
qc.cx(i-1,i)
qc.cx(i,i-1)
qc.cx(i-1,i)
for i in range(((n-1)//2)*2,1,-2):
qc.cx(i-2,i)
qc.cx(i,i-2)
qc.cx(i-2,i)
return qc
''' |
QPC004_A4 | ACC19B4C15164 | 1 | WA | 1739 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(n-1):
qc.cx(i+1, i)
return qc
''' |
QPC004_A4 | ACC19B4C15164 | 2 | WA | 1763 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-1):
qc.cx(i, i-1)
return qc
''' |
QPC004_A4 | ACC19B4C15164 | 3 | WA | 1631 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 range(1, n-1):
qc.cx(i, i-1)
return qc
''' |
QPC004_A4 | ACC473061E56A | 1 | AC | 2450 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-1, q)
qc.cx(q, q-1)
return qc
''' |
QPC004_A4 | ACCECCD1768A0 | 1 | AC | 2304 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-1, i)
qc.cx(i, i-1)
return qc
''' |
QPC004_A4 | AD99954736B70 | 1 | RE | 2342 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Apply the cyclic shift only if x_(n-1) = 0 (controlled on qubit n-1 being |0⟩)
for i in range(n - 2, -1, -1):
qc.ccx(n - 1, i, i + 1) # Controlled shift using CCX
qc.cx(i + 1, i)
qc.ccx(n - 1, i, i + 1)
return qc
''' |
QPC004_A4 | AD99954736B70 | 2 | WA | 1715 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# For n=2 case, we need a CNOT gate to handle |10⟩ → |01⟩
# For larger n, we need to shift all bits right cyclically
# Since xₙ₋₁ = 0 is guaranteed, we can use this fact
# We can propagate values using CNOTs
# Propagate values from right to left using CNOTs
for i in range(n-2, -1, -1):
qc.cx(i, i+1)
# The leftmost qubit will be 0 (given constraint)
# so we don't need to handle that case
return qc
''' |
QPC004_A4 | AD99954736B70 | 3 | WA | 2121 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Implement the cyclic shift logic
# Condition: x_(n-1) = 0, meaning last qubit is 0
for i in range(n - 1, 0, -1):
qc.cx(i - 1, i) # Perform CNOTs to shift
return qc
''' |
QPC004_A4 | AD99954736B70 | 4 | WA | 1893 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Implement the cyclic shift logic
# Condition: x_(n-1) = 0, meaning last qubit is 0
for i in range(n - 1, 0, -1):
qc.cx(i - 1, i) # Perform CNOTs to shift
return qc
''' |
QPC004_A4 | AD99954736B70 | 5 | WA | 2432 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# For cyclic shift when last qubit (xₙ₋₁) = 0
# We can use CNOT gates to implement the shift
# Apply CNOT gates in reverse order to shift the bits
for i in range(n-1):
qc.cx(i, i+1)
# Apply CNOT gates in forward order to complete the transformation
for i in range(n-2, -1, -1):
qc.cx(i, i+1)
return qc
''' |
QPC004_A4 | AD99954736B70 | 6 | WA | 2134 ms | 164 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Perform the cyclic shift
for i in range(n-1, 0, -1):
qc.cx(i-1, i)
# Swap the first and last qubit states
qc.cx(n-1, 0)
return qc
# Example usage:
n = 2
qc = solve(n)
print(qc)
''' |
QPC004_A4 | AD99954736B70 | 7 | WA | 1875 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# For n qubits, we need to perform a controlled cyclic shift
# First, connect adjacent qubits with CNOT to propagate values
for i in range(n-1):
qc.cx(i, i+1)
# The last qubit now holds the shifted value
# We need to clear the intermediate states
for i in range(n-2, -1, -1):
qc.cx(i, i+1)
# Finally, connect first and last qubit to complete the cycle
qc.cx(n-1, 0)
return qc
''' |
QPC004_A4 | AD99954736B70 | 8 | WA | 1854 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Perform the cyclic shift
for i in range(n-1):
qc.cx(i, i+1) # CNOT from qubit i to qubit i+1
# Handle the last qubit shifting to the first position
qc.cx(n-1, 0)
return qc
# Example usage:
n = 2
qc = solve(n)
print(qc)
''' |
QPC004_A4 | AD99954736B70 | 9 | RE | '''python
ffrom qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
return qc
''' | ||
QPC004_A4 | AD99954736B70 | 10 | WA | 1728 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Perform the cyclic shift
for i in range(n-1, 0, -1):
qc.cx(i-1, i)
# Move the last qubit to the first position
qc.cx(n-1, 0)
return qc
# Example usage:
# qc = solve(2)
# print(qc)
''' |
QPC004_A4 | AD99954736B70 | 11 | WA | 1765 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Perform the cyclic shift
# Step 1: Move the last qubit to the first position
for i in range(n-1, 0, -1):
qc.cx(i-1, i) # CNOT from qubit i-1 to qubit i
# Step 2: Move the last qubit to the first position
qc.cx(n-1, 0) # CNOT from qubit n-1 to qubit 0
return qc
''' |
QPC004_A4 | AD99954736B70 | 12 | WA | 1798 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# We only perform the cyclic shift when the last qubit (n-1) is 0
# To achieve this, we'll first apply X gate to the last qubit
qc.x(n-1)
# Now we can use the last qubit as control for our cyclic shift
# We need to move each bit to its new position when control is 1
# This effectively performs the shift when original last bit was 0
for i in range(n-1):
qc.cx(i, (i+1)%n)
# Apply CNOTs in reverse order to clean up intermediate states
for i in range(n-2, -1, -1):
qc.cx(i, (i+1)%n)
# Finally, revert the X gate on the last qubit
qc.x(n-1)
return qc
''' |
QPC004_A4 | AD99954736B70 | 13 | WA | 1969 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Perform the cyclic shift
# Step 1: Move the last qubit to the first position
for i in range(n-1, 0, -1):
qc.cx(i-1, i) # CNOT from qubit i-1 to qubit i
# Step 2: Move the last qubit to the first position
qc.cx(n-1, 0) # CNOT from qubit n-1 to qubit 0
return qc
''' |
QPC004_A4 | AD99954736B70 | 14 | WA | 1856 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# We want to shift only when last qubit is 0
# So we'll use its inverse (1) as control
qc.x(n-1)
# For each pair of qubits that need to be potentially swapped
for i in range(n-1):
next_i = (i + 1) % n
# Controlled-CNOT (CNOT controlled by last qubit)
qc.cx(n-1, i)
qc.cx(i, next_i)
qc.cx(n-1, i)
# Restore the last qubit
qc.x(n-1)
return qc
''' |
QPC004_A4 | ADC7C03F5E011 | 1 | DLE | 2060 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):
qc.cx(i, n-1)
qc.cx(n-1, i)
qc.cx(i, n-1)
return qc
''' |
QPC004_A4 | ADC7C03F5E011 | 2 | RE | 1871 ms | 158 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, n-1)
qc.cx(i-1, i)
qc.cx(i, i-1)
return qc
''' |
QPC004_A4 | ADD617AE5F914 | 1 | WA | 1621 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in reversed(range(n-1)):
qc.cx(i,i+1)
qc.cx(i+1,i)
qc.cx(i,i+1)
qc.reset(n-1)
return qc
''' |
QPC004_A4 | AE011F31FF504 | 1 | WA | 1747 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-2):
qc.cx(0, i + 1)
qc.cx(i+1, 0)
return qc
''' |
QPC004_A4 | AE011F31FF504 | 2 | DLE | 1803 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n - 1):
qc.cx(0, i + 1)
qc.cx(i + 1, 0)
qc.cx(0, i + 1)
return qc
''' |
QPC004_A4 | AE011F31FF504 | 3 | RE | 1704 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n - 2):
qc.cx(0, i + 1)
qc.cx(i + 1, 0)
qc.cx(0, i + 1)
qc.cx(0, n)
qc.cx(n-1, 0)
return qc
''' |
QPC004_A4 | AE011F31FF504 | 4 | WA | 1842 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 - 2):
qc.cx(0, i + 1)
qc.cx(i + 1, 0)
qc.cx(0, i + 1)
return qc
''' |
QPC004_A4 | AE7FB514FC07F | 1 | WA | 1837 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1):
qc.cx(n-1-i, n-2-i)
qc.cx(n-2-i, n-1-i)
return qc
''' |
QPC004_A4 | AE7FB514FC07F | 2 | AC | 1876 ms | 143 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1):
qc.cx(n-2-i, n-1-i)
qc.cx(n-1-i, n-2-i)
return qc
''' |
QPC004_A4 | AE9CEDB5FAB12 | 1 | RE | 1919 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1):
qc.measure(n-1, 0)
last = n - 1 - i
qc.cx(last - 1, last)
qc.cx(last, last - 1)
return qc
''' |
QPC004_A4 | AE9CEDB5FAB12 | 2 | RE | 1831 ms | 159 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n-1):
qc.measure(n-1, 0)
qc.reset(n-1)
last = n - 1 - i
qc.cx(last - 1, last)
qc.cx(last, last - 1)
return qc
''' |
QPC004_A4 | AE9CEDB5FAB12 | 3 | WA | 2056 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):
qc.reset(n-1)
last = n - 1 - i
qc.cx(last - 1, last)
qc.cx(last, last - 1)
return qc
''' |
QPC004_A4 | AE9CEDB5FAB12 | 4 | WA | 2022 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):
qc.reset(n-1)
last = n - 1 - i
qc.cx(last - 1, last)
qc.cx(last, last - 1)
qc.cx(last - 1, last)
return qc
''' |
QPC004_A4 | AE9CEDB5FAB12 | 5 | WA | 1768 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.reset(n-1)
for i in range(n-1):
last = n - 1 - i
qc.cx(last - 1, last)
qc.cx(last, last - 1)
return qc
''' |
QPC004_A4 | AE9CEDB5FAB12 | 6 | WA | 1756 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.reset(n-1)
for i in range(n-1, 0, -1):
qc.cx(i - 1, i)
qc.cx(i, i - 1)
return qc
''' |
QPC004_A4 | AE9CEDB5FAB12 | 7 | WA | 1725 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 - 1, i)
qc.cx(i, i - 1)
qc.cx(i - 1, i)
qc.reset(0)
return qc
''' |
QPC004_A4 | AE9CEDB5FAB12 | 8 | AC | 1899 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 - 1, i)
qc.cx(i, i - 1)
return qc
''' |
QPC004_A4 | AEB2C503CA056 | 1 | WA | 1996 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-1, 0, -1):
qc.cx(i, i-1)
qc.cx(i-1, i)
qc.cx(i, i-1)
for i in range(n-2, 0, -1):
qc.cx(i, i-1)
qc.cx(i-1, i)
qc.cx(i, i-1)
return qc
''' |
QPC004_A4 | AEB2C503CA056 | 2 | WA | 1771 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)
for i in range(n-1, 0, -1):
qc.cx(i-1, i)
return qc
''' |
QPC004_A4 | AEB2C503CA056 | 3 | WA | 1705 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n + 1)
# Write your code here:
for i in range(n - 1):
qc.cx(i, i + 1)
qc.measure_all()
return qc
''' |
QPC004_A4 | AEB2C503CA056 | 4 | WA | 1722 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)
return qc
''' |
QPC004_A4 | AEB2C503CA056 | 5 | WA | 1761 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)
return qc
''' |
QPC004_A4 | AEB2C503CA056 | 6 | DLE | 1679 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n )
i = 0
j = n - 1
while i < j:
qc.cx(i, j)
qc.cx(j, i)
qc.cx(i, j)
i += 1
return qc
''' |
QPC004_A4 | AEB2C503CA056 | 7 | WA | 1566 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n )
i = 0
j = n - 1
while i < j:
qc.cx(i, j)
qc.cx(j, i)
i += 1
return qc
''' |
QPC004_A4 | AEB2C503CA056 | 8 | WA | 1977 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)
qc.cx(n-1, 0)
return qc
''' |
QPC004_A4 | AEB2C503CA056 | 9 | DLE | 1602 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n )
i = 0
j = n - 1
while i < j:
qc.cx(i, j)
qc.cx(j, i)
qc.cx(i, j)
i += 1
return qc
''' |
QPC004_A4 | AEB2C503CA056 | 10 | WA | 1593 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n )
for i in range(n):
qc.h(i)
for i in range(n-1, 0, -1):
qc.cz(i, i-1)
for i in range(n):
qc.h(i)
return qc
return qc
''' |
QPC004_A4 | AF57D7937E6CA | 1 | DLE | 1834 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for _ in range(n-2,-1,-1):
qc.cx(_,_+1)
qc.cx(_+1,_)
qc.cx(_,_+1)
return qc
''' |
QPC004_A4 | AF57D7937E6CA | 2 | AC | 2483 ms | 163 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in reversed(range(n - 1)):
qc.cx(i,i+1)
for i in reversed(range(n - 1)):
qc.cx(i+1,i)
return qc
''' |
QPC004_A4 | AFFDE69566BB0 | 1 | RE | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for in reversed(range(n - 1)):
qc.cx(i, i + 1)
qc.cx(i + 1, i)
return qc
''' | ||
QPC004_A4 | AFFDE69566BB0 | 2 | AC | 2209 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in reversed(range(n - 1)):
qc.cx(i, i + 1)
qc.cx(i + 1, i)
return qc
''' |
QPC004_A5 | A02B3CB5A26B5 | 1 | WA | 1750 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.cx(0, n-1)
return qc
''' |
QPC004_A5 | A02B3CB5A26B5 | 2 | WA | 1810 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
qc.cx(0, n-1)
return qc
''' |
QPC004_A5 | A02B3CB5A26B5 | 3 | WA | 1990 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-1, -1, -1):
qc.x(i)
return qc
''' |
QPC004_A5 | A02B3CB5A26B5 | 4 | WA | 2126 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.x(i)
return qc
''' |
QPC004_A5 | A02B3CB5A26B5 | 5 | WA | 1910 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):
qc.x(i)
for i in range(n-1, 0, -1):
qc.cx(i, i-1)
return qc
''' |
QPC004_A5 | A02B3CB5A26B5 | 6 | RE | 1503 ms | 159 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(0)
else:
# Apply an (i)-controlled X gate with controls qubits [0, 1, ..., i-1] and target qubit i.
qc.mcx(list(range(i)), i, mode='gray')
return qc
''' |
QPC004_A5 | A02B3CB5A26B5 | 7 | RE | 1502 ms | 158 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(0)
else:
# Apply an (i)-controlled X gate with controls qubits [0, 1, ..., i-1] and target qubit i.
qc.mcx(list(range(i)), i, mode='gray')
return qc
''' |
QPC004_A5 | A02B3CB5A26B5 | 8 | WA | 1661 ms | 160 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# 1. すべてのビットを反転 (Xゲート)
qc.x(range(n))
# 2. +1 の加算回路 (Ripple-Carry Adder の簡易バージョン)
carry = 1 # 最下位ビットからキャリーを伝播させる
for i in range(n):
qc.cx(i, carry) # i番目のビットにキャリーを伝播
carry = i # 次のキャリー
# 3. すべてのビットを再度反転
qc.x(range(n))
return qc
''' |
QPC004_A5 | A02B3CB5A26B5 | 9 | RE | 1506 ms | 157 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
# Step 1. Invert every qubit.
qc.x(range(n))
# Step 2. Add 1 modulo 2^n.
# To add a constant, it suffices to switch to the Fourier basis,
# apply appropriate phase shifts, then transform back.
#
# (a) Apply the Quantum Fourier Transform.
qc.append(QFT(n, do_swaps=True).to_gate(), range(n))
# (b) In the Fourier basis, adding 1 is diagonal.
# For a state |y⟩ we must apply the phase exp(-2πi·y/2^n).
# Since y = Σ_{j=0}^{n-1} y_j 2^j, these phases can be applied
# as single-qubit phase gates on each qubit.
for j in range(n):
angle = -2 * math.pi / (2 ** (j+1))
qc.p(angle, j)
# (c) Apply the inverse QFT.
qc.append(QFT(n, do_swaps=True).inverse().to_gate(), range(n))
# Step 3. Invert every qubit again.
qc.x(range(n))
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 1 | WA | 1668 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)
# Write your code here:
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 2 | WA | 1786 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
for i in range(n-2):
qc.cx(i+1,i+2)
qc.cx(i,i+1)
qc.cx(n-2,n-1)
# Write your code here:
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 3 | WA | 1811 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(n-1)
for i in range(n-2):
qc.cx(n-i-2,n-i-3)
qc.cx(n-i-1,n-i-2)
qc.cx(1,0)
# Write your code here:
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 4 | WA | 1780 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(n-1)
for i in reversed(range(2,n)):
qc.cx(i-1,i-2)
qc.cx(i,i-1)
qc.cx(1,0)
# Write your code here:
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 5 | WA | 1897 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(n-1)
for i in reversed(range(2,n)):
qc.cx(i,i-1)
qc.cx(1,0)
# Write your code here:
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 6 | RE | 1606 ms | 158 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
fg=False
for i in reversed(range(n)):
if qc(i):
fg=True
qc.x(i)
if fg:
break
# Write your code here:
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 7 | RE | 1670 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([0,i],list(range(i+1)))
qc.x(0)
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 8 | RE | 1701 ms | 158 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([0,i],0)
qc.x(0)
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 9 | DLE | 1734 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n):
qc.x(i)
for i in reversed(range(1,n)):
qc.mcx(list(range(i)),i)
for i in range(1,n):
qc.x(i)
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 10 | WA | 1682 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):
qc.x(i)
for i in reversed(range(2,n)):
qc.mcx(list(range(i)),i)
qc.cx(0,1)
for i in range(2,n):
qc.x(i)
return qc
''' |
QPC004_A5 | A04CD095EBE6B | 11 | AC | 2014 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 | A0558AE086803 | 1 | WA | 2066 ms | 159 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# We will decrement the value in the little-endian format
# We need to flip bits until we find a 0 to turn into a 1
for i in range(n):
# Flip the i-th qubit
qc.x(i) # Prepare the qubit to be flipped
# Apply a series of CNOT gates to handle the carry
if i < n - 1:
qc.cx(i, i + 1) # CNOT from i to i+1
qc.x(i) # Flip back the i-th qubit
# The last qubit needs to be flipped to handle the wrap-around case
qc.x(n - 1) # Prepare the last qubit to be flipped
for i in range(n - 1):
qc.cx(i, n - 1) # CNOT from i to the last qubit
qc.x(n - 1) # Flip back the last qubit
return qc
''' |
QPC004_A5 | A09936EFB94B6 | 1 | WA | 1924 ms | 161 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
from math import pi, acos, sqrt, asin
from qiskit.circuit.library import XGate, ZGate
"""
You can apply oracle as follows:
qc.compose(o, inplace=True)
"""
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# Write your code here:
for i in range(n - 1):
qc.append(XGate().control(1, ctrl_state="0"), [i, i + 1])
qc.x(0)
return qc
''' |
QPC004_A5 | A09936EFB94B6 | 2 | AC | 2205 ms | 163 MiB | '''python
from qiskit import QuantumCircuit, QuantumRegister
from math import pi, acos, sqrt, asin
from qiskit.circuit.library import XGate, ZGate
"""
You can apply oracle as follows:
qc.compose(o, inplace=True)
"""
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
# qc.x(0)
# qc.x(1)
# Write your code here:
for i in range(n, 1, -1):
qc.append(XGate().control(i-1, ctrl_state="0" * (i-1)), range(i))
qc.x(0)
return qc
''' |
QPC004_A5 | A11B3B8921624 | 1 | WA | 2226 ms | 160 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 | A11B3B8921624 | 2 | WA | 1766 ms | 162 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 | A11B3B8921624 | 3 | AC | 2632 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 | A124C87FC9690 | 1 | RE | 1614 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.inverse()
''' |
QPC004_A5 | A124C87FC9690 | 2 | AC | 2409 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 | A13A59F12F17A | 1 | WA | 1752 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(n - 1)
# Write your code here:
for i in reversed(range(1, n)):
qc.cx(i, i - 1)
return qc
''' |
QPC004_A5 | A13A59F12F17A | 2 | WA | 1556 ms | 161 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
# Write your code here:
for i in range(1, n):
qc.cx(i - 1, i)
return qc
''' |
QPC004_A5 | A13A59F12F17A | 3 | WA | 1731 ms | 162 MiB | '''python
from qiskit import QuantumCircuit
def solve(n: int) -> QuantumCircuit:
qc = QuantumCircuit(n)
qc.x(0)
# Write your code here:
for i in range(1, n):
qc.cx(i, i - 1)
return qc
''' |
QPC004_A5 | A13FF9A90EB9F | 1 | AC | 2244 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 | A1AA6B7887115 | 1 | WA | 1787 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-1))
return qc
''' |
QPC004_A5 | A1AA6B7887115 | 2 | WA | 1837 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 | A1AA6B7887115 | 3 | WA | 1815 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 | A1E78B1A9C367 | 1 | WA | 1748 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(n-1):
qc.cx(i, i+1)
return qc
''' |
QPC004_A5 | A1E78B1A9C367 | 2 | AC | 2064 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 | A23B5E53A24DB | 1 | WA | 1640 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):
qc.cx(i, i-1)
return qc
''' |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.