6 papers
Manipulating heterogeneous quantum resources over a network
Ray Ganardi, Jeongrak Son, Jakub Czartowski +2
Quantum information processing relies on a variety of resources, including entanglement, coherence, non-Gaussianity, and magic. In realistic settings, protocols run on networks of…
Grover's algorithm is an approximation of imaginary-time evolution
Yudai Suzuki, Marek Gluza, Jeongrak Son +3
We reveal the power of Grover's algorithm from thermodynamic and geometric perspectives by showing that it is a product formula approximation of imaginary-time evolution (ITE), a R…
Double-bracket algorithm for quantum signal processing without post-selection
Yudai Suzuki, Bi Hong Tiang, Jeongrak Son +3
Quantum signal processing (QSP), a framework for implementing matrix-valued polynomials, is a fundamental primitive in various quantum algorithms. Despite its versatility, a potent…
Generalized Numerical Framework for Improved Finite-Sized Key Rates with Rényi Entropy
Rebecca R. B. Chung, Nelly H. Y. Ng, Yu Cai
Quantum key distribution requires tight and reliable bounds on the secret key rate to ensure robust security. This is particularly so for the regime of finite block sizes, where th…
Catalytic channels are the only noise-robust catalytic processes
Jeongrak Son, Ray Ganardi, Shintaro Minagawa +3
Catalysis refers to the possibility of enabling otherwise inaccessible quantum state transitions by supplying an auxiliary system, provided that the auxiliary is returned to its in…
Double-bracket quantum algorithms for quantum imaginary-time evolution
Marek Gluza, Jeongrak Son, Bi Hong Tiang +5
Efficiently preparing approximate ground-states of large, strongly correlated systems on quantum hardware is challenging and yet nature is innately adept at this. This has motivate…