25 citations · 71 across the 6 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…
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…
Simple performance evaluation of pulsed spontaneous parametric down-conversion sources for quantum communications
Jean-Loup Smirr, Sylvain Guilbaud, Joe Ghalbouni +4
Fast and complete characterization of pulsed spontaneous parametric down conversion (SPDC) sources is important for applications in quantum information processing and communication…
Experimental wavelength division multiplexed photon pair distribution
Joe Ghalbouni, Imad Agha, Robert Frey +2
We have experimentally implemented the distribution of photon pairs produced by spontaneous parametric down conversion through telecom dense wavelength division multiplexing filter…