Related papers: Optimal Entanglement Formulas for Entanglement-Ass…
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 analytically obtain the maximum probability of converting a finite number of copies of an arbitrary two-qubit pure state to a single copy of a maximally entangled two-qubit pure state via entanglement assisted local operations and…
We present an encoding and hardware-independent formulation of optimization problems for quantum computing. Using this generalized approach, we present an extensive library of optimization problems and their various derived spin encodings.…
Numerical optimization methods such as hillclimbing and simulated annealing have been applied to search for highly entangled multi-qubit states. Here the genetic algorithm is applied to this optimization problem -- to search not only for…
In this study, we first use a three-qubit system as an example to demonstrate the construction of quantum circuits for the eight maximally entangled basis vectors, subsequently extending the approach to N-qubit systems. We employ a…
A $2\otimes 2$ unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many runs of a given two-qubit entangling unitary operation is…
We address a fundamental issue in quantum mechanics and quantum information theory, the generation of an entangled pair of qubits that interact solely through a third, semiclassical degree of freedom, in the framework of cavity quantum…
General formulas of entanglement concentration are derived by using an information-spectrum approach for the i.i.d. sequences and the general sequences of partially entangled pure states. That is, we derive general relations between the…
Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot…
Alice wants to convey the value of a parameter to Bob with whom she does not share a reference frame. What physical object can she use for this task? Shall she encode this value into the angle between two physical vectors such as the angle…
Efficient entanglement distribution is the foundational challenge in realizing large-scale Quantum Networks. However, state-of-the-art solutions are frequently limited by restrictive operational assumptions, prohibitive computational…
Quantum entanglement plays a crucial role in quantum computing. Entangling information has important implications for understanding the behavior of quantum programs and avoiding entanglement-induced errors. Entanglement analysis is a static…
We determine the optimal rates of universal quantum codes for entanglement transmission and generation under channel uncertainty. In the simplest scenario the sender and receiver are provided merely with the information that the channel…
Distributed quantum computing (DQC) provides a promising route toward scalable quantum computation, where entanglement-assisted LOCC and circuit knitting represent two complementary approaches. The former deterministically realizes nonlocal…
Machine learning, a branch of artificial intelligence, learns from previous experience to optimize performance, which is ubiquitous in various fields such as computer sciences, financial analysis, robotics, and bioinformatics. A challenge…
Entanglement-assisted concatenated quantum codes (EACQCs) are constructed by concatenating two entanglement-assisted quantum error-correcting codes (EAQECCs). By selecting the inner and outer component codes carefully, it is able to…
Connecting multiple smaller qubit modules by generating high-fidelity entangled states is a promising path for scaling quantum computing hardware. The performance of such a modular quantum computer is highly dependent on the quality and…
It is shown that any quantum operation that perfectly clones the entanglement of all maximally-entangled qubit pairs cannot preserve separability. This ``entanglement no-cloning'' principle naturally suggests that some approximate cloning…
We find an upper bound on the rate at which entanglement can be unlocked by classical bits. In particular, we show that for quantum information sources that are specified by ensambles of pure bipartite states, one classical bit can unlock…
Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding…