QURI SDK Introduction
In this tutorial, we explain how to use the QURI VM to evaluate an algorithm. The workflow in this tutorial is illustrated in the following flow chart
The steps in the flow chart are:
- Define problem: Define the problem you want to solve. Here for example, we want to evaluate the expectation value , where is the Hamiltonian of a hydrogen molecule.
- Specify VM: Define the virtual machine (VM) that encapsulates device information and executors.
- Assemble algorithm: A function that defines the algorithm. In this case, we use the Hadamard test to evaluate the desired expectation value . The validity of our evaluation depends on the device, so a VM should be passed in as part of the algorithm.
- Algorithm output: The value of from the algorithm.
- Evaluate algorithm: The cost we need to run the algorithm, e.g. number of gates, circuit depth, execution time and circuit fidelity
We pick estimating the as the problem because it is an important building block of the statistical phase estimation, which is one of the major components in the QURI Algo library. We use this simplified example to demonstrate how different components of the QURI SDK work with each other to help you on your algorithm research journey.
Set up the problem
Following the flow chart, we first define our problem. Here, the hydrogen molecule's Hamiltonian is used as an example. We build the Hamiltonian with QURI Parts and wrap it inside a HamiltonianInput
that defines a problem in QURI Algo. Please refer to the QURI Parts Hamiltonian generation tutorial and the QURI Algo time evolution tutorial for detailed explanations.
import numpy as np
from pyscf import gto, scf
from quri_parts.pyscf.mol import get_spin_mo_integrals_from_mole
from quri_parts.openfermion.mol import get_qubit_mapped_hamiltonian
from quri_parts.core.operator import Operator, PAULI_IDENTITY
from quri_algo.problem import QubitHamiltonianInput
mole = gto.M(atom="H 0 0 0; H 0 0 1")
mf = scf.RHF(mole).run()
hamiltonian, mapping = get_qubit_mapped_hamiltonian(
*get_spin_mo_integrals_from_mole(mole, mf.mo_coeff)
)
# To avoid redundancy, we remove the identity part of the Hamiltonian,
# keeping only the part with non-trivial interactions.
eff_hamiltonian = hamiltonian - Operator({PAULI_IDENTITY: hamiltonian.constant})
hamiltonian_input = QubitHamiltonianInput(mapping.n_qubits, eff_hamiltonian)
Specify VM
Now, we specify the VM that drives our algorithm execution. Various types of devices and architectures are provided in QURI VM for you to customize the details of the device you want to simulate on.
Device properties
We build 2 VMs here corresponding to
- A NISQ superconducting device
- A device that runs on the STAR architecture
Generate NISQ Device properties
First, generate a set of NISQ device properties.
from quri_parts.backend.devices import nisq_spcond_lattice, star_device
from quri_parts.circuit.topology import SquareLattice
from quri_parts.backend.units import TimeValue, TimeUnit
from quri_vm import VM
nisq_property = nisq_spcond_lattice.generate_device_property(
lattice=SquareLattice(5, 5),
native_gates=("RZ", "SqrtX", "X", "CNOT"),
gate_error_1q=1e-3,
gate_error_2q=1e-2,
gate_error_meas=1e-2,
gate_time_1q=TimeValue(60, TimeUnit.NANOSECOND),
gate_time_2q=TimeValue(660, TimeUnit.NANOSECOND),
gate_time_meas=TimeValue(1.4, TimeUnit.MICROSECOND),
)
You can print out the properties for to inspect the details
from quri_parts.circuit import RZ, SqrtX, X, CNOT
print("NISQ device:")
print("----------------------------")
print("Logical qubit count:", nisq_property.qubit_count)
print("Physical qubit count:", nisq_property.physical_qubit_count)
print("native_gates:", nisq_property.native_gates)
print("\n")
print("NISQ Gate properties:")
print("----------------------------")
print("X gate property:", nisq_property.gate_property(X(0)))
print("SqrtX gate property:", nisq_property.gate_property(SqrtX(0)))
print("CNOT gate property:", nisq_property.gate_property(CNOT(0, 1)))
print("RZ gate property:", nisq_property.gate_property(RZ(0, 0.0)))
print("background error:", nisq_property.background_error)
# output:
NISQ device:
----------------------------
Logical qubit count: 25
Physical qubit count: 25
native_gates: ('RZ', 'SqrtX', 'X', 'CNOT')
NISQ Gate properties:
----------------------------
X gate property: GateProperty(gate='X', qubits=(), gate_error=0.001, gate_time=TimeValue(value=60, unit=<TimeUnit.NANOSECOND>), name=None)
SqrtX gate property: GateProperty(gate='SqrtX', qubits=(), gate_error=0.001, gate_time=TimeValue(value=60, unit=<TimeUnit.NANOSECOND>), name=None)
CNOT gate property: GateProperty(gate='CNOT', qubits=(), gate_error=0.01, gate_time=TimeValue(value=660, unit=<TimeUnit.NANOSECOND>), name=None)
RZ gate property: GateProperty(gate='RZ', qubits=(), gate_error=0.001, gate_time=TimeValue(value=60, unit=<TimeUnit.NANOSECOND>), name=None)
background error: None
Error corrected device properties
First, generate a set of error correction properties.
from quri_parts.backend.devices import star_device
from quri_parts.backend.units import TimeValue, TimeUnit
n_device_logical_qubit = mapping.n_qubits
p_phys = 1e-4
qec_cycle = TimeValue(1, TimeUnit.MICROSECOND)
code_distance = 9
star_property = star_device.generate_device_property(
n_device_logical_qubit, code_distance, qec_cycle, p_phys,
)
We can view various properties of the device like we did for the NISQ device
from quri_parts.circuit import H, S, CNOT, RZ
print("STAR device:")
print("----------------------------")
print("Logical qubit count:", star_property.qubit_count)
print("native_gates:", star_property.native_gates)
print("\n")
print("STAR Gate properties:")
print("----------------------------")
print("H gate property:", star_property.gate_property(H(0)))
print("S gate property:", star_property.gate_property(S(0)))
print("CNOT gate property:", star_property.gate_property(CNOT(0, 1)))
print("RZ gate property:", star_property.gate_property(RZ(0, 1)))
print("background error:", star_property.background_error)
# output:
STAR device:
----------------------------
Logical qubit count: 4
native_gates: ('H', 'S', 'CNOT', 'RZ')
STAR Gate properties:
----------------------------
H gate property: GateProperty(gate='H', qubits=(), gate_error=0.0, gate_time=TimeValue(value=27.0, unit=<TimeUnit.MICROSECOND>), name=None)
S gate property: GateProperty(gate='S', qubits=[], gate_error=0.0, gate_time=TimeValue(value=18.0, unit=<TimeUnit.MICROSECOND>), name=None)
CNOT gate property: GateProperty(gate='CNOT', qubits=(), gate_error=0.0, gate_time=TimeValue(value=18.0, unit=<TimeUnit.MICROSECOND>), name=None)
RZ gate property: GateProperty(gate='RZ', qubits=(), gate_error=2.6666488888826834e-05, gate_time=TimeValue(value=36.0, unit=<TimeUnit.MICROSECOND>), name=None)
background error: (5.8391629309539894e-09, TimeValue(value=1, unit=<TimeUnit.MICROSECOND>))
These are the basic properties that determine the outcome of simulating your circuits. Note that in the STAR architecture, the Clifford gates H, S and CNOT are fully error corrected so that the error rate is 0. However, the gate cannot be fully error corrected and the logical error rate relates to the physical error rate via:
Build the VMs
With the device properties, we build VM instances that encapsulates all the information about the transpiler, sampler and cost estimators.
ideal_vm = VM()
nisq_vm = VM.from_device_prop(nisq_property)
star_vm = VM.from_device_prop(star_property)
Assemble Hadamard test algorithm
Now, build the algorithm function that executes the algorithm and analyze the two Hadamard test circuit. The estimated expectation value as well as the cost estimations will be returned in the AlgoResult
defined below. The algorithm function is built from the TrotterTimeEvolutionHadamardTest
object from QURI Algo. Please refer to the estimator tutorial in QURI Algo.
from dataclasses import dataclass
from quri_algo.core.estimator.time_evolution_estimator.trotter import TrotterTimeEvolutionHadamardTest
from quri_parts.core.state import quantum_state
from quri_parts.core.estimator import Estimate
from quri_vm.vm import AnalyzeResult
@dataclass
class AlgoResult:
exp_val: Estimate
real_circuit_analysis: AnalyzeResult
imag_circuit_analysis: AnalyzeResult
def run_hadamard_test(vm: VM) -> AlgoResult:
n_trotter = 5
evolution_time = 5.0
n_shots = 10000
state = quantum_state(n_qubits=mapping.n_qubits, bits=0b11)
hadamard_test = TrotterTimeEvolutionHadamardTest(
hamiltonian_input, vm.sample, n_trotter, transpiler=vm.transpile
)
estimate = hadamard_test(state, evolution_time, n_shots=n_shots)
real_circuit = hadamard_test.real_circuit_factory(evolution_time)
imag_circuit = hadamard_test.imag_circuit_factory(evolution_time)
return AlgoResult(estimate, vm.analyze(real_circuit), vm.analyze(imag_circuit))
Execute with different VMs and evaluate
Finally, we reach the most right hand side of the flow chart above. We pass in the VM instances we created above to the algorithm function run_hadamard_test
.
import pprint
ideal_result = run_hadamard_test(ideal_vm)
nisq_result = run_hadamard_test(nisq_vm)
star_result = run_hadamard_test(star_vm)
We first look at the evaluation result of using an error free backend. Since it is running on a simulator, there is no transpilation involved. The gate count and depth are that of the input logical circuit. The corresponding circuit fidelity is 1.0, and there is not latency estimation.
pprint.pprint(ideal_result)
# output:
AlgoResult(exp_val=_Estimate(value=(-0.7456-0.6642j), error=nan),
real_circuit_analysis=AnalyzeResult(lowering_level=<LoweringLevel.LogicalCircuit: 0>,
qubit_count=5,
gate_count=142,
depth=116,
latency=None,
fidelity=1.0),
imag_circuit_analysis=AnalyzeResult(lowering_level=<LoweringLevel.LogicalCircuit: 0>,
qubit_count=5,
gate_count=143,
depth=117,
latency=None,
fidelity=1.0))
Next, we try to evaluate the circuit on a superconducting NISQ device, the device architecture only supports , , , gates, so transpilation is required. In the analysis summary below, you can see that the gate count and circuit depth are different from those in our last evaluation using the simulator backend due to the transpilation. Also, the VM contains the device noise characteristic. It is used to compute the latency and circuit fidelity of each circuit execution. The latency is in the unit of nanoseconds.
pprint.pprint(nisq_result)
n_shots = 10000
print(
"Hadamard test done in "
f"{(nisq_result.real_circuit_analysis.latency.in_ns() + nisq_result.imag_circuit_analysis.latency.in_ns()) * n_shots * 1e-9: .3f} "
"seconds on a NISQ device."
)
# output:
AlgoResult(exp_val=_Estimate(value=(-0.7452-0.659j), error=nan),
real_circuit_analysis=AnalyzeResult(lowering_level=<LoweringLevel.ArchLogicalCircuit: 1>,
qubit_count=5,
gate_count=4654,
depth=3327,
latency=TimeValue(value=1885320.0,
unit=<TimeUnit.NANOSECOND>),
fidelity=4.331718345687236e-15),
imag_circuit_analysis=AnalyzeResult(lowering_level=<LoweringLevel.ArchLogicalCircuit: 1>,
qubit_count=5,
gate_count=4655,
depth=3327,
latency=TimeValue(value=1885320.0,
unit=<TimeUnit.NANOSECOND>),
fidelity=4.327386627341549e-15))
Hadamard test done in 37.706 seconds on a NISQ device.
Then, we switch to the STAR architecture. From the analysis result, we can see that the fidelity improves from approximately 0 to 99.5%. However, the execution time is more than 10 times longer.
pprint.pprint(star_result)
n_shots = 10000
print(
"Hadamard test done in "
f"{(star_result.real_circuit_analysis.latency.in_ns() + star_result.imag_circuit_analysis.latency.in_ns()) * n_shots * 1e-9: .3f} "
"seconds on STAR architecture."
)
# output:
AlgoResult(exp_val=_Estimate(value=(-0.7472-0.6682j), error=nan),
real_circuit_analysis=AnalyzeResult(lowering_level=<LoweringLevel.ArchLogicalCircuit: 1>,
qubit_count=5,
gate_count=1602,
depth=940,
latency=TimeValue(value=19710000.0,
unit=<TimeUnit.NANOSECOND>),
fidelity=0.99570046186266),
imag_circuit_analysis=AnalyzeResult(lowering_level=<LoweringLevel.ArchLogicalCircuit: 1>,
qubit_count=5,
gate_count=1605,
depth=940,
latency=TimeValue(value=19710000.0,
unit=<TimeUnit.NANOSECOND>),
fidelity=0.99570046186266))
Hadamard test done in 394.200 seconds on STAR architecture.
Summary
We summarize the flow of working with QURI VM and QURI Algo. Referring back to different sections of this tutorial, we started by defining a problem Hamiltonian on which we want to evaluate the physical observable . Then, we proceed to define the VMs for NISQ device and STAR device. The VM is supposed to be part of the input of the algorithm function run_hadamard_test
. Finally, we run and evaluate the algorithms with different VMs. The output of the algorithm contains the estimated value of as well as the cost and fidelity of running the Hadamard test circuit.