- Starting skills
- Python, matrices and second-quantized operator basics
- Portfolio output
- Mapping audit with deliberate-error diagnosis
- A useful completion check
- Small-model spectra or observables agree under documented conventions
- Hardware needed
- No
- Resource boundary
- Operator term count is not complete application runtime
Google Quantum AI’s OpenFermion documentation provides tools for representing fermionic operators and transforming them into qubit operators. This pathway uses a small model to build an audit trail from the physical operator to the matrix used in a computation. The skill is not merely calling a transformation function. It is preserving ordering, conventions and equivalence checks so another reader can understand what problem the resulting circuit or matrix represents. This is a self-directed project, not a Google vacancy or a claim of quantum advantage.
Start with a two- or few-mode Hamiltonian small enough to inspect directly. State the mode ordering, coefficients, basis convention and particle-number sector of interest. Construct the operator through the library and also write a transparent reference representation. Then compare the spectra or expectation values in a way that accounts for basis ordering. Two matrices can look different while representing the same physical problem under a basis change; conversely, a familiar-looking matrix can be wrong because a sign or ordering convention was lost.
The central exercise is to introduce one deliberate bookkeeping error and diagnose it. Swap a mode ordering without updating the interpretation, omit a sign or compare sectors inconsistently. The report should show which invariant or test exposes the mistake. This makes the portfolio more informative than a notebook that only reproduces the tutorial’s final output. It demonstrates that the author understands the mapping boundary and can design a check that would catch a realistic error in a larger scientific workflow.
Next, connect the qubit representation to a resource question. Count the resulting operator terms and identify which transformations change that representation. Do not infer complete algorithm runtime from a term count alone. State what additional work would be required to compile an evolution, measure an energy or solve the chosen task. The comparison can remain symbolic or use a tiny exact simulation. Its purpose is to show how a representation decision influences downstream computation while keeping the actual task and accuracy target fixed.
Questions to take with you
Why can two equivalent matrices look different?
Their bases or mode orderings may differ. The comparison should align conventions or compare a suitable invariant rather than requiring identical printed entries without context.
What makes the deliberate error useful?
It shows that the verification method can detect a realistic failure. The notebook should explain both why the error is wrong and why the chosen check exposes it.
Self-directed project; no vacancy, completed execution, certification or employer endorsement is implied. Pin the software environment before presenting runnable code.
Sources and what they show (2)
- Introduction to OpenFermion ↗Google Quantum AI · Accessed 2026-10-17
FermionOperator representation and introductory transformations
No application speedup follows from representation alone.
- Jordan–Wigner and Bravyi–Kitaev transforms ↗Google Quantum AI · Accessed 2026-10-17
Official transform tutorial
Equivalence checks must respect mode and basis conventions.