Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Laracuente, Nicholas"'
Autor:
LaRacuente, Nicholas, Leditzky, Felix
Random unitaries are useful in quantum information and related fields but hard to generate with limited resources. An approximate unitary $k$-design is an ensemble of unitaries and measure over which the average is close to a Haar (uniformly) random
Externí odkaz:
http://arxiv.org/abs/2407.07876
Autor:
Laracuente, Nicholas, Smith, Graeme
Quantum states naturally decay under noise. Many earlier works have quantified and demonstrated lower bounds on the decay rate, showing exponential decay in a wide variety of contexts. Here we study the converse question: are there uniform upper boun
Externí odkaz:
http://arxiv.org/abs/2312.17450
We prove an entropic uncertainty relation for two quantum channels, extending the work of Frank and Lieb for quantum measurements. This is obtained via a generalized strong super-additivity (SSA) of quantum entropy. Motivated by Petz's algebraic SSA
Externí odkaz:
http://arxiv.org/abs/2301.08402
We prove that the complete modified logarithmic Sobolev constant of a quantum Markov semigroup is bounded by the inverse of its complete positivity mixing time. For classical Markov semigroups, this implies that every sub-Laplacian given by a H\"orma
Externí odkaz:
http://arxiv.org/abs/2209.11684
Autor:
LaRacuente, Nicholas
States of open quantum systems usually decay continuously under environmental interactions. Quantum Markov semigroups model such processes in dissipative environments. It is known that a finite-dimensional quantum Markov semigroup with detailed balan
Externí odkaz:
http://arxiv.org/abs/2203.03745
Autor:
LaRacuente, Nicholas, Smith, Kaitlin N., Imany, Poolad, Silverman, Kevin L., Chong, Frederic T.
A core challenge for superconducting quantum computers is to scale up the number of qubits in each processor without increasing noise or cross-talk. Distributed quantum computing across small qubit arrays, known as chiplets, can address these challen
Externí odkaz:
http://arxiv.org/abs/2201.08825
Autor:
LaRacuente, Nicholas
A foundational question in quantum computational complexity asks how much more useful a quantum state can be in a given task than a comparable, classical string. Aaronson and Kuperberg showed such a separation in the presence of a quantum oracle, a b
Externí odkaz:
http://arxiv.org/abs/2104.07247
Autor:
Junge, Marius, LaRacuente, Nicholas
Publikováno v:
J. Math. Phys. 63, 122204 (2022)
Trace inequalities are general techniques with many applications in quantum information theory, often replacing classical functional calculus in noncommutative settings. The physics of quantum field theory and holography, however, motivate entropy in
Externí odkaz:
http://arxiv.org/abs/2009.11866
This paper extends the Bakry-\'{E}mery theorem connecting the Ricci curvature and log-Sobolev inequalities to the matrix-valued setting. Using tools from noncommuative geometry, it is shown that for a right invariant second order differential operato
Externí odkaz:
http://arxiv.org/abs/2006.14578
Autor:
LaRacuente, Nicholas
Publikováno v:
J. Math. Phys. 63, 122203 (2022)
Purely multiplicative comparisons of quantum relative entropy are desirable but challenging to prove. We show such comparisons for relative entropies between comparable densities, including the relative entropy of a density with respect to its subalg
Externí odkaz:
http://arxiv.org/abs/1912.00983