|
Sequential Quantum Gate Decomposer
v1.9.6
Powerful decomposition of general unitarias into one- and two-qubit gates gates
|
Go to the source code of this file.
Namespaces | |
| benchmark | |
Functions | |
| def | benchmark.normalize_state (state) |
| def | benchmark.preprocess_qasm_angles |
| def | benchmark.projectq_import_qasm (filename, eng, initial_state=None) |
| def | benchmark.purity_analysis () |
| def | benchmark.state_vector_equivalence (psi, phi) |
| def | benchmark.test_partitions (max_qubits=4) |
| def | benchmark.test_simulation (max_qubits=4, random_initial_state=True) |
Variables | |
| int | benchmark.MAX_GATES_ALLOWED = 1024**2 |
| list | benchmark.METHOD_NAMES |
| dictionary | benchmark.SUPPORTED_GATES = {x for n in dir(gate) for x in (getattr(gate, n),) if not n.startswith("_") and issubclass(x, gate.Gate) and n != "Gate"} |
| dictionary | benchmark.SUPPORTED_GATES_NAMES = {n for n in dir(gate) if not n.startswith("_") and issubclass(getattr(gate, n), gate.Gate) and n != "Gate"} |
| bool | benchmark.USE_ILP = True |
1.8.13