Related papers: Mermin Polynomials for Entanglement Evaluation in …
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…
We study the pairing correlations in a finite Fermi system from quantum entanglement point of view. We investigate the relation between the order parameter, which has been introduced recently to describe both finite and infinite…
If only limited control over a multiparticle quantum system is available, a viable method to characterize correlations is to perform random measurements and consider the moments of the resulting probability distribution. We present…
We give a dimension independent formulation of the quantum search algorithm introduced in [L. K. Grover, Phys. Rev. Lett. {\bf 79}, 325 (1997)]. This algorithm provides a quadratic gain when compared to its classical counterpart by…
We detail techniques to optimise high-level classical simulations of Shor's quantum factoring algorithm. Chief among these is to examine the entangling properties of the circuit and to effectively map it across the one-dimensional structure…
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for…
Among many types of quantum entanglement properties, the entanglement spectrum provides more abundant information than other observables. Exact diagonalization and density matrix renormalization group method could handle the system in…
In the framework of the theory of open systems based on completely positive quantum dynamical semigroups, we give a description of the dynamics of entanglement for a system consisting of two uncoupled harmonic oscillators interacting with a…
Quantum machine learning is a rapidly evolving field of research that could facilitate important applications for quantum computing and also significantly impact data-driven sciences. In our work, based on various arguments from complexity…
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…
The quantum circuit model essentially treats every quantum algorithm as a straight-line program. While this view is universal, recent work has shown that it is inconvenient for using different-length quantum subroutines in superposition.…
Quantifying entanglement in quantum systems is an important yet challenging task due to its NP-hard nature. In this work, we propose an efficient algorithm for evaluating distance-based entanglement measures. Our approach builds on…
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…
Recently, there has been interest in the dynamics of monitored quantum systems using linear jump operators related to the creation or annihilation of particles. Here, we study the dynamics of the entanglement entropy under quantum jumps…
We provide an analytical tripartite-study from the generalized $R$-matrix. It provides the upper bound of the maximum violation of Mermin's inequality. For a generic 2-qubit pure state, the concurrence or $R$-matrix characterizes the…
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The…
Grover's algorithm is a fundamental quantum algorithm that achieves a quadratic speedup for unstructured search problems of size $N$. Recent studies have reformulated this task as a maximization problem on the unitary manifold and solved it…
Many-body entanglement is studied within the algebraic approach to quantum physics in systems made of Majorana fermions. In this framework, the notion of separability stems from partitions of the algebra of observables and properties of the…
We propose a methodology for implementing Grover's algorithm in the digital quantum simulation of disordered Ising models. The core concept revolves around using the evolution operator for the Ising model as the quantum oracle within…
An extension to computational mechanics complexity measure is proposed in order to tackle quantum states complexity quantification. The method is applicable to any $n-$partite state of qudits through some simple modifications. A Werner…