Related papers: A geometric Fano--Procrustes framework for purific…
We investigate optimal separable approximations (decompositions) of states rho of bipartite quantum systems A and B of arbitrary dimensions MxN following the lines of Ref. [M. Lewenstein and A. Sanpera, Phys. Rev. Lett. 80, 2261 (1998)].…
Fringe projection profilometry (FPP) is one of the most popular three-dimensional (3D) shape measurement techniques, and has becoming more prevalently adopted in intelligent manufacturing, defect detection and some other important…
We study a generalized multichannel single-impurity Kondo model, in which the impurity spin is described by a representation of the SU(N) group which combines bosonic and fermionic degrees of freedom. The impurity spin states are described…
Locally Purified Density Operators (LPDOs) are state-of-the-art tensor network ansatze candidates that efficiently represent mixed quantum states at scale. However, given their non-uniqueness, their representational complexity is generally…
Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing are prominent approaches for solving combinatorial optimization problems, such as those formulated as Quadratic Unconstrained Binary Optimization (QUBO). These…
We apply the bit thread formulation of holographic entanglement entropy to reduced states describing only the geometry contained within an entanglement wedge. We argue that a certain optimized bit thread configuration, which we construct,…
Uhlmann's theorem is a central result in quantum information theory, which associates the closeness of two quantum states with that of their purifications. The theorem also well characterizes a fundamental task: how close a pure quantum…
Optimizing deformation energies over a mesh, in two or three dimensions, is a common and critical problem in physical simulation and geometry processing. We present three new improvements to the state of the art: a barrier-aware line-search…
We introduce the super-qubit quantum state, determined by superposition of the zero and the one super-particle states, which can be represented by points on the super-Bloch sphere. In contrast to the one qubit case, the one super-particle…
Accurate state preparation is a critical bottleneck in many quantum algorithms, particularly those for ground state energy estimation. Even in fault-tolerant quantum computing, preparing a quantum state with sufficient overlap to the…
Entanglement purification is to distill high-quality entangled states from low-quality entangled states. It is a key step in quantum repeaters, determines the efficiency and communication rates of quantum communication protocols, and is…
This work presents a differentiable geometric parameterization of quantum channels in Kraus representation, which can be efficiently probed to find an unknown quantum channel. We explore its feasibility in finding the quasi inverse…
The ability to perform gates in multiqubit systems that are robust to noise is of crucial importance for the advancement of quantum information technologies. However, finding control pulses that cancel noise while performing a gate is made…
Recently emerged as a disruptive networking paradigm, quantum networks rely on the mysterious quantum entanglement to teleport qubits without physically transferring quantum particles. However, the state of quantum systems is extremely…
In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min…
We propose a purification-enhanced all-photonic quantum repeater scheme based on repeater graph states (RGS) framework that leverages the recently proposed half-RGS building block. This framework addresses a longstanding open question--how…
A longstanding belief in quantum tomography is that estimating a mixed state is far harder than estimating a pure state. This is borne out in the mathematics, where mixed state algorithms have always required more sophisticated techniques…
Global unitary transformations (OPTSWAPS) that optimally increase the bias of any mixed computation qubit in a quantum system -- represented by a diagonal density matrix -- towards a particular state of the computational basis which, in…
We consider a problem in quantum theory that can be formulated as an optimisation problem and present a global optimisation algorithm for solving it, the foundation of which relies in turn on a theorem from quantum theory. To wit, we…
Quantum networks rely on the efficient distribution of entanglement to enable long-distance quantum communication and information processing. A key challenge in these networks is the design of routing protocols capable of maintaining high…