activity
20172026
most citedPerceval: A Software Platform for Discrete Variable Photonic Quantum Computing

71 citations · 157 across the 20 of their papers we have counts for

collaborators

20 papers

quant-ph2026

Efficient training of photonic quantum generative models

Felix Gottlieb, Chayma Faraji, Rawad Mezher +3

The topic of generative learning has gained traction within the field of quantum machine learning, in particular with the advent of train-on-classical, deploy-on-quantum methods. T…

quant-ph2026

Exponential improvement in benchmarking multiphoton interference

Rodrigo M. Sanz, Emilio Annoni, Stephen C. Wein +4

Several photonic quantum technologies rely on the ability to generate multiple indistinguishable photons. Benchmarking the level of indistinguishability of these photons is essenti…

quant-ph2025

Establishing Baselines for Photonic Quantum Machine Learning: Insights from an Open, Collaborative Initiative

Cassandre Notton, Vassilis Apostolou, Agathe Senellart +28

The Perceval Challenge is an open, reproducible benchmark designed to assess the potential of photonic quantum computing for machine learning. Focusing on a reduced and hardware-fe…

quant-ph2025

New designs of linear optical interferometers with minimal depth and component count

Timothée Goubault de Brugière, Rawad Mezher, Sebastian Currie +1

We adapt an algorithm for CNOT circuits synthesis based on the Bruhat decomposition to the design of linear optical circuits with Mach-Zehnder interferometers (MZI). The synthesis…

quant-ph2024★ 3 cited

On the role of coherence for quantum computational advantage

Hugo Thomas, Pierre-Emmanuel Emeriau, Rawad Mezher +3

Quantifying the resources available to a quantum computer appears to be necessary to separate quantum from classical computation. Among them, entanglement, nonstabilizerness and co…

quant-ph2024

Connecting quantum circuit amplitudes and matrix permanents through polynomials

Hugo Thomas, Pierre-Emmanuel Emeriau, Rawad Mezher

In this paper, we strengthen the connection between qubit-based quantum circuits and photonic quantum computation. Within the framework of circuit-based quantum computation, the su…

quant-ph2024

Restricted Randomized Benchmarking with Universal Gates of Fixed Sequence Length

Mohsen Mehrani, Kasra Masoudi, Rawad Mezher +2

The standard randomized benchmarking protocol requires access to often complex operations that are not always directly accessible. Compiler optimization does not always ensure equa…

quant-ph2024★ 1 cited

Mitigating photon loss in linear optical quantum circuits

James Mills, Rawad Mezher

Photon loss rates set an effective upper limit on the size of computations that can be run on current linear optical quantum devices. We present a family of techniques designed to…

quant-ph2024★ 5 cited

Error-mitigated photonic quantum circuit Born machine

Alexia Salavrakos, Tigran Sedrakyan, James Mills +2

In this article, we study quantum circuit Born machines (QCBMs) in the context of photonic quantum computing. QCBMs are a popular choice of quantum generative machine learning mode…

quant-ph2023★ 8 cited

A general-purpose single-photon-based quantum computing platform

Nicolas Maring, Andreas Fyrillas, Mathias Pont +24

Quantum computing aims at exploiting quantum phenomena to efficiently perform computations that are unfeasible even for the most powerful classical supercomputers. Among the promis…

quant-ph2023

Solving graph problems with single-photons and linear optics

Rawad Mezher, Ana Filipa Carvalho, Shane Mansfield

An important challenge for current and near-term quantum devices is finding useful tasks that can be preformed on them. We first show how to efficiently encode a bounded $n \times…

quant-ph2022★ 71 cited

Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing

Nicolas Heurtel, Andreas Fyrillas, Grégoire de Gliniasty +13

We introduce Perceval, an open-source software platform for simulating and interfacing with discrete-variable photonic quantum computers, and describe its main features and compone…

quant-ph2022★ 3 cited

Assessing the quality of near-term photonic quantum devices

Rawad Mezher, Shane Mansfield

For near-term quantum devices, an important challenge is to develop efficient methods to certify that noise levels are low enough to allow potentially useful applications to be car…

quant-ph2021★ 15 cited

Mitigating errors by quantum verification and post-selection

Rawad Mezher, James Mills, Elham Kashefi

Correcting errors due to noise in quantum circuits run on current and near-term quantum hardware is essential for any convincing demonstration of quantum advantage. Indeed, in many…

quant-ph2021★ 1 cited

Randomized Benchmarking with Stabilizer Verification and Gate Synthesis

Ellen Derbyshire, Rawad Mezher, Theodoros Kapourniotis +1

Recently, there has been an emergence of useful applications for noisy intermediate-scale quantum (NISQ) devices notably, though not exclusively, in the fields of quantum machine l…

quant-ph2021★ 6 cited

Efficient Construction of Quantum Physical Unclonable Functions with Unitary t-designs

Niraj Kumar, Rawad Mezher, Elham Kashefi

Quantum physical unclonable functions, or QPUFs, are rapidly emerging as theoretical hardware solutions to provide secure cryptographic functionalities such as key-exchange, messag…

quant-ph2020★ 8 cited

Fault-tolerant quantum speedup from constant depth quantum circuits

Rawad Mezher, Joe Ghalbouni, Joseph Dgheim +1

A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task. By now, several…

quant-ph2019★ 5 cited

Unitary -designs from seeds

Rawad Mezher, Joe Ghalbouni, Joseph Dgheim +1

The capacity to randomly pick a unitary across the whole unitary group is a powerful tool across physics and quantum information. A unitary -design is designed to tackle this ch…

quant-ph2019★ 6 cited

Efficient approximate unitary t-designs from partially invertible universal sets and their application to quantum speedup

Rawad Mezher, Joe Ghalbouni, Joseph Dgheim +1

At its core a -design is a method for sampling from a set of unitaries in a way which mimics sampling randomly from the Haar measure on the unitary group, with applications acro…

quant-ph2017★ 25 cited

Efficient quantum pseudorandomness with simple graph states

Rawad Mezher, Joe Ghalbouni, Joseph Dgheim +1

Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. U…