Datasets:
tm0012-QCB
/
QCoderBenchmark

Dataset card Data Studio Files
xet
 Community
1
problem
stringclasses
67 values
user
stringlengths
13
13
submission_order
int64
1
57
result
stringclasses
10 values
execution_time
stringlengths
0
8
memory
stringclasses
88 values
code
stringlengths
47
7.62k
QPC002_A4
AC44C1006634B
10
DLE
1281 ms
140 MiB
'''python from qiskit import QuantumCircuit import math def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) if n > 0: qc.h(0) # Apply Hadamard gate to the first qubit if n > 1: for i in range(1, n): qc.cx(0, i) # Apply CNOT gates with the first qubit as control if n > 0: qc.z(0) return qc '''
QPC002_A4
AC4D35B2115DB
1
RE
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(1, n): qc.cx(0, i) qc.z(n-) return qc '''
QPC002_A4
AC4D35B2115DB
2
DLE
1584 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(1, n): qc.cx(0, i) qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
3
RE
1436 ms
140 MiB
'''python def solve(n) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) # すべての制御Xゲートを並列に実行 for i in range(1, n): qc.cx(0, i) # 並列に Z ゲートを適用する qc.z(0) qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
4
WA
1200 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) # すべての制御Xゲートを並列に実行 for i in range(1, n): qc.cx(0, i) # 並列に Z ゲートを適用する qc.z(0) qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
5
WA
1301 ms
141 MiB
'''python from qiskit import QuantumCircuit def solve(n) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) # 偶数と奇数の処理 for i in range(1, n, 2): # 1つ飛ばしで偶数インデックスに対してCXを適用 qc.cx(i - 1, i) if n % 2 == 1: # 奇数の場合、最後の量子ビットもペアリング qc.cx(n - 2, n - 1) qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
6
RE
1106 ms
140 MiB
'''python from qiskit import QuantumCircuit def create_bell_state(n) -> QuantumCircuit: qc = QuantumCircuit(n) # 1つ目の量子ビットにハダマードゲートを適用 qc.h(0) # CNOTゲートを順次適用して、エンタングルメントを作成 for i in range(1, n): qc.cx(i-1, i) # 最後に、Zゲートを適用して位相反転を行う qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
7
RE
1088 ms
140 MiB
'''python from qiskit import QuantumCircuit def create_bell_state(n) -> QuantumCircuit: qc = QuantumCircuit(n) for i in range(1, n, 2): qc.h(i - 1) qc.cx(i - 1, i) if n % 2 == 1: qc.h(n - 2) qc.cx(n - 2, n - 1) qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
8
RE
1551 ms
141 MiB
'''python from qiskit import QuantumCircuit def create_entangled_state(n) -> QuantumCircuit: qc = QuantumCircuit(n) # 最初の量子ビットにハダマードゲートを適用 qc.h(0) # 1つ目と2つ目の量子ビット間にCXゲートを適用 qc.cx(0, 1) # 2つ目以降を並列化してCXゲートを適用 for i in range(2, n): qc.cx(1, i) # 最後に、Zゲートを適用して |111...1> の振幅を -1 にする qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
9
RE
1435 ms
140 MiB
'''python from qiskit import QuantumCircuit def create_fully_parallel_entangled_state(n) -> QuantumCircuit: qc = QuantumCircuit(n) # 量子ビット0にハダマードゲートを適用 qc.h(0) # 最初の量子ビット0と1の間にCXゲートを適用 qc.cx(0, 1) # 2つ目の量子ビットを制御ビットとして、他の量子ビットにCXゲートを並列に適用 for i in range(2, n, 2): qc.cx(1, i) if i + 1 < n: qc.cx(1, i + 1) # さらに並列化: 2段階目の並列化 (この例では、3と4に並列に適用) for i in range(3, n, 2): if i + 1 < n: qc.cx(2, i + 1) # 最後に、Zゲートを適用して |111...1> の振幅を -1 にする qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
10
RE
1121 ms
140 MiB
'''python from qiskit import QuantumCircuit from qiskit.circuit.library import MCXGate def create_entangled_state_with_mcx(n) -> QuantumCircuit: qc = QuantumCircuit(n) # 最初の量子ビットにハダマードゲートを適用 qc.h(0) # 多重制御CXゲートを適用して、全ての量子ビットをエンタングルメント if n > 2: mcx_gate = MCXGate(num_ctrl_qubits=n-2) qc.append(mcx_gate, [i for i in range(n)]) else: qc.cx(0, 1) # 最後に、Zゲートを適用して |111...1> の振幅を -1 にする qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
11
RE
1384 ms
140 MiB
'''python from qiskit import QuantumCircuit def create_entangled_state_with_mcx(n) -> QuantumCircuit: qc = QuantumCircuit(n) # Step 1: 1から n % 2 個目までの量子ビットに H ゲートを適用 for i in range(0, n % 2): qc.h(i) # Step 2: 1個目と n % 2 + 1 個目の量子ビットに CX ゲートを適用 for i in range(0, n - 1, 2): if i + (n % 2) < n: qc.cx(i, i + (n % 2)) return qc qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
12
RE
1452 ms
140 MiB
'''python from qiskit import QuantumCircuit def create_entangled_state_with_mcx(n) -> QuantumCircuit: qc = QuantumCircuit(n) for i in range(0, n % 2): qc.h(i) for i in range(0, n % 2 + 1): qc.cx(i, i + (n % 2 + 1)) qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
13
RE
1350 ms
141 MiB
'''python def solve(n) -> QuantumCircuit: qc = QuantumCircuit(n) for i in range(0, n, 2): qc.h(i) # 偶数と奇数の処理 for i in range(1, n, 2): # 1つ飛ばしで偶数インデックスに対してCXを適用 qc.cx(i - 1, i) if n % 2 == 1: # 奇数の場合、最後の量子ビットもペアリング qc.cx(n - 2, n - 1) qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
14
WA
1649 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n) -> QuantumCircuit: qc = QuantumCircuit(n) for i in range(0, n, 2): qc.h(i) # 偶数と奇数の処理 for i in range(1, n, 2): # 1つ飛ばしで偶数インデックスに対してCXを適用 qc.cx(i - 1, i) if n % 2 == 1: # 奇数の場合、最後の量子ビットもペアリング qc.cx(n - 2, n - 1) qc.z(n-1) return qc '''
QPC002_A4
AC4D35B2115DB
15
WA
1416 ms
141 MiB
'''python from qiskit import QuantumCircuit def solve(n) -> QuantumCircuit: qc = QuantumCircuit(n) for i in range(0, n, 2): qc.h(i) # 偶数と奇数の処理 for i in range(1, n, 2): # 1つ飛ばしで偶数インデックスに対してCXを適用 qc.cx(i - 1, i) qc.z(i) if n % 2 == 1: # 奇数の場合、最後の量子ビットもペアリング qc.cx(n - 2, n - 1) qc.z(n - 1) return qc '''
QPC002_A4
AC78BC07966DB
1
DLE
1150 ms
141 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.z(0) qc.cx(0,range(1,n)) return qc '''
QPC002_A4
AC78BC07966DB
2
UME
'''python from qiskit import QuantumCircuit, Aer, transpile, assemble from qiskit.visualization import plot_histogram def create_state_psi(n): qc = QuantumCircuit(n) # Step 1: Apply Hadamard gate to all qubits for i in range(n): qc.h(i) # Step 2: Apply multi-controlled Z gate (with global phase change ignored) if n > 1: qc.h(n-1) qc.mcx(list(range(n-1)), n-1) # multi-controlled X (CNOT with (n-1) controls) qc.h(n-1) return qc '''
QPC002_A4
AC7F28E1B5454
1
WA
1202 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to the first qubit qc.h(0) # Apply CNOTs in a balanced tree structure for layer in range(1, (n-1).bit_length()): for i in range(1 << (layer - 1), min(1 << layer, n)): qc.cx(i - (1 << (layer - 1)), i) # Apply Z gate to the first qubit to introduce the minus sign qc.z(0) return qc '''
QPC002_A4
AC7F28E1B5454
2
WA
1640 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to the first qubit qc.h(0) # Apply CNOT gates to create the entanglement for i in range(1, n): qc.cx(0, i) # Apply X gate to all qubits to flip the sign of |1...1⟩ state for i in range(n): qc.x(i) # Apply Hadamard gate to the first qubit again qc.h(0) # Apply CNOT gates again to disentangle for i in range(1, n): qc.cx(0, i) return qc '''
QPC002_A4
AC7F28E1B5454
3
RE
1119 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to all qubits for i in range(n): qc.h(i) # Apply n-controlled Z gate qc.mcz(list(range(n))) return qc '''
QPC002_A4
AC7F28E1B5454
4
RE
1158 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to all qubits for i in range(n): qc.h(i) # Apply n-controlled Z gate qc.mcz(list(range(n))) return qc '''
QPC002_A4
AC7F28E1B5454
5
RE
1292 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to all qubits for i in range(n): qc.h(i) # Apply n-controlled Z gate qc.mcz(list(range(n))) return qc '''
QPC002_A4
AC7F28E1B5454
6
RE
1387 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to all qubits for i in range(n): qc.h(i) # Apply n-controlled Z gate qc.mcz(list(range(n))) return qc '''
QPC002_A4
AC7F28E1B5454
7
WA
1199 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to all qubits qc.h(range(n)) # Apply CNOT gates to create the state |ψ⟩ for i in range(n - 1): qc.cx(i, i + 1) # Apply a Z gate to the last qubit to get the correct sign qc.z(n - 1) return qc '''
QPC002_A4
AC7F28E1B5454
8
WA
1171 ms
141 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to the first qubit qc.h(0) # Apply controlled-Z gates to create the state for i in range(n - 1): qc.cz(i, i + 1) return qc '''
QPC002_A4
AC7F28E1B5454
9
WA
1547 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to each qubit for qubit in range(n): qc.h(qubit) # Apply controlled-Z gates between each pair of qubits for i in range(n): for j in range(i + 1, n): qc.cz(i, j) return qc '''
QPC002_A4
AC7F28E1B5454
10
DLE
1444 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to the first qubit qc.h(0) # Apply CNOT gates to create entanglement for qubit in range(n - 1): qc.cx(qubit, qubit + 1) # Apply a phase shift to the last qubit qc.z(n - 1) return qc '''
QPC002_A4
AC7F28E1B5454
11
WA
1187 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gates to all qubits for qubit in range(n): qc.h(qubit) # Apply controlled-Z gates between adjacent qubits for qubit in range(n - 1): qc.cz(qubit, qubit + 1) return qc '''
QPC002_A4
AC7F28E1B5454
12
WA
1775 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to the first qubit qc.h(0) # Apply CNOT gates in a chain for qubit in range(n - 1): qc.cx(qubit, qubit + 1) # Apply a phase flip to all qubits (except the first) to get the negative sign for qubit in range(1, n): qc.z(qubit) return qc '''
QPC002_A4
ACAB71FDB4892
1
WA
1376 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: # finding the mid qubit m = int(n/2) for i in range(m): qc.cx(0,m-i) if i > 0: qc.cx(m,m+i) if n%2 != 0: qc.cx(0,n-1) qc.z(0) return qc '''
QPC002_A4
ACAB71FDB4892
2
AC
2440 ms
143 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) # finding the mid qubit m = int(n/2) for i in range(m): qc.cx(0,m-i) if i > 0: qc.cx(m,m+i) if n%2 != 0: qc.cx(0,n-1) qc.z(0) return qc '''
QPC002_A4
ACD61AD8E3AE2
1
WA
1096 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.swap(0, n-1) qc.z(n-1) return qc '''
QPC002_A4
ACD61AD8E3AE2
2
WA
1096 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.cx(0, n-1) qc.z(n-1) return qc '''
QPC002_A4
AD0497D19273A
1
AC
2193 ms
145 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(1,n): j = (1<<(i.bit_length()-1)) qc.cx(i-j,i) qc.z(0) return qc '''
QPC002_A4
AD0B3D5874C54
1
DLE
1460 ms
154 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(n): if i==0: continue else: qc.cx(0,i) qc.z(0) return qc '''
QPC002_A4
AD0B3D5874C54
2
AC
1756 ms
157 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) qc.cx(0, 1) for i in range(2, n - 1, 2): qc.cx(0, i) qc.cx(1, i + 1) if n % 2 != 0: qc.cx(0, n - 1) qc.z(0) return qc '''
QPC002_A4
AD3B3478C5A2E
1
DLE
1439 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.x(0) qc.h(0) for i in range(n-1): qc.cx(i, i + 1) return qc '''
QPC002_A4
AD3B3478C5A2E
2
AC
2156 ms
142 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.cx(0, 1) for i in range(2, n - 1, 2): qc.cx(0, i) qc.cx(1, i + 1) if n % 2 != 0: qc.cx(0, n - 1) qc.z(0) return qc '''
QPC002_A4
AD444BF25B084
1
AC
2741 ms
160 MiB
'''python from qiskit import QuantumCircuit import math def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) circuitEnd = False for i in [int(pow(2, x)) for x in range(0, 4)]: for j in range(i): if (j + i >= n): circuitEnd = True break qc.cx(j, j + i) if (circuitEnd): break qc.z(0) return qc '''
QPC002_A4
AD50246C3797E
1
WA
1187 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.x(0) qc.h(0) for i in range(2,n): qc.cx(0,i) return qc '''
QPC002_A4
AD50246C3797E
2
RE
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(1, n): qc.cx(0, i) qc.z(0) return qc '''
QPC002_A4
AD50246C3797E
3
RE
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(2, n): qc.cx(0, i) qc.z(0) return qc '''
QPC002_A4
AD50246C3797E
4
WA
1519 ms
140 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.cx(0, i) qc.z(0) return qc '''
QPC002_A4
AD50246C3797E
5
DLE
1043 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.x(0) qc.h(0) for i in range(1, n): qc.cx(0, i) return qc '''
QPC002_A4
AD50246C3797E
6
RE
1301 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.x(0) qc.h(0) if n > 1: qc.append(MCXGate(n-1), range(1, n)) return qc '''
QPC002_A4
AD50246C3797E
7
RE
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.x(0) qc.h(0) if n > 1: for i in range(1, n): qc.cx(0, i) return qc '''
QPC002_A4
AD50246C3797E
8
DLE
1496 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.x(0) qc.h(0) if n > 1: for i in range(1, n): qc.cx(0, i) return qc '''
QPC002_A4
AD50246C3797E
9
RE
1173 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.x(0) qc.h(0) if n > 1: for i in range(1, n): qc.cx(0, i) optimized_qc = transpile(qc, optimization_level=3) return qc '''
QPC002_A4
AD50246C3797E
10
RE
1164 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.x(0) qc.h(0) if n > 1: for i in range(1, n): qc.cx(0, i) optimized_qc = transpile(qc, optimization_level=10) return qc '''
QPC002_A4
AD574EFBD2008
1
RE
1488 ms
140 MiB
'''python import math from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.ry(-math.pi, 0) for i in range(2, N + 1): qc.cx(i // 2 - 1, i - 1) return qc '''
QPC002_A4
AD574EFBD2008
2
WA
1233 ms
140 MiB
'''python import math from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.ry(-math.pi, 0) log = int(math.log2(n - 1)) + 1 swapped = [False] * n swapped[0] = True for i in range(log - 1, -1, -1): for j in range(n): if not swapped[j]: continue next_j = j * 2**i if next_j < n and not swapped[next_j]: swapped[next_j] = True qc.cx(j, next_j) return qc '''
QPC002_A4
AD574EFBD2008
3
WA
1669 ms
141 MiB
'''python import math from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.ry(-math.pi, 0) log = int(math.log2(n)) + 1 swapped = [False] * n swapped[0] = True for i in range(log - 1, -1, -1): for j in range(n): if not swapped[j]: continue next_j = j * 2**i if next_j < n and not swapped[next_j]: swapped[next_j] = True qc.cx(j, next_j) return qc '''
QPC002_A4
AD574EFBD2008
4
AC
2119 ms
143 MiB
'''python import math from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.ry(-math.pi, 0) log = int(math.log2(n - 1)) + 1 swapped = set([0]) for i in range(log - 1, -1, -1): done = set() for j in range(n): if j not in swapped: continue next_j = j + 2**i print(j, next_j) if next_j < n and next_j not in swapped: done.add(next_j) qc.cx(j, next_j) swapped |= done return qc '''
QPC002_A4
AD6C962E51626
1
AC
2290 ms
163 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) for i in range(1, n, 2): qc.cx(0, i) if i+1 < n: qc.cx(i, i+1) qc.z(0) return qc '''
QPC002_A4
AD7507A7503B1
1
WA
2017 ms
159 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) qc.cx(0, 1) for i in range(n-1): if i % 2 == 0: qc.cx(1, i) if i % 2 == 1: qc.cx(0, i) return qc '''
QPC002_A4
AD7507A7503B1
2
WA
1950 ms
160 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) qc.cx(0, 1) for i in range(n-1): if i % 2 == 0: qc.cx(1, i) if i % 2 == 1: qc.cx(0, i) qc.z(0) return qc '''
QPC002_A4
AD7507A7503B1
3
WA
1869 ms
160 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) qc.cx(0, 1) for i in range(n-1): if i % 2 == 0: qc.cx(1, i) if i % 2 == 1: qc.cx(0, i) qc.z(1) return qc '''
QPC002_A4
AD7507A7503B1
4
RE
1701 ms
156 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) for i in range(n): if i % 2 == 0: qc.cx(0, i) if i % 2 == 1: qc.cx(1, i) qc.z(0) return qc '''
QPC002_A4
AD7507A7503B1
5
RE
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) for i in range(n-1): if i % 2 == 0: qc.cx(0, i+1) if i % 2 == 1: qc.cx(, i+1) qc.z(0) return qc '''
QPC002_A4
AD7507A7503B1
6
AC
2213 ms
160 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) for i in range(n-1): if i % 2 == 0: qc.cx(0, i+1) if i % 2 == 1: qc.cx(1, i+1) qc.z(0) return qc '''
QPC002_A4
ADA4252D6054C
1
WA
1109 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qbit_list = list(range(1, n, 1)) done_list = [0] is_done = False while(True): doing_list = [] for c in done_list: if len(qbit_list)==0: is_done = True break target = qbit_list.pop(0) qc.cx(c, target) doing_list.append(target) if is_done: break done_list.extend(doing_list) return qc '''
QPC002_A4
ADA4252D6054C
2
AC
1973 ms
143 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qbit_list = list(range(1, n, 1)) done_list = [0] is_done = False while(True): doing_list = [] for c in done_list: if len(qbit_list)==0: is_done = True break target = qbit_list.pop(0) qc.cx(c, target) doing_list.append(target) if is_done: break done_list.extend(doing_list) qc.z(0) return qc '''
QPC002_A4
ADBCE4C243976
1
AC
2256 ms
142 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.x(0) qc.h(0) for i in range(1, n): qc.cx(i//2, i) return qc '''
QPC002_A4
ADE31A76CB302
1
RE
1806 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(n): qc.cx(0, n) return qc '''
QPC002_A4
ADE31A76CB302
2
RE
1173 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(n): if i == 0: continue qc.cx(0, n) return qc '''
QPC002_A4
ADE31A76CB302
3
RE
1088 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(n): if i == 0: continue qc.cx(0, n) return qc '''
QPC002_A4
ADE31A76CB302
4
WA
1571 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(n): if i == 0: continue qc.cx(0, i) return qc '''
QPC002_A4
ADE31A76CB302
5
WA
1560 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(1, n): qc.cx(0, i) return qc '''
QPC002_A4
ADE31A76CB302
6
WA
1062 ms
140 MiB
'''python from qiskit import QuantumCircuit def entangle_pairs(qc, qubits): for i in range(0, len(qubits) - 1, 2): qc.cx(qubits[i], qubits[i + 1]) def entangle_tree(qc, qubits): if len(qubits) <= 1: return entangle_pairs(qc, qubits) next_level = [qubits[i] for i in range(0, len(qubits), 2)] entangle_tree(qc, next_level) def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) entangle_tree(qc, list(range(n))) return qc '''
QPC002_A4
ADE31A76CB302
7
WA
1107 ms
140 MiB
'''python from qiskit import QuantumCircuit def entangle_pairs(qc, qubits): for i in range(0, len(qubits) - 1, 2): qc.cx(qubits[i], qubits[i + 1]) def entangle_tree(qc, qubits): if len(qubits) <= 1: return entangle_pairs(qc, qubits) next_level = [qubits[i] for i in range(0, len(qubits), 2)] entangle_tree(qc, next_level) def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) entangle_tree(qc, list(range(1, n))) return qc '''
QPC002_A4
ADE31A76CB302
8
DLE
1133 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(1, n): qc.cx(0, i) qc.z(0) return qc '''
QPC002_A4
ADE31A76CB302
9
WA
2377 ms
141 MiB
'''python from qiskit import QuantumCircuit def entangle_pairs(qc, qubits): """ペアごとにエンタングルメントを行う""" for i in range(0, len(qubits) - 1, 2): qc.cx(qubits[i], qubits[i + 1]) def entangle_tree(qc, qubits): """ツリー状にエンタングルメントを行う""" if len(qubits) <= 1: return entangle_pairs(qc, qubits) # 次のレベルの代表量子ビットを選択 next_level = [qubits[i] for i in range(0, len(qubits), 2)] entangle_tree(qc, next_level) def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # 量子ビット0を重ね合わせ状態にする qc.h(0) # 全ての量子ビットをツリー状にエンタングルメントする entangle_tree(qc, list(range(n))) qc.z(0) return qc '''
QPC002_A4
ADE31A76CB302
10
RE
1086 ms
140 MiB
'''python from qiskit import QuantumCircuit def split_list(lst): mid = len(lst) // 2 return lst[:mid], lst[mid:] def entangle_tree(qc, qubits): if len(qubits) == 1: return qubits[0] elif len(qubits) == 2: qc.cx(qubits[0], qubits[1]) return qubits[0] elif len(qubits) >= 3: left, right = split_list(qubits) return entangle_tree([entangle_tree(qc, left), entangle_tree(qc, right)]) def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) entangle_tree(qc, list(range(n))) qc.z(0) return qc '''
QPC002_A4
ADE31A76CB302
11
WA
1185 ms
141 MiB
'''python from qiskit import QuantumCircuit def split_list(lst): mid = len(lst) // 2 return lst[:mid], lst[mid:] def entangle_tree(qc, qubits): if len(qubits) == 1: return qubits[0] elif len(qubits) == 2: qc.cx(qubits[0], qubits[1]) return qubits[0] elif len(qubits) >= 3: left, right = split_list(qubits) return entangle_tree(qc, [entangle_tree(qc, left), entangle_tree(qc, right)]) def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) entangle_tree(qc, list(range(n))) qc.z(0) return qc '''
QPC002_A4
ADE31A76CB302
12
WA
1248 ms
140 MiB
'''python from qiskit import QuantumCircuit def split_list(lst): mid = len(lst) // 2 return lst[:mid], lst[mid:] def entangle_tree(qc, qubits): if len(qubits) == 1: return qubits[0] elif len(qubits) == 2: qc.cx(qubits[0], qubits[1]) return qubits[0] elif len(qubits) >= 3: left, right = split_list(qubits) return entangle_tree(qc, [entangle_tree(qc, left), entangle_tree(qc, right)]) def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) qc.cx(0, entangle_tree(qc, list(range(1, n)))) qc.z(0) return qc '''
QPC002_A4
ADE31A76CB302
13
WA
1713 ms
141 MiB
'''python from qiskit import QuantumCircuit def split_list(lst): mid = len(lst) // 2 return lst[:mid], lst[mid:] def entangle_tree(qc, qubits): if len(qubits) == 1: return qubits[0] elif len(qubits) == 2: qc.cx(qubits[0], qubits[1]) return qubits[0] elif len(qubits) >= 3: left, right = split_list(qubits) return entangle_tree(qc, [entangle_tree(qc, left), entangle_tree(qc, right)]) def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) qc.cx(0, 1) qc.cx(0, entangle_tree(qc, list(range(1, n)))) qc.z(0) return qc '''
QPC002_A4
ADE31A76CB302
14
WA
1086 ms
140 MiB
'''python from qiskit import QuantumCircuit def split_list(lst): mid = len(lst) // 2 return lst[:mid], lst[mid:] def entangle_tree(qc, qubits): if len(qubits) == 1: return qubits[0] elif len(qubits) == 2: qc.cx(qubits[0], qubits[1]) return qubits[0] elif len(qubits) >= 3: left, right = split_list(qubits) return entangle_tree(qc, [entangle_tree(qc, left), entangle_tree(qc, right)]) def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) qc.cx(0, entangle_tree(qc, list(range(1, n)))) qc.z(0) return qc '''
QPC002_A4
ADE31A76CB302
15
WA
1519 ms
142 MiB
'''python from qiskit import QuantumCircuit def split_list(lst): mid = len(lst) // 2 return lst[:mid], lst[mid:] def entangle_tree(qc, qubits): if len(qubits) == 1: return qubits[0] elif len(qubits) == 2: qc.cx(qubits[0], qubits[1]) return qubits[0] elif len(qubits) >= 3: left, right = split_list(qubits) return entangle_tree(qc, [entangle_tree(qc, left), entangle_tree(qc, right)]) def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) qc.cx(0, entangle_tree(qc, list(range(1, n)))) return qc '''
QPC002_A4
ADE31A76CB302
16
WA
1418 ms
141 MiB
'''python from qiskit import QuantumCircuit def split_list(lst): mid = len(lst) // 2 return lst[:mid], lst[mid:] def entangle_tree(qc, qubits): if len(qubits) == 1: return qubits[0] elif len(qubits) == 2: qc.cx(qubits[0], qubits[1]) return qubits[0] elif len(qubits) >= 3: left, right = split_list(qubits) return entangle_tree(qc, [entangle_tree(qc, left), entangle_tree(qc, right)]) def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) qc.cx(0, 1) entangle_tree(qc, list(range(1, n))) qc.z(0) return qc '''
QPC002_A4
ADE5459D072BE
1
DLE
1248 ms
141 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(n-1): qc.cx(i,i+1) qc.z(0) return qc '''
QPC002_A4
ADE5459D072BE
2
DLE
1268 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gate to the first qubit to create superposition qc.h(0) # Apply CNOT gates to entangle the qubits for i in range(n - 1): qc.cx(i, i + 1) # Add a Z gate to the last qubit to ensure the correct phase qc.z(n - 1) return qc '''
QPC002_A4
ADE5459D072BE
3
WA
1712 ms
141 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gates to all qubits for qubit in range(n): qc.h(qubit) # Apply CNOT gates to entangle the qubits # Use a sequence that allows for parallel gate applications for i in range(n - 1): qc.cx(i, i + 1) # Apply X gate to the last qubit to adjust the phase qc.x(n - 1) return qc '''
QPC002_A4
ADE5459D072BE
4
WA
1317 ms
142 MiB
'''python from qiskit import QuantumCircuit from qiskit.circuit.library import MCPhaseGate import numpy as np def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Apply Hadamard gates to all qubits qc.h(range(n)) # Apply multi-controlled phase gate # The phase θ = π to achieve the desired state theta = np.pi # Create a multi-controlled phase gate if n > 1: qc.append(MCPhaseGate(theta, n - 1), range(n)) return qc '''
QPC002_A4
ADE835C548ACC
1
RE
1066 ms
140 MiB
'''python def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(1, n): qc.cx(0, i) qc.z(0) return qc '''
QPC002_A4
ADE835C548ACC
2
DLE
1373 ms
141 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(1, n): qc.cx(0, i) qc.z(0) return qc '''
QPC002_A4
ADE835C548ACC
3
WA
1069 ms
141 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.cx(0, 1) for i in range(1, n): if i % 2 == 1: qc.cx(0, i) else: qc.cx(1, i) qc.z(0) return qc '''
QPC002_A4
ADE835C548ACC
4
AC
1838 ms
143 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.cx(0, 1) for i in range(2, n): if i % 2 == 1: qc.cx(0, i) else: qc.cx(1, i) qc.z(0) return qc '''
QPC002_A4
ADEEE840EA982
1
WA
1103 ms
140 MiB
'''python from qiskit import QuantumCircuit, QuantumRegister import qiskit.circuit.library as qlib import numpy as np def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) step = 1 while step < n: for i in range(0, n - step, step * 2): qc.cx(i, i + step) step *= 2 qc.z(0) return qc '''
QPC002_A4
ADEEE840EA982
2
TLE
3000 ms
142 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) ans = [0 for _ in range(n)] qc.cx(0, n//2) ans[0] = 1 ans[n//2] = 1 r = (n//2)//2 while not all(ans): for i in range(n-r): if ans[i] == 1 and ans[i+r] == 0: qc.cx(i, i+r) ans[i+r] = 1 r //= 2 qc.z(0) return qc return qc '''
QPC002_A4
ADEEE840EA982
3
TLE
3000 ms
143 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) ans = [0 for _ in range(n)] qc.cx(0, n//2) ans[0] = 1 ans[n//2] = 1 r = (n//2)//2 while not all(ans): for i in range(n-r): if ans[i] == 1 and ans[i+r] == 0: qc.cx(i, i+r) ans[i+r] = 1 r //= 2 qc.z(0) return qc '''
QPC002_A4
ADEEE840EA982
4
AC
2105 ms
142 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: if n == 3: return solve3() qc = QuantumCircuit(n) qc.h(0) ans = [0 for _ in range(n)] qc.cx(0, n//2) ans[0] = 1 ans[n//2] = 1 r = (n//2)//2 while not all(ans): for i in range(n-r): if ans[i] == 1 and ans[i+r] == 0: qc.cx(i, i+r) ans[i+r] = 1 if r != 1: r //= 2 else: break qc.z(0) return qc def solve3(): qc = QuantumCircuit(3) # Write your code here: qc.h(0) for i in range(1, 3): qc.cx(0, i) qc.z(0) return qc '''
QPC002_A4
AE4980A05EC38
1
RE
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: m = 0 qc.h(0) for i in range(5): for l in range(i): qc.cx(l,l+i+1) if l+i+1 > n: m = 1 break if m = 1: break qc.z(0) return qc '''
QPC002_A4
AE4980A05EC38
2
RE
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: m = 0 qc.h(0) for i in range(5): for l in range(i+1): qc.cx(l,l+i+1) if l+i+1 => n: m = 1 break if m = 1: break qc.z(0) return qc '''
QPC002_A4
AE4980A05EC38
3
AC
2209 ms
161 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: m = 1 qc.h(0) for i in range(5): for l in range(i+1): if m >= n: break qc.cx(l,m) m += 1 if m >= n: break qc.z(0) return qc '''
QPC002_A4
AE50A4A912A91
1
AC
1832 ms
143 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) qc.h(0) qc.z(0) for w in range(4): w = 1 << w for i in range(w, w << 1): if i < n: qc.cx(i - w, i) return qc '''
QPC002_A4
AE6D7BAEEC523
1
AC
2166 ms
143 MiB
'''python from qiskit import QuantumCircuit import math def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.cx(0, 1) if(n>2): qc.cx(0, 2) if(n>3): qc.cx(1, 3) if(n>4): qc.cx(0, 4) if(n>5): qc.cx(1, 5) if(n>6): qc.cx(2, 6) if(n>7): qc.cx(3, 7) if(n>8): qc.cx(0, 8) if(n>9): qc.cx(1, 9) if(n>10): qc.cx(2, 10) if(n>11): qc.cx(3, 11) if(n>12): qc.cx(4, 12) if(n>13): qc.cx(5, 13) if(n>14): qc.cx(6, 14) qc.crz(2*math.pi, 0, 1) return qc '''
QPC002_A4
AE9F7F939BF95
1
AC
1817 ms
145 MiB
'''python from qiskit import QuantumCircuit import numpy as np #from qiskit.quantum_info import Statevector def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) qc.cx(0,1) for i in range(1,4): for j in range(1,2**i+1): ind = 2**i + j - 1 if ind >= n: break qc.cx(ind-2**i,ind) qc.cp(np.pi,0,n-1) return qc qc = solve(5) print(qc) #print(Statevector(qc)) #こことimportを消す '''
QPC002_A4
AEAE14E6F607C
1
DLE
1167 ms
140 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(1,n): qc.cx(0,i) qc.z(0) return qc '''
QPC002_A4
AEAE14E6F607C
2
DLE
1157 ms
141 MiB
'''python from qiskit import QuantumCircuit def solve(n: int) -> QuantumCircuit: qc = QuantumCircuit(n) # Write your code here: qc.h(0) for i in range(1,n//2+1): qc.cx(0,i) for i in range(n//2+1,n): qc.cx(0,i) qc.z(0) return qc '''