Related papers: Perfect state distinguishability and computational…
We show that the computational power of the non-causal circuit model, i.e., the circuit model where the assumption of a global causal order is replaced by the assumption of logical consistency, is completely characterized by the complexity…
In a series of recent papers we have proved rigorously that time travel is a reality and very much feasible by using quantum mechanical processes. There are plenty of indirect experimental support untill a direct experiment is conducted.…
In this work we study the role of bound electrons in quantum transport. The partition-free approach by Cini is combined with time-dependent density functional theory (TDDFT) to calculate total currents and densities in interacting systems.…
Closed timelike curves (CTCs) appear in many solutions of the Einstein equation, even with reasonable matter sources. These solutions appear to violate causality and so are considered problematic. Since CTCs reflect the global properties of…
Some problems in physics can be handled only after a suitable \textit{ansatz }solution has been guessed. Such method is therefore resilient to generalization, resulting of limited scope. The coherent transport by adiabatic passage of a…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
Teleportation allows Alice to send a pre-prepared quantum state to Bob using only pre-shared entanglement and classical communication. Here we show that it is possible to teleport a state which is also $\it{post}$-selected. Post-selection…
Charge transfer statistics of quantum particles is obtained by analysing the time evolution of the many-body wave function. Exploiting properly chosen gauge transformations, we construct the probabilities for transfers of a discrete number…
Regular measurements allow predicting the future and retrodicting the past of quantum systems. Time-non-local measurements can leave the future and the past uncertain, yet establish a relation between them. We show that continuous…
We study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of $k \leq d$ orthogonal maximally entangled states in…
From Ref. [Phys. Rev. Lett. 80(1998)4999] one knows that the quantum states secretly chosen from a certain set can be probabilistically cloned with positive cloning efficiencies if and only if all the states in the set are linearly…
We consider one copy of a quantum system prepared with equal prior probability in one of two non-orthogonal entangled states of multipartite distributed among separated parties. We demonstrate that these two states can be optimally…
Two types of results are presented for distinguishing pure bipartite quantum states using Local Operations and Classical Communications. We examine sets of states that can be perfectly distinguished, in particular showing that any three…
Quantum measurement is a fundamental yet experimentally challenging ingredient of quantum information processing. Many recent studies on quantum dynamics focus on expectation values of nonlinear observables; however, their experimental…
The computable cross norm (CCN) criterion is a new powerful analytical and computable separability criterion for bipartite quantum states, that is also known to systematically detect bound entanglement. In certain aspects this criterion…
Quantum phase transitions have been shown to be highly beneficial for quantum sensing, owing to diverging quantum Fisher information close to criticality. In this work we consider a periodically modulated Lipkin-Meshkov-Glick model to show…
Quantum walk serves as a versatile tool for universal quantum computing and algorithmic research. However, the implementation of discrete-time quantum walks (DTQWs) with superconducting circuits is still constrained by some limitations such…
The Dihedral Coset Problem (DCP) in $Z_N$ has been extensively studied in quantum computing and post-quantum cryptography, as for instance, the Learning with Errors problem reduces to it. While the Ettinger-Hoyer algorithm is known to solve…
We develop a central limit theorem (CLT) for a non-parametric estimator of the transition matrices in controlled Markov chains (CMCs) with finite state-action spaces. Our results establish precise conditions on the logging policy under…
Recently, it has been argued that quantum mechanics is a complete theory, and that different quantum states do necessarily correspond to different elements of reality, under the assumptions that quantum mechanics is correct and that…