Related papers: Geometric Strategy for the Optimal Quantum Search
Entangled resources enable quantum sensing that achieves Heisenberg scaling, a quadratic improvement on the standard quantum limit, but preparing large scale entangled states is challenging in the presence of decoherence. We present a…
Quantum neural networks are promising for a wide range of applications in the Noisy Intermediate-Scale Quantum era. As such, there is an increasing demand for automatic quantum neural architecture search. We tackle this challenge by…
The idea that spacetime geometry is built from quantum entanglement has been widely accepted in the last years. But how exactly the geometry is related with quantum states is still unclear. In this note, based on the idea of deep learning,…
The geometric formulation of quantum mechanics is a very interesting field of research which has many applications in the emerging field of quantum computation and quantum information, such as schemes for optimal quantum computers. In this…
Qubit-efficient optimization studies how large combinatorial problems can be addressed with quantum circuits whose width is far smaller than the number of logical variables. In quadratic unconstrained binary optimization (QUBO), objective…
Finding the closest separable state to a given target state is a notoriously difficult task, even more difficult than deciding whether a state is entangled or separable. To tackle this task, we parametrize separable states with a neural…
Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
A fundamental model of quantum computation is the programmable quantum gate array. This is a quantum processor that is fed by a program state that induces a corresponding quantum operation on input states. While being programmable, any…
This article proposes an efficient way of calculating the geometric measure of entanglement using tensor decomposition methods. The connection between these two concepts is explored using the tensor representation of the wavefunction.…
We give an explicit expression for the geometric measure of entanglement for three qubit states that are linear combinations of four orthogonal product states. It turns out that the geometric measure for these states has three different…
A model of joint random walk of two agents on an infinite plane is considered. The agents possess no means of mutual classical communication, but have access to quantum entanglement resource which is used according to a pre-arranged…
Quantum states defined over a parameter space form a Grassmann manifold. To capture the geometry of the associated gauge structure, gauge-invariant quantities are essential. We employ the projector of a multilevel system to quantify the…
Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most…
Geometric phases have stimulated researchers for its potential applications in many areas of science. One of them is fault-tolerant quantum computation. A preliminary requisite of quantum computation is the implementation of controlled…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
The use of geometric and symmetry techniques in quantum and classical information processing has a long tradition across the physical sciences as a means of theoretical discovery and applied problem solving. In the modern era, the emergent…
We propose an experimentally feasible scheme to achieve quantum computation based solely on geometric manipulations of a quantum system. The desired geometric operations are obtained by driving the quantum system to undergo appropriate…
Quantum computers can accurately compute ground state energies using phase estimation, but this requires a guiding state that has significant overlap with the true ground state. For large molecules and extended materials, it becomes…
The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for…