These are currently available projects that will be accepting candidate applications in the upcoming FLiQC Scholarship Round opening on 26 August 2026.
Applications will be processed through Sydney Quantum Academy. Prepare ahead by reading Application Guidelines and Conditions of the Award.
We recommend contacting the academic supervisors listed for relevant project now to express your interest and prepare ahead of the application open date. Click on their name below to email them.
Project: Integrating nuclear spins with quantum dots in silicon
Research Team
- Dr Danielle Holmes (UNSW) – Academic Supervisor
- Scientia Professor Andrea Morello (UNSW) – Academic Supervisor
- Associate Professor Henry Yang (Diraq) – Industry Partner Supervisor
Project Description
The project seeks to develop a quantum computer device where the nuclear spin of a donor atom in silicon is integrated with a gate-defined quantum dot. This type of device will represent the unit cell of a scalable quantum processor, which combines the exceptional coherence and gate fidelity of nuclear spins with the addressability and manufacturability of semiconductor quantum dots. The ultimate objective is to build a fault-tolerant, error-corrected silicon quantum computer with local logical encoding in the nuclear spin of donor atoms, and electrons in quantum dots providing medium-range interactions between logical qubits. The project will be conducted in partnership with Diraq Pty. Ltd., which is developing scalable quantum dot devices in silicon. The project is experimental in nature, and will involve the design, fabrication and operation of advanced silicon quantum devices.
This project would suit: This project is ideal for candidates with a strong background and interest in quantum engineering and quantum physics.
Project: Quantum algorithms for exact exponential-time combinatorial optimisation
Research Team
- A/Prof Troy Lee (UTS) – Academic Supervisor
- Dr Ben Travaglione (DSTG) – Partner Supervisor
Project Description
This project investigates exact quantum algorithms for NP-hard combinatorial optimisation problems, with the goal of improving the worst-case exponential running time. A representative target is Maximum Independent Set: given a graph G n vertices, find the largest set of vertices with no edges between them.
The best published classical algorithm for Maximum Independent Set runs in time 1.1996^n (up to polynomial factors), while the best published quantum algorithm achieves expected running time proportional to 1.1488^n, which is an improvement in the base of the exponential base but still far from the kind of square-root quantum speedups seen in unstructured search.
A major open direction is whether one can obtain a super-quadratic quantum speedup for exact, worst-case Maximum Independent Set, or for closely related problems such as Minimum Vertex Cover. The project will explore new quantum algorithmic ideas and analyses–e.g., quantum-accelerated branching/backtracking and or quantum divide and conquer–to push the best known worst-case bounds.
This project would suit: Students with a strong background in mathematics and/or theoretical computer science, prior quantum computing knowledge is welcome but not required. The research will be conducted in collaboration with the Australia Defence Science and Technology Group. Due to project requirements, the position is open only to citizens of AUKUS countries (Australia, United Kingdom, United States).
