Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Ruckenstein, Andrei E."'
Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem [1]. Rece
Externí odkaz:
http://arxiv.org/abs/2309.05731
Publikováno v:
npj Quantum Information volume 10, Article number: 37 (2024)
We propose a mechanism for reaching pseudorandom quantum states, computationally indistinguishable from Haar random, with shallow log-n depth quantum circuits, where n is the number of qudits. We argue that $\log n$ depth 2-qubit-gate-based generic r
Externí odkaz:
http://arxiv.org/abs/2304.09885
Combinatorial gauge symmetry is a principle that allows us to construct lattice gauge theories with two key and distinguishing properties: a) only one- and two-body interactions are needed; and b) the symmetry is exact rather than emergent in an effe
Externí odkaz:
http://arxiv.org/abs/2212.03880
We introduce a new approach to computation on encrypted data -- Encrypted Operator Computing (EOC) -- as an alternative to Fully Homomorphic Encryption (FHE). Given a plaintext vector $|{x}\rangle$, $x\in \{0,1\}^n$, and a function $F(x)$ represented
Externí odkaz:
http://arxiv.org/abs/2203.08876
Publikováno v:
Phys. Rev. Research 5, 013225 (2023)
The performance of distributing entanglement between two distant nodes in a large-scale quantum network (QN) of partially entangled bipartite pure states is generally benchmarked against the classical entanglement percolation (CEP) scheme. Improvemen
Externí odkaz:
http://arxiv.org/abs/2110.04981
We cast encryption via classical block ciphers in terms of operator spreading in a dual space of Pauli strings, a formulation which allows us to characterize classical ciphers by using tools well known in the analysis of quantum many-body systems. We
Externí odkaz:
http://arxiv.org/abs/2011.06546
Autor:
Zhang, Lei, Reyes, Justin A., Kourtis, Stefanos, Chamon, Claudio, Mucciolo, Eduardo R., Ruckenstein, Andrei E.
Publikováno v:
Phys. Rev. B 101, 235104 (2020)
We study the level-spacing statistics in the entanglement spectrum of output states of random universal quantum circuits where qubits are subject to a finite probability of projection to the computational basis at each time step. We encounter two pha
Externí odkaz:
http://arxiv.org/abs/2001.11428
Autor:
Patil, Pranay, Kourtis, Stefanos, Chamon, Claudio, Mucciolo, Eduardo R., Ruckenstein, Andrei E.
Publikováno v:
Phys. Rev. B 100, 054435 (2019)
We introduce a planar embedding of the k-regular k-XORSAT problem, in which solutions are encoded in the ground state of a classical statistical mechanics model of reversible logic gates arranged on a square grid and acting on bits that represent the
Externí odkaz:
http://arxiv.org/abs/1904.01860
Publikováno v:
Phys. Rev. Research 1, 033001 (2019)
We construct a model of short-range interacting Ising spins on a translationally invariant two-dimensional lattice that mimics a reversible circuit that multiplies or factorizes integers, depending on the choice of boundary conditions. We prove that,
Externí odkaz:
http://arxiv.org/abs/1812.01621
Publikováno v:
SciPost Phys. 7, 060 (2019)
We introduce tensor network contraction algorithms for counting satisfying assignments of constraint satisfaction problems (#CSPs). We represent each arbitrary #CSP formula as a tensor network, whose full contraction yields the number of satisfying a
Externí odkaz:
http://arxiv.org/abs/1805.00475