Related papers: Negative Quasi-Probability as a Resource for Quant…
The quantum speed limit and the Wigner function of open system models are studied. To this end, we use the phase covariant and a two-qubit model interacting with a squeezed thermal bath via position-dependent coupling. The dependence of the…
What is the origin of quantum computational advantage? Providing answers to this far-reaching question amounts to identifying the key properties, or quantum resources, that distinguish quantum computers from their classical counterparts,…
The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state.…
While there is strong evidence for advantages of quantum over classical computation, the repertoire of computational primitives with proven or conjectured quantum advantage remains limited. A big challenge of quantum algorithmic design is a…
We construct minimum-uncertainty states and a non-negative quasi probability distribution for quantum systems on a finite-dimensional space. We reexamine the theorem of Massar and Spindel for the uncertainty relationof the two unitary…
It is known that the spectrum of quasi-normal modes of potential barriers is related to the spectrum of bound states of the corresponding potential wells. This property has been widely used to compute black hole quasi-normal modes, but it…
Quantum coherence, which quantifies the superposition properties of a quantum state, plays an indispensable role in quantum resource theory. A recent theoretical work [Phys. Rev. Lett. \textbf{116}, 070402 (2016)] studied the manipulation…
In quantum computing, non-stabilizerness -- the magic -- refers to the computational advantage of certain quantum states over classical computers and is an essential ingredient for universal quantum computation. Employing the second order…
In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices…
Binary quantum information can be fault tolerantly encoded in states defined in infinite dimensional Hilbert spaces. Such states define a computational basis, and permit a perfect equivalence between continuous and discrete universal…
Among the most fundamental questions in the manipulation of quantum resources such as entanglement is the possibility of reversibly transforming all resource states. The key consequence of this would be the identification of a unique…
We study the quasiprobability representation of quantum light, as introduced by Glauber and Sudarshan, for the unified characterization of quantum phenomena. We begin with reviewing the past and current impact of this technique.…
Non-Gaussian states, described by Wigner quasi-probability distribution taking negative values, are of great interest for various applications of quantum physics. It is known however that they are highly vulnerable to dissipation. In this…
A crucial goal of quantum information is to find new ways to exploit the properties of quantum devices as resources. One of the prominent properties of quantum devices of particular interest is their negativity in quasi-probability…
We propose an approach to the study of quantum resource manipulation based on the basic observation that quantum channels which preserve certain sets of states are contractive with respect to the base norms induced by those sets. We forgo…
The quasiprobability representation of quantum states addresses two main concerns, the identification of nonclassical features and the decomposition of the density operator. While the former aspect is a main focus of current research, the…
The principal obstacle to quantum information processing with many qubits is decoherence. One source of decoherence is spontaneous emission which causes loss of energy and information. Inability to control system parameters with high…
We propose a novel technique for optimizing a modular fault-tolerant quantum computing architecture, taking into account any desired space-time trade-offs between the number of physical qubits and the fault-tolerant execution time of a…
Quantum simulation is a cornerstone application of quantum computing, yet how fundamental quantum resources--entanglement and non-stabilizerness (``magic")--shape simulation fidelity remains an open question. In this work, we establish a…
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness…