相关论文: An entanglement monotone derived from Grover's alg…

Grover's Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorithms and patterns for extracting information encoded in…

We present a method to construct entanglement measures for pure states of multipartite qubit systems. The key element of our approach is an antilinear operator that we call {\em comb} in reference to the {\em hairy-ball theorem}. For qubits…

How entangled is a randomly chosen bipartite stabilizer state? We show that if the number of qubits each party holds is large the state will be close to maximally entangled with probability exponentially close to one. We provide a similar…

We investigate the properties of three entanglement measures that quantify the statistical distinguishability of a given state with the closest disentangled state that has the same reductions as the primary state. In particular, we…

We introduce a new discrete coherence monotone named the \emph{coherence number}, which is a generalization of the coherence rank to mixed states. After defining the coherence number in a similar manner to the Schmidt number in entanglement…

The Groverian entanglement measure, G(psi), is applied to characterize a variety of pure quantum states |psi> of multiple qubits. The Groverian measure is calculated analytically for certain states of high symmetry, while for arbitrary…

We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…

A strong entanglement monotone, which never increases under local operations and classical communications (LOCC), restricts quantum entanglement manipulation more strongly than the usual monotone since the usual one does not increase on…

Entanglement does not correspond to any observable and its evaluation always corresponds to an estimation procedure where the amount of entanglement is inferred from the measurements of one or more proper observables. Here we address…

This paper presented two general quantum search algorithms. We derived the iterated formulas and the simpler approximate formulas and the precise formula for the amplitude in the desired state. A mathematical proof of Grover's algorithm…

Nonlocality and entanglement are not only the fundamental characteristics of quantum mechanics but also important resources for quantum information and computation applications. Exploiting the quantitative relationship between the two…

We present optimal measuring strategies for the estimation of the entanglement of unknown two-qubit pure states and of the degree of mixing of unknown single-qubit mixed states, of which N identical copies are available. The most general…

Entanglement in incoherent mixtures of pure states of two qubits is considered via the concurrence measure. A set of pure states is optimal if the concurrence for any mixture of them is the weighted sum of the concurrences of the generating…

Estimation of local quantum fields is a crucial aspect of quantum metrology applications, and often also forms the test-bed to analyze the utility of quantum resources, like entanglement. However, so far, this has been analyzed using the…

Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple…

Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm recover these settings and hence learn Grover's algorithm? We…

We investigate the entanglement in the ground state of systems comprising two and three qubits with random interactions. Since the Hamiltonians also contain deterministic one-body terms, by varying the interaction strength, one can…

Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in…

This article introduces an enhancement to the Grover search algorithm to speed up computing the probability of finding good states. It suggests incorporating a rotation phase angle determined mathematically from the derivative of the model…

Gudder, in a recent paper, defined a candidate entanglement measure which is called the entanglement number. The entanglement number is first defined on pure states and then it extends to mixed states by the convex roof construction. In…