Skip to content
Back to the wider directory
Portrait of Elham Kashefi.
WIDER PEOPLE DIRECTORY

Elham Kashefi

Professor of Quantum Computing; Chief Scientist, NQCC; CNRS research director

University of Edinburgh; NQCC; LIP6, Sorbonne Université

National Quantum Computing Centre
Identification checked 2026-09-23

Photo: Elham Kashefi August 2003.jpg Andrej Bauer. CC BY-SA 2.5 Slovenia. Resized proportionally for this website. Square presentation crops the displayed portrait; the full source rendition is preserved. Photograph date: 2003-08-29. Modified renditions remain under CC BY-SA 2.5 Slovenia.

Quantum softwareQuantum networks
WHY THIS RECORD

Kashefi develops protocols for delegated and verifiable quantum computation, including methods that let a client use a quantum server while protecting the computation within a defined model.

National Quantum Computing CentrearXiv / FOCS

Cloud access raises questions about what a quantum server can learn and whether a client can trust a result. Kashefi's joint work with Anne Broadbent and Joseph Fitzsimons proposed universal blind quantum computation, separating the client's limited quantum preparation from the server's larger computational resources. The protocol gives privacy and authentication statements under explicit assumptions. Her inclusion reflects those documented software and protocol contributions, alongside her research leadership, without claiming that every commercial quantum cloud automatically offers the same guarantees.

National Quantum Computing CentrearXiv / FOCS

Defining contributions

Work, in context
  1. 2008

    Universal blind quantum computation

    Broadbent, Fitzsimons and Kashefi proposed an interactive protocol allowing a client with limited single-qubit preparation to delegate a computation while keeping inputs, outputs and the computation private within the protocol's model.

    Joint theoretical work by Anne Broadbent, Joseph Fitzsimons and Elham Kashefi; timeline uses first preprint submission, ahead of FOCS 2009 publication.

    Source-supported recordarXiv / FOCS

Keep in perspective

Privacy and verification depend on the specified protocol, threat model and physical implementation.

FOLLOW THE RECORD

The evidence map

Person → documented contribution → supporting source. Select a contribution to inspect what the evidence establishes.

Elham Kashefi
Contributed to
Supported by

Universal blind quantum computation

Primary paper

Universal blind quantum computation

Supports: Coauthors, client and server capabilities, interactive protocol, privacy, authentication and fault-tolerant extensions.

Published Jul 25, 2008 · Checked Sep 23, 2026

Credit & limits: Joint theoretical work by Anne Broadbent, Joseph Fitzsimons and Elham Kashefi; timeline uses first preprint submission, ahead of FOCS 2009 publication.

Read the full contribution
Contributions and their source records
ContributionEvidence & what it supportsCredit & limits
Universal blind quantum computation2008
Primary paperUniversal blind quantum computation

Coauthors, client and server capabilities, interactive protocol, privacy, authentication and fault-tolerant extensions.

Published 2008-07-25 · Checked 2026-09-23
Joint theoretical work by Anne Broadbent, Joseph Fitzsimons and Elham Kashefi; timeline uses first preprint submission, ahead of FOCS 2009 publication.

Follow the evidence

2 sources

Primary papers, institutional records and attributed announcements. Each source supports the claims linked above.

  • National Quantum Computing CentreInstitutional record

    NQCC leadership: Elham Kashefi

    Chief Scientist, Edinburgh quantum-computing professorship and CNRS/LIP6 Sorbonne research-director affiliation.

    Checked 2026-09-23
  • arXiv / FOCSPrimary paper

    Universal blind quantum computation

    Coauthors, client and server capabilities, interactive protocol, privacy, authentication and fault-tolerant extensions.

    Published 2008-07-25 · Checked 2026-09-23
QubitWire editorial · Directory record 2026-09-23.1Independent coverage. Inclusion does not imply endorsement.