相关论文: Long-lived quantum speedup based on plasmonic hot …

The rate of the trace distance is used to evaluate quantum speed-up for arbitrary mixed states. Compared with some present methods, the approach based on trace distance can provide an optimal bound to the speed of the evolution. The…

A remarkable amount of theoretical research has been carried out to elucidate the physical origins of the recently observed long-lived quantum coherence in the electronic energy transfer process in biological photosynthetic systems.…

Implementing large instances of quantum algorithms requires the processing of many quantum information carriers in a hardware platform that supports the integration of different components. While established semiconductor fabrication…

The physical basis for observed long-lived electronic coherence in photosynthetic light-harvesting systems is identified using an analytically soluble model. Three physical features are found to be responsible for their long coherence…

Metallic nanoparticles can localize the incident light to hotspots as plasmon oscillations, where the intensity can be increased up to four orders of magnitude. Even though the lifetime of plasmons are typically short, it can be increased…

Single-shot read-out of individual qubits is typically the slowest process among the elementary single- and two-qubit operations required for quantum information processing. Here, we use resonance fluorescence from a single-electron charged…

Excitonic transport in photosynthesis exhibits a wide range of time scales. Absorption and initial relaxation takes place over tens of femtoseconds. Excitonic lifetimes are on the order of a nanosecond. Hopping rates, energy differences…

Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on…

The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum…

The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…

The Traveling Salesman Problem (TSP) is a classical NP-hard problem that plays a crucial role in combinatorial optimization. In this paper, we are interested in the quantum search framework for the TSP because it has robust theoretical…

Quantum walks in atomic systems, owing to their continuous nature, are especially well-suited for the simulation of many-body physics and can potentially offer an exponential speedup in solving certain black box problems. Photonics offers…

Quantum walks provide simple models of various fundamental processes. It is pivotal to know when the dynamics underlying a walk lead to quantum advantages just by examining its statistics. A walk with many indistinguishable particles and…

Quantum computing promises revolutionary advances in modeling materials and molecules. However, the up-to-date runtime estimates for utility-scale applications on certain quantum hardware systems are in the order of years rendering quantum…

Quantum memories for light are essential building blocks for quantum repeaters and quantum networks. Integrated operations of quantum memories could enable scalable application with low-power consumption. However, the photonic quantum…

A scheme for the optimal Gaussian cloning of coherent light states at the light-atoms interface is proposed. The distinct feature of this proposal is that the clones are stored in an atomic quantum memory, which is important for…

Quantum data locking is a quantum phenomenon that allows us to encrypt a long message with a small secret key with information-theoretic security. This is in sharp contrast with classical information theory where, according to Shannon, the…

The expected hitting time of discrete quantum walks on a hypercube (HC) is numerically known to be exponentially shorter than that of their classical analogs in terms of the scaling with the HC dimension. Recent numerical analyses…

Continuous-time quantum walks have proven to be an extremely useful framework for the design of several quantum algorithms. Often, the running time of quantum algorithms in this framework is characterized by the quantum hitting time: the…

We demonstrate a memory for light based on optomechanically induced transparency. We achieve a long storage time by leveraging the ultra-low dissipation of a soft-clamped mechanical membrane resonator, which oscillates at MHz frequencies.…