Related papers: Perfect state distinguishability and computational…
The authors report on modeling of transport spectroscopy in split-gate controlled quantum constrictions. A mixed momentum-coordinate representation is employed to solve a set of time-dependent Lippmann-Schwinger equations with intricate…
We explore a continuous-time quantum walk starting at a single vertex on the discrete path and cycle with a cubic nonlinearity. Such nonlinearities arise in Bose-Einstein condensates described by the Gross-Pitaevskii equation or by…
We consider generic pure $n$-qubit states and a general class of pure states of arbitrary dimensions and arbitrarily many subsystems. We characterize those states which can be reached from some other state via Local Operations assisted by…
The indistinguishability of non-orthogonal pure states lies at the heart of quantum information processing. Although the indistinguishability reflects the impossibility of measuring complementary physical quantities by a single measurement,…
The application and analysis of the Cut-and-Choose technique in protocols secure against quantum adversaries is not a straightforward transposition of the classical case, among other reasons due to the difficulty to use rewinding in the…
The engineering of new states of matter through Floquet driving has revolutionized the field of condensed matter physics. This technique enables the creation of hybrid topological states and ordered phases that are absent in normal systems.…
We investigate chain teleportation of a qutrit-state via the non-maximally two-qutrit entangled channels. For the case of four parties, the efficiencies of two chain teleportation protocols, the separate chain teleportation protocol (SCTP)…
We consider a dissipative quantum Ising model periodically driven by a train of $\pi$-pulses and investigate dissipative discrete time crystals (DTCs) in solids. In this model, the interaction between the spins spontaneously breaks the…
We provide an alternative simple proof of the necessity of entanglement in quantum teleportation by using the no-disentanglement theorem. We show that this is true even when the state to be teleported is known to be among two noncommuting…
It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical…
We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum system, multiple identical copies of which are shared between…
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the…
Coherent electron displacement is a conventional strategy for processing quantum information, as it enables to interconnect distinct sites in a network of atoms. The efficiency of the processing relies on the precise control of the…
The XX model with uniform couplings represents the most natural choice for quantum state transfer through spin chains. Given that it has long been established that single-qubit states cannot be transferred with perfect fidelity in this…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic…
We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum…
Quantum teleportation provides a "disembodied" way to transfer quantum states from one object to another at a distant location, assisted by priorly shared entangled states and a classical communication channel. In addition to its…
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running…
It is known from Bell's theorem that quantum predictions for some entangled states cannot be mimicked using local hidden variable (LHV) models. From a computer science perspective, LHV models may be interpreted as classical computers…