Zobrazeno 1 - 10
of 201
pro vyhledávání: '"de Wolf, Ronald"'
Finding a good approximation of the top eigenvector of a given $d\times d$ matrix $A$ is a basic and important computational problem, with many applications. We give two different quantum algorithms that, given query access to the entries of a Hermit
Externí odkaz:
http://arxiv.org/abs/2405.14765
Autor:
Mande, Nikhil S., de Wolf, Ronald
Phase estimation, due to Kitaev [arXiv'95], is one of the most fundamental subroutines in quantum computing. In the basic scenario, one is given black-box access to a unitary $U$, and an eigenstate $\lvert \psi \rangle$ of $U$ with unknown eigenvalue
Externí odkaz:
http://arxiv.org/abs/2305.04908
Publikováno v:
Quantum 8, 1348 (2024)
Motivated by quantum network applications over classical channels, we initiate the study of $n$-party resource states from which LOCC protocols can create EPR-pairs between any $k$ disjoint pairs of parties. We give constructions of such states where
Externí odkaz:
http://arxiv.org/abs/2211.06497
The Aaronson-Ambainis conjecture (Theory of Computing '14) says that every low-degree bounded polynomial on the Boolean hypercube has an influential variable. This conjecture, if true, would imply that the acceptance probability of every $d$-query qu
Externí odkaz:
http://arxiv.org/abs/2203.00212
We study the problem of computing the Hamming weight of an $n$-bit string modulo $m$, for any positive integer $m \leq n$ whose only prime factors are 2 and 3. We show that the exact quantum query complexity of this problem is $\left\lceil n(1 - 1/m)
Externí odkaz:
http://arxiv.org/abs/2112.14682
Autor:
Chen, Yanlin, de Wolf, Ronald
Lasso and Ridge are important minimization problems in machine learning and statistics. They are versions of linear regression with squared loss where the vector $\theta\in\mathbb{R}^d$ of coefficients is constrained in either $\ell_1$-norm (for Lass
Externí odkaz:
http://arxiv.org/abs/2110.13086
Autor:
Linden, Noah, de Wolf, Ronald
Publikováno v:
Quantum 6, 872 (2022)
The quantum Fourier transform (QFT) is a key primitive for quantum computing that is typically used as a subroutine within a larger computation, for instance for phase estimation. As such, we may have little control over the state that is input to th
Externí odkaz:
http://arxiv.org/abs/2109.10215
We investigate the randomized and quantum communication complexities of the well-studied Equality function with small error probability $\epsilon$, getting optimal constant factors in the leading terms in a number of different models. In the randomiz
Externí odkaz:
http://arxiv.org/abs/2107.11806
Autor:
Dulek, Yfke, Jeffery, Stacey, Majenz, Christian, Schaffner, Christian, Speelman, Florian, de Wolf, Ronald
In theoretical computer science, conferences play an important role in the scientific process. The decisions whether to accept or reject articles is taken by the program committee (PC) members. Serving on a PC for the first time can be a daunting exp
Externí odkaz:
http://arxiv.org/abs/2105.02773
Autor:
Chakraborty, Sourav, Chattopadhyay, Arkadev, Høyer, Peter, Mande, Nikhil S., Paraashar, Manaswi, de Wolf, Ronald
Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of the composed function f o G equals O(Q(f) log n), where Q(f) denotes t
Externí odkaz:
http://arxiv.org/abs/2012.05233