Related papers: The quantum computational speed of a single Cooper…
Experimental attempts to implement quantum speedup of computations over the past 30 years have yielded a negative result, despite the absence of physical laws prohibiting such speedup. The article formulates the limitation of quantum…
We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation, so…
Planning energy production is a challenging task due to its cost-sensitivity, fast-moving energy markets, uncertainties in demand, and technical constraints of power plants. Thus, more complex models of this so-called \emph{unit commitment…
The cavity is a fundamental ingredient of quantum optical systems. This paper concerns the behavior of a quantum cavity driven by non-classical field in single-photon state. To this end, the number operator has been opted to reveal the…
Quantum speed limits are relations yielding lower bounds on the evolution time of quantum systems. These results have been generalized in some ways, in particular by including evolutions to non-orthogonal states. However, there was a gap in…
Some quantum algorithms have "quantum speedups": improved time complexity as compared with the best-known classical algorithms for solving the same tasks. Can we understand what fuels these speedups from an entropic perspective? Information…
It is supposed that at very small scales a quantum field is an infinite homogeneous quantum computer. On a quantum computer the information cannot propagate faster than $c=a/\tau$, $a$ and $\tau$ being the minimum space and time distances…
We study quantum feedback cooling of atomic motion in an optical cavity as a prototypical nonlinear quantum control problem. We design a feedback algorithm that can cool the atom to the ground state of the optical potential with high…
We characterize a pair of Cooper-pair boxes coupled with a fixed capacitor using spectroscopy and measurements of the ground-state quantum capacitance. We use the extracted parameters to estimate the concurrence, or degree of entanglement…
Insofar as quantum computation is faster than classical, it appears to be irreversible. In all quantum algorithms found so far the speed-up depends on the extra-dynamical irreversible projection representing quantum measurement. Quantum…
The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb-Robinson-type bounds that are crucial for understanding various…
We first consider the basic requirements for a quantum computer, arguing for the attractiveness of nuclear spins as information-bearing entities, and light for the coupling which allows quantum gates. We then survey the strengths of and…
A central question in quantum computation is to identify the resources that are responsible for quantum speed-up. Quantum contextuality has been recently shown to be a resource for quantum computation with magic states for odd-prime…
We study the minimum time related to the quantum speed limit that characterizes the evolution of an open quantum system with the help of a simple model in the short and long time limits. We compare in particular the situation corresponding…
We propose a realization of quantum computing using polarized photons. The information is coded in two polarization directions of the photons and two-qubit operations are done using conditional Faraday effect. We investigate the performance…
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 new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…
A quantum computer is a hypothetical device in which the laws of quantum mechanics are used to introduce a degree of parallelism into computations and which could therefore significantly improve on the computational speed of a classical…
The one clean qubit model of quantum computation (DQC1) efficiently implements a computational task that is not known to have a classical alternative. During the computation, there is never more than a small but finite amount of…
Quantum computing is an attractive and multidisciplinary field, which became a focus for experimental and theoretical research during last decade. Among other systems, like ions in traps or superconducting circuits, solid-states based…