Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Rossi, Zane M."'
Autor:
Bastidas, Victor M., Fitzpatrick, Nathan, Joven, K. J., Rossi, Zane M., Islam, Shariful, Van Voorhis, Troy, Chuang, Isaac L., Liu, Yuan
Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems often results in an exponential overhead due to the exponentially growing size of some symmetry
Externí odkaz:
http://arxiv.org/abs/2411.05058
Quantum signal processing (QSP) is a methodology for constructing polynomial transformations of a linear operator encoded in a unitary. Applied to an encoding of a state $\rho$, QSP enables the evaluation of nonlinear functions of the form $\text{tr}
Externí odkaz:
http://arxiv.org/abs/2409.19043
Despite significant advances in quantum algorithms, quantum programs in practice are often expressed at the circuit level, forgoing helpful structural abstractions common to their classical counterparts. Consequently, as many quantum algorithms have
Externí odkaz:
http://arxiv.org/abs/2309.16665
Autor:
Rossi, Zane M., Chuang, Isaac L.
The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation's realizing dynami
Externí odkaz:
http://arxiv.org/abs/2304.14392
Quantum singular value transformation (QSVT) enables the application of polynomial functions to the singular values of near arbitrary linear operators embedded in unitary transforms, and has been used to unify, simplify, and improve most quantum algo
Externí odkaz:
http://arxiv.org/abs/2304.14383
Autor:
Rossi, Zane M., Chuang, Isaac L.
Publikováno v:
Quantum 6, 811 (2022)
Recent work shows that quantum signal processing (QSP) and its multi-qubit lifted version, quantum singular value transformation (QSVT), unify and improve the presentation of most quantum algorithms. QSP/QSVT characterize the ability, by alternating
Externí odkaz:
http://arxiv.org/abs/2205.06261
Many quantum mechanical experiments can be viewed as multi-round interactive protocols between known quantum circuits and an unknown quantum process. Fully quantum "coherent" access to the unknown process is known to provide an advantage in many disc
Externí odkaz:
http://arxiv.org/abs/2105.08707
Publikováno v:
PRX Quantum 2, 040203 (2021)
Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian simulation, wh
Externí odkaz:
http://arxiv.org/abs/2105.02859
Autor:
Rossi, Zane M., Chuang, Isaac L.
Publikováno v:
Phys. Rev. A 104, 012425 (2021)
The problem of discriminating between many quantum channels with certainty is analyzed under the assumption of prior knowledge of algebraic relations among possible channels. It is shown, by explicit construction of a novel family of quantum algorith
Externí odkaz:
http://arxiv.org/abs/2102.02194
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.