Related papers: Data Processing Inequality for The Quantum Guesswo…
Masking of data is a method to protect information by shielding it from a third party, however keeping it usable for further usages like application development, building program extensions to name a few. Whereas it is possible for…
The concurrent rise of artificial intelligence and quantum information poses opportunity for creating interdisciplinary technologies like quantum neural networks. Quantum reservoir processing, introduced here, is a platform for quantum…
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…
One of the most fundamental results in quantum information theory is that no measurement can perfectly discriminate between non-orthogonal quantum states. In this work, we investigate quantum advantages for discrimination tasks over…
Quantum mechanics can emerge from classical statistics. A typical quantum system describes an isolated subsystem of a classical statistical ensemble with infinitely many classical states. The state of this subsystem can be characterized by…
The indeterminism of quantum mechanics generally permits the independent specification of both an initial and a final condition on the state. Quantum pre-and-post-selection of states opens up a new, experimentally testable, sector of…
Quantum process tomography --- a primitive in many quantum information processing tasks --- can be cast within the framework of the theory of design of experiment (DoE), a branch of classical statistics that deals with the relationship…
The ability to uniquely identify a quantum state is integral to quantum science, but for non-orthogonal states, quantum mechanics precludes deterministic, error-free discrimination. However, using the non-deterministic protocol of…
The outcomes of quantum mechanical experiments are inherently random. It is therefore necessary to develop stringent methods for quantifying the degree of statistical uncertainty about the results of quantum experiments. For the…
We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps…
If the system is known to be in one of two non-orthogonal quantum states, $|\psi_1\rangle$ or $|\psi_2\rangle$, it is not possible to discriminate them by a single measurement due to the unitarity constraint. In a regular Hermitian quantum…
The identification of an unknown quantum gate is a significant issue in quantum technology. In this paper, we propose a quantum gate identification method within the framework of quantum process tomography. In this method, a series of pure…
Quantum computing promises exponential speed-ups for important simulation and optimization problems. It also poses new CAD problems that are similar to, but more challenging, than the related problems in classical (non-quantum) CAD, such as…
The strengthened data processing inequality have been proved. The general theory have been illustrated on the simple example.
Quantum information processing is the use of inherently quantum mechanical phenomena to perform information processing tasks that cannot be achieved using conventional classical information technologies. One famous example is quantum…
Quantum computing and quantum sensing represent two distinct frontiers of quantum information science. In this work, we harness quantum computing to solve a fundamental and practically important sensing problem: the detection of weak…
Precise control of quantum systems with a moderate number of degrees of freedom, being of interest for application in quantum technologies, becomes experimentally feasible. Various types of quantum scenarios and protocols are being widely…
Quantum tomography is the main method used to assess the quality of quantum information processing devices, but its complexity presents a major obstacle for the characterization of even moderately large systems. The number of experimental…
Period finding and phase estimation are fundamental in quantum computing. Prior work has established lower bounds on their success probabilities. Such quantum algorithms measure a state $|\hat\ell\rangle$ in an $n$-qubit computational…
In former work, we showed that a quantum algorithm is the sum over the histories of a classical algorithm that knows in advance 50% of the information about the solution of the problem - each history is a possible way of getting the…