853 citations
- Sorbonne UniversitéFR398 papers
- Centre National de la Recherche ScientifiqueFR380 papers
- Université Paris CitéFR136 papers
- Université Pierre-et-Marie-CurieFR97 papers
- University of EdinburghGB89 papers
- Institut national de recherche en sciences et technologies du numériqueFR85 papers
- Université Paris-SaclayFR67 papers
- University of OxfordGB54 papers
- École PolytechniqueFR50 papers
- Sorbonne Paris CitéFR48 papers
- Massachusetts Institute of TechnologyUS45 papers
- Universidade Federal do Rio de JaneiroBR45 papers
33 papers · 1 filter
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…
A fast and efficient SIMD track reconstruction algorithm for the LHCb Upgrade 1 VELO-PIX detector
Arthur Hennequin, Benjamin Couturier, Vladimir Gligorov +3
The upgraded CERN LHCb detector, due to start data taking in 2021, will have to reconstruct 4 TB/s of raw detector data in real time using commodity processors. This is one of the…
Benchmarking Discrete Optimization Heuristics with IOHprofiler
Carola Doerr, Furong Ye, Naama Horesh +3
Automated benchmarking environments aim to support researchers in understanding how different algorithms perform on different types of optimization problems. Such comparisons provi…
Do you trade with your friends or become friends with your trading partners? A case study in the G1 cryptocurrency
Nicolas Gensollen, Matthieu Latapy
We study the interplay between social ties and financial transactions made through a recent cryptocurrency called . It has the particularity of combining the usual tran…
Non-interactive classical verification of quantum computation
Gorjan Alagic, Andrew M. Childs, Alex B. Grilo +1
In a recent breakthrough, Mahadev constructed an interactive protocol that enables a purely classical party to delegate any quantum computation to an untrusted quantum prover. In t…
QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
Anne Broadbent, Alex B. Grilo
We provide several advances to the understanding of the class of Quantum Merlin-Arthur proof systems (QMA), the quantum analogue of NP. Our central contribution is proving a longst…