Zobrazeno 1 - 10
of 148
pro vyhledávání: '"Low, Richard"'
Autor:
Talwar, Kunal, Wang, Shan, McMillan, Audra, Jina, Vojta, Feldman, Vitaly, Bansal, Pansy, Basile, Bailey, Cahill, Aine, Chan, Yi Sheng, Chatzidakis, Mike, Chen, Junye, Chick, Oliver, Chitnis, Mona, Ganta, Suman, Goren, Yusuf, Granqvist, Filip, Guo, Kristine, Jacobs, Frederic, Javidbakht, Omid, Liu, Albert, Low, Richard, Mascenik, Dan, Myers, Steve, Park, David, Park, Wonhee, Parsa, Gianni, Pauly, Tommy, Priebe, Christian, Rishi, Rehan, Rothblum, Guy, Scaria, Michael, Song, Linmao, Song, Congzheng, Tarbe, Karl, Vogt, Sebastian, Winstrom, Luke, Zhou, Shundong
We revisit the problem of designing scalable protocols for private statistics and private federated learning when each device holds its private data. Locally differentially private algorithms require little trust but are (provably) limited in their u
Externí odkaz:
http://arxiv.org/abs/2307.15017
For a graph $G = (V, E)$ embedded in the Klein bottle, let $\mathcal{F}(G)$ denote the set of faces of $G$. Then, $G$ is called a $C_k$-face-magic Klein bottle graph if there exists a bijection $f: V(G) \to \{1, 2, \dots, |V(G)|\}$ such that for any
Externí odkaz:
http://arxiv.org/abs/2206.02028
Autor:
Low, Richard A.
Publikováno v:
PhD Thesis, University of Bristol, UK, 2010
This thesis discusses the young fields of quantum pseudo-randomness and quantum learning algorithms. We present techniques for derandomising algorithms to decrease randomness resource requirements and improve efficiency. One key object in doing this
Externí odkaz:
http://arxiv.org/abs/1006.5227
Autor:
Low, Richard A.
Publikováno v:
Phys. Rev. A Vol 80, 052314 (2009)
Given oracle access to an unknown unitary C from the Clifford group and its conjugate, we give an exact algorithm for identifying C with O(n) queries, which we prove is optimal. We then extend this to all levels of the Gottesman-Chuang hierarchy (als
Externí odkaz:
http://arxiv.org/abs/0907.2833
Autor:
Low, Richard A.
We present a technique for derandomising large deviation bounds of functions on the unitary group. We replace the Haar distribution with a pseudo-random distribution, a k-design. k-designs have the first k moments equal to those of the Haar distribut
Externí odkaz:
http://arxiv.org/abs/0903.5236
Autor:
Harrow, Aram W., Low, Richard A.
Publikováno v:
Proceedings of RANDOM 2009, LNCS, 5687:548-561, 2009
Quantum expanders are a quantum analogue of expanders, and k-tensor product expanders are a generalisation to graphs that randomise k correlated walkers. Here we give an efficient construction of constant-degree, constant-gap quantum k-tensor product
Externí odkaz:
http://arxiv.org/abs/0811.2597
Autor:
Harrow, Aram W., Low, Richard A.
Publikováno v:
Comm. Math. Phys. Vol. 291, No. 1, pp. 257--302 (2009)
Given a universal gate set on two qubits, it is well known that applying random gates from the set to random pairs of qubits will eventually yield an approximately Haar-distributed unitary. However, this requires exponential time. We show that random
Externí odkaz:
http://arxiv.org/abs/0802.1919
Publikováno v:
In Discrete Applied Mathematics 31 July 2018 244:44-55