Born at Nobel Symposium 210 · Quantum Software Lab

Primitive–Platform Matchmaking

Tell us about your machine. We map the algorithmic primitives onto it and send you a matchmaking report: candidate primitive constructions for your machine, the assumptions to check, and experiments that would show them.

This is an open, academic pilot run by the Quantum Software Lab (University of Edinburgh) with the research community. It is non-commercial: nothing you share is used for any commercial purpose. We ask only for knowledge that is already in the public domain, such as published papers, talks and public specifications. Any level of participation is welcome, from a single paragraph to a conversation with your team.

Your academic research system. We ask about your academic, white-box system: the most advanced one in your lab today. We do not ask about any commercial platform, product or company you may be connected to.

Not a benchmark. We match primitives to your platform as it is today and suggest candidate constructions for it. It is a snapshot of a current academic platform, not a score, a ranking or a verdict on your design.

Public results are about primitives, not platforms. What each primitive needs from hardware is open on the Atlas, so any group can design towards it. Nothing about your platform is published without your approval.

Use it both ways. If you design for error correction and scale independently of applications, the open requirements can help you adjust your design; tell us when it changes and we update your match. There is no exclusivity and no long-term commitment: update, switch or leave whenever you wish.

Born at Nobel Symposium 210

This pilot was conceived for, and launched at, Nobel Symposium 210 in Stellenbosch, in October 2026. The symposium brought the people who design quantum algorithms and the people who build quantum machines into the same room for a week. The question raised there, which primitive each machine runs natively, is the question this pilot tries to answer. We are grateful to the symposium for making that conversation possible, and we hope the matchmaking keeps it going.

Why

Algorithms are built from a small set of primitives, each defined by a contract: what it needs and what it guarantees. Machines differ in what they make cheap. Two devices on the same physics can favour different primitives because they scale differently: shuttling, photonic links, microwave control. Today the match between primitives and hardware is made case by case. We want to make it systematic, on correct data, with the people who build the machines.

A note on words: in the Atlas, an "architectural primitive" is a family of circuits, such as a quantum convolutional network. Your machine gets its own hardware card.

How it works

You

Describe your hardware and its cheap and costly operations, in your own words. Point us to papers, or a person.

We

Read your input with the Atlas cards and the literature, and match primitives and their variants to your machine.

You

Receive your report first, in early 2027. You correct it, and you decide what, if anything, becomes public.

What we ask: eight parts

  1. Your configuration. Your academic research system as it is today (not a commercial platform): group, a named configuration, a public reference, and where the report goes.
  2. Physical structure and interactions. Carriers, and the interactions available today.
  3. Preparing, using and keeping states and data. Copies, memory, inverse and coherently controlled operations, data access.
  4. Readout and control during a run. Measurement, reset, feedback, detection.
  5. What enters, leaves and connects. Classical and quantum input and output, modules, and what crosses a connection: links that matter for verification and for joining communication and computing.
  6. What to explore today, and your design intent, kept separate from today's snapshot.
  7. What you would most like a theorist to tell you.
  8. Your consent.

Parts 2 to 5 are your Lego pieces: tick what your machine offers today. For up to two things that matter most in each part, tell us whether it is native, routine or costly on your machine today, and how your machine does it, in a few words or with a paper link. No numbers, no weights. You do not need to choose primitives: the matchmaking is our job. Please share only what is already public, and nothing under a non-disclosure agreement or export control.

What you get

How we work together

Privacy notice

Contact: Elham Kashefi, ekashefi@exseed.ed.ac.uk. Please do not send confidential material by email.