arXiv subjects

Dario Tamascelli

Publications and source records attributed to Dario Tamascelli.

At least 37 records · Page 2Linked to original sources

arXiv2018

Restoring Heisenberg scaling in noisy quantum metrology by monitoring the environment

We study quantum frequency estimation for $N$ qubits subjected to independent Markovian noise, via strategies based on time-continuous monitoring of the environment. Both physical intuition and an extended convexity property of the quantum Fisher information (QFI) suggest that these strategies are more effective than the standard ones based on the measurement of the unconditional state after the noisy evolution. Here we focus on initial GHZ states and on parallel or transverse noise. For parallel noise, i.e. dephasing, we show that perfectly efficient time-continuous photo-detection allows to recover the unitary (noiseless) QFI, and thus to obtain a Heisenberg scaling for every value of the monitoring time. For finite detection efficiency, one falls back to the noisy standard quantum limit scaling, but with a constant enhancement due to an effective reduced dephasing. Also in the transverse noise case we obtain that the Heisenberg scaling is recovered for perfectly efficient detectors, and we find that both homodyne and photo-detection based strategies are optimal. For finite detectors efficiency, our numerical simulations show that, as expected, an enhancement can be observed, but we cannot give any conclusive statement regarding the scaling. We finally describe in detail the stable and compact numerical algorithm that we have developed in order to evaluate the precision of such time-continuous estimation strategies, and that may find application in other quantum metrology schemes.

quant-ph↗

arXiv2018

Which-way interference within biomimetic unit-cells for efficient energy transfer

We show that `which-way' interference within unit-cells enhances the propagation along linear arrays made upon these basic units. As a working example, we address the exciton transfer through linear aggregates of ring-like unit cells, the latter resembling the circular structure of the Light-Harvesting complexes of purple bacteria. After providing an analytic approximate solution of the eigenvalue problem for such aggregates, we show that the population transferred across the array is not a monotonic function of the coupling between nearest-neighbor rings, contrary to what is found from situations where this intra-unit cell interference is not displayed. The non-monotonicity depends on an interesting trade off between the exciton transfer speed and the amount of energy transferred, which is associated with the rupture of symmetry among paths within the ring-like cells, due to the inter-ring coupling strength.

quant-ph↗

arXiv2018

Non-perturbative treatment of non-Markovian dynamics of open quantum systems

We identify the conditions that guarantee equivalence of the reduced dynamics of an open quantum system (OQS) for two different types of environments - one a continuous bosonic environment leading to a unitary system-environment evolution and the other a discrete-mode bosonic environment resulting in a system-mode (non-unitary) Lindbladian evolution. Assuming initial Gaussian states for the environments, we prove that the two OQS dynamics are equivalent if both the expectation values and two-time correlation functions of the environmental interaction operators are the same at all times for the two configurations. Since the numerical and analytical description of a discrete-mode environment undergoing a Lindbladian evolution is significantly more efficient than that of a continuous bosonic environment in a unitary evolution, our result represents a powerful, non-perturbative tool to describe complex and possibly highly non-Markovian dynamics. As a special application, we recover and generalize the well-known pseudomodes approach to open system dynamics.

quant-ph↗

arXiv2017

Non-Markovianity by undersampling in quantum optical simulators

We unveil a novel source of non-Markovianity for the dynamics of quantum systems, which appears when the system does not explore the full set of dynamical trajectories in the interaction with its environment. We term this effect non-Markovianity by undersampling and demonstrate its appearance in the operation of an all-optical quantum simulator involving a polarization qubit interacting with a dephasing fluctuating environment.

quant-ph↗

arXiv2017

Dephasing assisted transport on a biomimetic ring structure

We address two-level systems arranged in ring configurations affected by static disorder. In particular we investigate the role of dephasing in the transport of an excitation along the ring. We compare the efficiency of the transfer process on isotropic rings and on biomimetic rings modelled according to the structure of light-harvesting complexes. Our analysis provides a simple but clear and interesting example of how an interplay between the coherent dynamics of the system and the incoherent action of the environment can enhance the transfer capabilities of disordered lattices.

quant-ph↗

arXiv2017

Detection of squeezing by on-chip glass-integrated homodyne analyzer

We design and demonstrate on-chip homodyne detection operating in the quantum regime, i.e. able to detect genuine nonclassical features. Our setup exploits a glass-integrated homodyne analyzer (IHA) entirely fabricated by femtosecond laser micromachining. The IHA incorporates on the same chip a balanced waveguide beam splitter and a thermo-optic phase shifter, allowing us to record homodyne traces at different phases and to perform reliable quantum state tomography. In particular, we show that the IHA allows for the detection of nonclassical features of continuous-variable quantum states, such as squeezed states.

quant-ph↗

arXiv2017

Probabilistic low-rank factorization accelerates tensor network simulations of critical quantum many-body ground states

We provide evidence that randomized low-rank factorization is a powerful tool for the determination of the ground state properties of low-dimensional lattice Hamiltonians through tensor network techniques. In particular, we show that randomized matrix factorization outperforms truncated singular value decomposition based on state-of-the-art deterministic routines in TEBD and DMRG-style simulations, even when the system under study gets close to a phase transition: We report linear speedups in the bond- or local dimension, of up to 24 times in quasi-2D cylindrical systems.

quant-ph↗

arXiv2017

Simulating spin-boson models with trapped ions

We propose a method to simulate the dynamics of spin-boson models with small crystals of trapped ions where the electronic degree of freedom of one ion is used to encode the spin while the collective vibrational degrees of freedom are employed to form an effective harmonic environment. The key idea of our approach is that a single damped mode can be used to provide a harmonic environment with Lorentzian spectral density. More complex spectral functions can be tailored by combining several individually damped modes. We propose to work with mixed-species crystals such that one species serves to encode the spin while the other species is used to cool the vibrational degrees of freedom to engineer the environment. The strength of the dissipation on the spin can be controlled by tuning the coupling between spin and vibrational degrees of freedom. In this way the dynamics of spin-boson models with macroscopic and non-Markovian environments can be simulated using only a few ions. We illustrate the approach by simulating an experiment with realistic parameters and show by computing quantitative measures that the dynamics is genuinely non-Markovian.

quant-ph↗

arXiv2017

All-optical quantum simulator of qubit noisy channels

We suggest and demonstrate an all-optical quantum simulator for single-qubit noisy channels originating from the interaction with a fluctuating field. The simulator employs the polarization degree of freedom of a single photon, and exploits its spectral components to average over the realizations of the stochastic dynamics. As a proof of principle, we run simulations of dephasing channels driven either by Gaussian (Ornstein-Uhlenbeck) or non-Gaussian (random telegraph) stochastic processes.

quant-ph↗

arXiv2015

Quantum state transfer via Bloch oscillations

The realization of reliable quantum channels, able to transfer a quantum state with high fidelity, is a fundamental step in the construction of scalable quantum devices. In this paper we describe a transmission scheme based on the genuinely quantum effect known as Bloch oscillations. The proposed protocol makes it possible to carry quantum state over different distances with a minimal engineering of the transmission medium and can be implemented and verified on current quantum technology hardware.

quant-ph↗

arXiv2014

Graphics processing units accelerated semiclassical initial value representation molecular dynamics

This paper presents a Graphics Processing Units (GPUs) implementation of the Semiclassical Initial Value Representation (SC-IVR) propagator for vibrational molecular spectroscopy calculations. The time-averaging formulation of the SC-IVR for power spectrum calculations is employed. Details about the GPU implementation of the semiclassical code are provided. Four molecules with an increasing number of atoms are considered and the GPU-calculated vibrational frequencies perfectly match the benchmark values. The computational time scaling of two GPUs (NVIDIA Tesla C2075 and Kepler K20) respectively versus two CPUs (Intel Core i5 and Intel Xeon E5-2687W) and the critical issues related to the GPU implementation are discussed. The resulting reduction in computational time and power consumption is significant and semiclassical GPU calculations are shown to be environment friendly.

physics.comp-ph↗

arXiv2014

A quantum-walk-inspired adiabatic algorithm for graph isomorphism

We present a 2-local quantum algorithm for graph isomorphism GI based on an adiabatic protocol. By exploiting continuous-time quantum-walks, we are able to avoid a mere diffusion over all possible configurations and to significantly reduce the dimensionality of the visited space. Within this restricted space, the graph isomorphism problem can be translated into the search of a satisfying assignment to a 2-SAT formula without resorting to perturbation gadgets or projective techniques. We present an analysis of the execution time of the algorithm on small instances of the graph isomorphism problem and discuss the issue of an implementation of the proposed adiabatic scheme on current quantum computing hardware.

quant-ph↗

arXiv2012

Noise-assisted quantum transport and computation

The transmission of an excitation along a spin chain can be hindered by the presence of small fixed imperfections that create trapping regions where the excitation may get caught (Anderson localization). A certain degree of noise, ensuing from the interaction with a thermal bath, allows to overcome localization (noise-assisted transport). In this paper we investigate the relation between noise-assisted transport and (quantum) computation. In particular we prove that noise does assist classical computation on a quantum computing device but hinders the possibility of creating entanglement.

quant-ph↗

arXiv2011

Time-dependent density functional theory for open spin chains

The application of methods of time-dependent density functional theory (TDDFT) to systems of qubits provided the interesting possibility of simulating an assigned Hamiltonian evolution by means of an auxiliary Hamiltonian having different two-qubit interactions and hence a possibly simpler wave function evolution. In this note we extend these methods to some instances of Lindblad evolution of a spin chain.

quant-ph↗

arXiv2011

An introduction to quantum annealing

Quantum Annealing, or Quantum Stochastic Optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an example of proficuous cross contamination between classical and quantum computer science. In this survey paper we illustrate how hard combinatorial problems are tackled by quantum computation and present some examples of the heuristics provided by Quantum Annealing. We also present preliminary results about the application of quantum dissipation (as an alternative to Imaginary Time Evolution) to the task of driving a quantum system toward its state of lowest energy.

quant-ph↗

arXiv2011

Dissipative dynamics of a spin system with three-body interaction

In this note we explicitly solve the Lindblad equation for a system of three spins with a three-body interaction, coupled to the environment by bath operators that inject or absorb spin carriers. We exemplify the properties of this solution in the context of a simple instance of Feynman's quantum computer in which a two-qubit program line is executed, applying the $\sqrt{NOT}$ primitive to a one-qubit register.

quant-ph↗

arXiv2009

Interacting quantum walks

In this work we present the quantum mechanical computer proposed by Feynman in 1985 and, since then, widely cited but seldom used. The main feature of the model is the presence of a built in clocking mechanism managing for the ordered application of the computational primitives to the input/output register.

quant-ph↗

arXiv2008

Quantum annealing and the Schrödinger-Langevin-Kostin equation

We show, in the context of quantum combinatorial optimization, or quantum annealing, how the nonlinear Schrödinger-Langevin-Kostin equation can dynamically drive the system toward its ground state. We illustrate, moreover, how a frictional force of Kostin type can prevent the appearance of genuinely quantum problems such as Bloch oscillations and Anderson localization which would hinder an exhaustive search.

quant-ph↗