output
19942026
most citedOptimal Dynamical Range of Excitable Networks at Criticality

840 citations

Showing 2021 · quant-phShow all

11 papers · 2 filters

quant-ph2021

Harmonic oscillator kicked by spin measurements: a Floquet-like system without classical analogous

Bento Montenegro, Nadja K. Bernardes, Fernando Parisio

We present a kicked harmonic oscillator where the impulsive driving is provided by stroboscopic measurements on an ancillary degree of freedom and not by the canonical quantization…

quant-ph2021★ 29 cited

Low-rank quantum state preparation

Israel F. Araujo, Carsten Blank, Ismael C. S. Araújo +1

Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exp…

quant-ph2021★ 12 cited

Approximating Invertible Maps by Recovery Channels: Optimality and an Application to Non-Markovian Dynamics

Lea Lautenbacher, Fernando de Melo, Nadja K. Bernardes

We investigate the problem of reversing quantum dynamics, specifically via optimal Petz recovery maps. We focus on typical decoherence channels, such as dephasing, depolarizing and…

quant-ph2021★ 36 cited

Double sparse quantum state preparation

Tiago M. L. de Veras, Leon D. da Silva, Adenilton J. da Silva

Initializing classical data in a quantum device is an essential step in many quantum algorithms. As a consequence of measurement and noisy operations, some algorithms need to reini…

quant-ph2021★ 42 cited

Configurable sublinear circuits for quantum state preparation

Israel F. Araujo, Daniel K. Park, Teresa B. Ludermir +3

The theory of quantum algorithms promises unprecedented benefits of harnessing the laws of quantum mechanics for solving certain computational problems. A persistent obstacle to us…

quant-ph2021★ 5 cited

Lackadaisical quantum walk in the hypercube to search for multiple marked vertices

Luciano S. de Souza, Jonathan H. A. de Carvalho, Tiago A. E. Ferreira

Adding self-loops at each vertex of a graph improves the performance of quantum walks algorithms over loopless algorithms. Many works approach quantum walks to search for a single…