Job Description
QuantWare is hiring a Senior Quantum Algorithm Expert in Delft to turn real industrial problems, in optimisation, machine learning and finance, into quantum algorithms, and then to work out what hardware those algorithms would actually demand.
At a glance
- Position: Senior Quantum Algorithm Expert
- Where: Delft, Netherlands
- Pay: QuantWare does not state a salary in this posting
- Type: Full time, permanent
- Apply by: open until filled; re-check before applying
- Apply: open until filled (re-checked 16 October 2026)
About the senior quantum algorithm expert role at QuantWare
- Develop and validate quantum computing applications by mapping real enterprise use cases in optimisation, machine learning and finance onto quantum algorithms with proven speed-ups
- Build frameworks that resource-estimate circuit execution and translate algorithms into fault-tolerant physical hardware requirements
- Act as technical lead for automating application mapping and resource estimation, defining the structure, logic and trade-offs with the software teams
- Work with the quantum hardware and systems engineering teams so that algorithmic requirements feed back into processor design
- Follow academic and industry developments in quantum algorithms and error-correction implementations
This is a bridging role between algorithms and silicon: the resource estimates you produce become specifications that the processor teams design against, and the posting describes you as the technical lead for automating that mapping. QuantWare adds that candidates who do not meet every listed point are still encouraged to apply. The posting does not give a closing date, so the role stays listed until it is filled. Re-check the official posting before you apply.
What QuantWare is looking for
- A PhD in quantum computing, computer science or quantum information science
- Five or more years of post-degree research or industry experience in quantum algorithm and application development and resource estimation
- Deep expertise in quantum algorithms and resource estimation
- A drive to move past purely theoretical algorithms towards practical applications
- Comfort taking ownership from day one in a collaborative team
Nice to have
- Expertise in circuit compilation, quantum error correction or mitigation, and noise modelling, which the posting highly prefers
- Experience running quantum workflows on physical hardware, or a close affinity with superconducting hardware
- Experience automating algorithm-to-hardware mapping
Pay and location
QuantWare does not state a salary in this posting
How to apply
Apply through the official QuantWare job posting. QuantWare’s posting does not give a closing date, so the role is open until filled; ResearchJobs.in will re-check this listing on 16 October 2026. Check the posting for location and work-authorisation details before you apply.
See all our quantum technology jobs, or browse more research jobs on ResearchJobs.in.
Hiring institution: QuantWare
Official advertisement: jobs.ashbyhq.com
How to prepare for this application
- Bring a mapped use case: show one industrial problem you took from a business description to a circuit, including what you had to approximate.
- Be honest about speed-ups: the advertisement says proven computational speed-ups, so know which claims hold up.
- Think in hardware units: practise converting a logical algorithm into physical qubit and runtime requirements.
- Automate something: the role is about building tooling, so show code that turned a manual analysis into a repeatable pipeline.
- Read up on VIO: QuantWare's scaling architecture is public, and it explains why their resource questions look the way they do.
About QuantWare
QuantWare, based in Delft, makes superconducting quantum processors and sells them to laboratories and companies building their own quantum computers. Its VIO architecture routes signals vertically through the chip rather than across its surface, which the company presents as the way past the wiring bottleneck that limits how many qubits a processor can carry.