def generate_qasm_code(nancillas,
qubits,
unitary_operation,
custom_prepare='# No custom preparation given by user',
extra_empty_bits=0):
# Check if QASM en then replace q[i] with q[i + nancilla] etc
if isinstance(
unitary_operation, str
) and 'QASM' in unitary_operation and not unitary_operation.endswith('\n'):
unitary_operation += "\n"
for i in range(nancillas + 2 * qubits, -1, -1):
if isinstance(unitary_operation, str) and 'QASM' in unitary_operation:
if f'q[{i}]' in unitary_operation:
unitary_operation = unitary_operation.replace(
f'q[{i}]', f'q[{i + nancillas}]')
if f'q[{i}]' in custom_prepare:
custom_prepare = custom_prepare.replace(f'q[{i}]',
f'q[{i + nancillas}]')
total = nancillas + qubits
final_qasm = f"""version 1.0
qubits {total + qubits + extra_empty_bits}
# Prepare qubits \n.preparation\n
prep_z q[0:{total - 1}]
{ '' if extra_empty_bits == 0 else f'prep_z q[{total + qubits + extra_empty_bits - 1}]' if extra_empty_bits == 1 else f'prep_z q[{total + qubits}:{total + qubits + extra_empty_bits - 1}]' }
# Custom prepare
{custom_prepare}
# Create superposition
"""
if nancillas == 1:
final_qasm += f'H q[0]\n'
else:
final_qasm += f'H q[0:{nancillas - 1}]\n'
if qubits == 1:
final_qasm += f'X q[{nancillas}]\n'
else:
final_qasm += f'X q[{nancillas}:{total + qubits}]\n'
final_qasm += '\n# Apply controlled unitary operations\n.controlled_unitary_operations\n'
unitary_operations = get_unitary_operators_array(unitary_operation,
nancillas, qubits)
for i in range(nancillas):
operation = unitary_operations[i]
if operation == 'I':
continue
# If the operation is more complex we make sure to put QASM on the first line of the operation (arbitrary unitary operation)
if 'QASM' in operation:
operation = '\n'.join(operation.split('\n')[1:])
final_qasm += operation
continue
# If the operation is a single or double quantum unitary operation
controls = [i]
final_qasm += find_controlled_equivalent(operation, controls,
total - 1, nancillas, qubits)
final_qasm += '\n# Apply inverse quantum phase estimation\n.Inverse_Quantum_Fourier_Transform\n'
final_qasm += generate_inverse_qft(nancillas) + '\n'
# for i in range((total + qubits + extra_empty_bits) - 1):
# final_qasm += f'Measure_z q[{i}]\n'
return final_qasm
def test_CRk(self):
result = get_unitary_operators_array(['CRk', '3'], 5)
for res in result:
self.assertFalse('Invalid generator' in res)
def test_Z_matrix(self):
result = get_unitary_operators_array(np.array([[1, 0], [0, -1]]), 5)
for res in result:
self.assertFalse('Invalid generator' in res)
def test_Z_operator_vs_matrix(self):
result1 = get_unitary_operators_array(np.array([[1, 0], [0, -1]]), 5)
result2 = get_unitary_operators_array('Z', 5)
self.assertListEqual(result1, result2)
def test_Z(self):
result = get_unitary_operators_array('Z', 5)
for res in result:
self.assertFalse('Invalid generator' in res)