Related papers: A Quantum Algorithm for Testing Junta Variables an…
We present a scheme for speeding up quantum measurement. The scheme builds on previous protocols that entangle the system to be measured with ancillary systems. In the idealised situation of perfect entangling operations and no decoherence,…
This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…
By modeling quantum chaotic dynamics with ensembles of random operators, we explore howmachine learning learning algorithms can be used to detect pseudorandom behavior in qubit systems.We analyze samples consisting of pieces of correlation…
In this paper, we study the problem of estimating the normalizing constant $\int e^{-\lambda f(x)}dx$ through queries to the black-box function $f$, where $f$ belongs to a reproducing kernel Hilbert space (RKHS), and $\lambda$ is a problem…
Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications. Classifying an arbitrary multipartite state as entangled or separable -- a task referred to as the separability problem -- poses a…
Measurement of entanglement remains an important problem for quantum information. We present the design and simulation of an experimental method for entanglement estimation for a general multiqubit state. The system can be in a pure or a…
Sensors for mapping the trajectory of an incoming particle find important utility in experimental high energy physics and searches for dark matter. For a quantum sensing protocol that uses projective measurements on a multi-qubit sensor…
It is believed that there is no efficient classical algorithm to determine the linear structure of Boolean function. We investigate an extension of Simon's period-finding quantum algorithm, and propose an efficient quantum algorithm to…
Quantum computing has gained attention in recent years due to the significant progress in quantum computing technology. Today many companies like IBM, Google and Microsoft have developed quantum computers and simulators for research and…
Bernstein-Vazirani algorithm (the one-query algorithm) can identify a completely specified linear Boolean function using a single query to the oracle with certainty. The first aim of the paper is to show that if the provided Boolean…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
We discuss entanglement of multiparticle quantum systems. We propose a potential measure of a type of entanglement of pure states of n qubits, the n-tangle. For a system of two qubits the n-tangle is equal to the square of the concurrence,…
Uncertainty principle is an inherent nature of quantum system that undermines the precise measurement of incompatible observables and hence the applications of quantum theory. Entanglement, another unique feature of quantum physics, was…
We propose a quantum algorithm (in the form of a quantum oracle) that estimates the closeness of a given Boolean function to one that satisfies the ``strict avalanche criterion'' (SAC). This algorithm requires $n$ queries of the Boolean…
Quantum computations promise the ability to solve problems intractable in the classical setting. Restricting the types of computations considered often allows to establish a provable theoretical advantage by quantum computations, and later…
We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The…
Quantum entanglement, after playing a significant role in the development of the foundations of quantum mechanics, has been recently rediscovered as a new physical resource with potential commercial applications such as, for example,…
We study the probability of making an error if, by querying an oracle a fixed number of times, we declare constant a randomly chosen n-bit Boolean function. We compare the classical and the quantum case, and we determine for how many…
The quantum entanglement measure of concurrence is shown to be directly calculable from a Tomita- Takesaki modular operator framework constructed from the local von Neumann algebras of observables for two quantum systems. Specifically, the…
By quantum calibration we name an experimental procedure apt to completely characterize an unknown measurement apparatus by comparing it with other calibrated apparatuses. Here we show how to achieve the calibration of an arbitrary…