Related papers: Semidefinite Programming for Optimal Quantum Cloni…
Developing optimal strategies to calibrate quantum processors for high-fidelity operation is one of the outstanding challenges in quantum computing today. Here, we demonstrate multiple examples of high-fidelity operations achieved using a…
It is well-known that by adding integrality constraints to the semidefinite programming (SDP) relaxation of the max-cut problem, the resulting integer semidefinite program is an exact formulation of the problem. In this paper we show…
We analyze a class of quantum operations based on a geometrical representation of $d-$level quantum system (or qudit for short). A sufficient and necessary condition of complete positivity, expressed in terms of the quantum Fourier…
We propose a new approach to utilize quantum computers for binary linear programming (BLP), which can be extended to general integer linear programs (ILP). Quantum optimization algorithms, hybrid or quantum-only, are currently general…
In quantum information, most information processing processes involve quantum channels. One manifestation of a quantum channel is quantum operation acting on quantum states. The coherence of quantum operations can be considered as a quantum…
Many combinatorial optimisation problems hide algebraic structures that, once exposed, shrink the search space and improve the chance of finding the global optimal solution. We present a general framework that (i) identifies algebraic…
We show that the approximate quasiorthogonality of two operator algebras is equivalent to the algebras being approximately private relative to their conditional expectation quantum channels. Our analysis is based on a characterization of…
We present the first experimental implementation of a multifunctional device for the optimal cloning of one to two qubits. Previous implementations have always been designed to optimize the cloning procedure with respect to one single type…
We investigate the connection between the optimal collective eavesdropping attack and the optimal cloning attack where the eavesdropper employs an optimal cloner to attack the quantum key distribution (QKD) protocol. The analysis is done in…
A simple and unifying method to show the perfect error-correcting condition is provided based on the quantum mutual information. The one-to-one parameterization of quantum operations and the properties of the quantum relative entropy are…
Charged particle reconstruction or track reconstruction is one of the most crucial components of pattern recognition in high-energy collider physics. It is known to entail enormous consumption of computing resources, especially when the…
Quantum computers promise to transform our notions of computation by offering a completely new paradigm. To achieve scalable quantum computation, optimizing compilers and a corresponding software design flow will be essential. We present a…
It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…
This work shows an approach to reduce the dimensionality of matrix representations of quantum channels. It is achieved by finding a base of the cone of positive semidefinite matrices which represent quantum channels. Next, this is…
Current state-of-the-art quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent cost Hamiltonian suitable for the quantum device. Implementing…
Cloning machines, that is, transformations that achieve the best approximate copying of a quantum state compatible with the no-cloning theorem, have been a fundamental research topic over the last five years. This study is of particular…
No-cloning theorem is fundamental for quantum mechanics and for quantum information science that states an unknown quantum state cannot be cloned perfectly. However, we can try to clone a quantum state approximately with the optimal…
We study optimization programs given by a bilinear form over non-commutative variables subject to linear inequalities. Problems of this form include the entangled value of two-prover games, entanglement-assisted coding for classical…
Quantum tomography is a widely applicable tool for complete characterization of quantum states and processes. In the present work, we develop a method for precision-guaranteed quantum process tomography. With the use of the…
We study quantum computing algorithms for solving certain constrained resource allocation problems we coin as Mission Covering Optimization (MCO). We compare formulations of constrained optimization problems using Quantum Annealing…