Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Bouland, Adam"'
We study a generalization of entanglement testing which we call the "hidden cut problem." Taking as input copies of an $n$-qubit pure state which is product across an unknown bipartition, the goal is to learn precisely where the state is unentangled,
Externí odkaz:
http://arxiv.org/abs/2410.12706
Autor:
Chen, Chi-Fang, Bouland, Adam, Brandão, Fernando G. S. L., Docter, Jordan, Hayden, Patrick, Xu, Michelle
In this work we give an efficient construction of unitary $k$-designs using $\tilde{O}(k\cdot poly(n))$ quantum gates, as well as an efficient construction of a parallel-secure pseudorandom unitary (PRU). Both results are obtained by giving an effici
Externí odkaz:
http://arxiv.org/abs/2404.16751
Unitary $T$-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. Until now, the most efficient construction of unitary $T$-designs for $n$-qudit systems h
Externí odkaz:
http://arxiv.org/abs/2402.09335
Autor:
Giurgica-Tiron, Tudor, Bouland, Adam
We show it is possible to obtain quantum pseudorandomness and pseudoentanglement from random subset states -- i.e. quantum states which are equal superpositions over (pseudo)random subsets of strings. This answers an open question of Aaronson et al.
Externí odkaz:
http://arxiv.org/abs/2312.09206
Autor:
Bouland, Adam, Brod, Daniel, Datta, Ishaun, Fefferman, Bill, Grier, Daniel, Hernandez, Felipe, Oszmaniec, Michal
BosonSampling is the leading candidate for demonstrating quantum computational advantage in photonic systems. While we have recently seen many impressive experimental demonstrations, there is still a formidable distance between the complexity-theoret
Externí odkaz:
http://arxiv.org/abs/2312.00286
Autor:
Bouland, Adam, Fefferman, Bill, Ghosh, Soumik, Metger, Tony, Vazirani, Umesh, Zhang, Chenyi, Zhou, Zixin
Given a local Hamiltonian, how difficult is it to determine the entanglement structure of its ground state? We show that this problem is computationally intractable even if one is only trying to decide if the ground state is volume-law vs near area-l
Externí odkaz:
http://arxiv.org/abs/2311.12017
Stochastic processes play a fundamental role in physics, mathematics, engineering and finance. One potential application of quantum computation is to better approximate properties of stochastic processes. For example, quantum algorithms for Monte Car
Externí odkaz:
http://arxiv.org/abs/2303.06719
We give a quantum algorithm for computing an $\epsilon$-approximate Nash equilibrium of a zero-sum game in a $m \times n$ payoff matrix with bounded entries. Given a standard quantum oracle for accessing the payoff matrix our algorithm runs in time $
Externí odkaz:
http://arxiv.org/abs/2301.03763
Autor:
Aaronson, Scott, Bouland, Adam, Fefferman, Bill, Ghosh, Soumik, Vazirani, Umesh, Zhang, Chenyi, Zhou, Zixin
Entanglement is a quantum resource, in some ways analogous to randomness in classical computation. Inspired by recent work of Gheorghiu and Hoban, we define the notion of "pseudoentanglement'', a property exhibited by ensembles of efficiently constru
Externí odkaz:
http://arxiv.org/abs/2211.00747
Autor:
Bouland, Adam, Giurgica-Tiron, Tudor
The Solovay-Kitaev algorithm is a fundamental result in quantum computation. It gives an algorithm for efficiently compiling arbitrary unitaries using universal gate sets: any unitary can be approximated by short gates sequences, whose length scales
Externí odkaz:
http://arxiv.org/abs/2112.02040