activity
20132026
most citedResource reduction for distributed quantum information processing using quantum multiplexed photons

33 citations · 72 across the 14 of their papers we have counts for

collaborators

15 papers

cs.DM2026

Oblivious Self-Distance Symmetric Rendezvous on the Integer Line

Konstantinos Georgiou, Claude Gravel, Lazar Mandic +1

Symmetric rendezvous on the line is a search problem in which two agents, initially placed at distance , must follow the same randomized strategy to meet as quickly as possible…

cs.IT2026

Algorithms, Complexity, and Entropy of the Bernard-Letac Fair-Sampling Construction

Claude Gravel

Bernard and Letac (1971) introduced a method for uniform random sampling among outcomes from an unknown biased source of independent and identically distributed symbols. The pr…

quant-ph2026

Improving Zero-Noise Extrapolation via Physically Bounded Models

Andriy Miranskyy, Adam Sorrenti, Jasmine Thind +1

Zero-noise extrapolation (ZNE) mitigates errors in near-term quantum devices by extrapolating measurements obtained at amplified noise levels to estimate noise-free expectation val…

cs.SE2026

Software Testing in the Quantum World

Rui Abreu, Shaukat Ali, Paolo Arcaini +11

Quantum computing offers significant speedups for simulating physical, chemical, and biological systems, and for optimization and machine learning. As quantum software grows in com…

math.CO2022

Evaluating the generalized Buchshtab function and revisiting the variance of the distribution of the smallest components of combinatorial objects

Claude Gravel, Daniel Panario

Let and be the random variable representing the size of the smallest component of a random combinatorial object made of elements. A combinatorial object could…

cs.IT2021

A generalization of the Von Neumann extractor

Claude Gravel

An iterative randomness extraction algorithm which generalized the Von Neumann's extraction algorithm is detailed, analyzed and implemented in standard C++. Given a sequence of ind…

quant-ph2020★ 6 cited

Fully-programmable universal quantum simulator with a one-dimensional quantum processor

V. M. Bastidas, T. Haug, C. Gravel +3

Current quantum devices execute specific tasks that are hard for classical computers and have the potential to solve problems such as quantum simulation of material science and che…

cs.CR2020

Finding linearly generated subsequences

Claude Gravel, Daniel Panario, Bastien Rigault

We develop a new algorithm to compute determinants of all possible Hankel matrices made up from a given finite length sequence over a finite field. Our algorithm fits within the dy…

cs.CR2019★ 3 cited

Feedback linearly extended discrete functions

Claude Gravel, Daniel Panario

We study a new flexible method to extend linearly the graph of a non-linear, and usually not bijective, function so that the resulting extension is a bijection. Our motivation come…

quant-ph2019★ 33 cited

Resource reduction for distributed quantum information processing using quantum multiplexed photons

Nicolo Lo Piparo, Michael Hanks, Claude Gravel +2

Distributed quantum information processing is based on the transmission of quantum data over lossy channels between quantum processing nodes. These nodes may be separated by a few…

cs.CR2018★ 6 cited

Unicyclic Strong Permutations

Claude Gravel, Daniel Panario, David Thomson

In this paper, we study some properties of a certain kind of permutation over , where is a positive integer. The desired properties for are: (1) the…

quant-ph2018★ 8 cited

Remote Sampling with Applications to General Entanglement Simulation

Gilles Brassard, Luc Devroye, Claude Gravel

We show how to sample exactly discrete probability distributions whose defining parameters are distributed among remote parties. For this purpose, von Neumann's rejection algorithm…

cs.IT2015★ 6 cited

The expected bit complexity of the von Neumann rejection algorithm

Luc Devroye, Claude Gravel

In 1952, von Neumann introduced the rejection method for random variate generation. We revisit this algorithm when we have a source of perfect bits at our disposal. In this random…

cs.IT2015★ 3 cited

Random variate generation using only finitely many unbiased, independently and identically distributed random bits

Luc Devroye, Claude Gravel

For any discrete probability distributions with bounded entropy, we can generate exactly a random variate using only a finite expected number of perfect coin flips. A perfect coin…

cs.IT2013★ 7 cited

Exact simulation of the GHZ distribution

Gilles Brassard, Luc Devroye, Claude Gravel

John Bell has shown that the correlations entailed by quantum mechanics cannot be reproduced by a classical process involving non-communicating parties. But can they be simulated w…