English
Related papers

Related papers: Remote state preparation in higher dimension and t…

200 papers

The problem of deciding whether a set of quantum measurements is jointly measurable is known to be equivalent to determining whether a quantum assemblage is unsteerable. This problem can be formulated as a semidefinite program (SDP).…

We prove that it is possible to remotely prepare an ensemble of non-commuting mixed states using communication equal to the Holevo information for this ensemble. This remote preparation scheme may be used to convert between different…

Quantum Physics · Physics 2007-05-23 Dominic W. Berry , Barry C. Sanders

Sublinear time complexity is required by the massively parallel computation (MPC) model. Breaking dynamic programs into a set of sparse dynamic programs that can be divided, solved, and merged in sublinear time. The rectangle escape problem…

Computational Geometry · Computer Science 2023-09-04 Sepideh Aghamolaei , Mohammad Ghodsi

We propose in this paper an alternative method for the quantisation of systems with first-class constraints. This method is a combination of the coherent-state-path-integral quantisation developed by Klauder, with the ideas of reduced state…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Charis Anastopoulos

This paper is on the normal approximation of singular subspaces when the noise matrix has i.i.d. entries. Our contributions are three-fold. First, we derive an explicit representation formula of the empirical spectral projectors. The…

Statistics Theory · Mathematics 2019-07-29 Dong Xia

We develop a method to identify the BPS states in the Hilbert space of a supersymmetric field theory on a generic curved space which preserves at least two real supercharges. We also propose a one-to-one map between BPS states in…

High Energy Physics - Theory · Physics 2015-06-12 Prarit Agarwal , Antonio Amariti , Alberto Mariotti , Massimo Siani

In this paper we show an explicit construction of multipartite class of entangled states with the PPT (Positive Partial Transposition) property in every cut. We investigate properties of this class of states focusing on the trace distance…

Quantum Physics · Physics 2019-06-25 Adam Rutkowski , Michał Studziński

Improving generalization is one of the main challenges for training deep neural networks on classification tasks. In particular, a number of techniques have been proposed, aiming to boost the performance on unseen data: from standard data…

Machine Learning · Computer Science 2022-12-29 Enzo Tartaglione , Daniele Perlo , Marco Grangetto

State machine replication is standard approach to fault tolerance. One of the key assumptions of state machine replication is that replicas must execute operations deterministically and thus serially. To benefit from multi-core servers,…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-05-15 Eduardo Alchieri , Fernando Dotti , Fernando Pedone

Reachability analysis is a critical tool for the formal verification of dynamical systems and the synthesis of controllers for them. Due to their computational complexity, many reachability analysis methods are restricted to systems with…

Systems and Control · Electrical Eng. & Systems 2020-07-14 Alex Devonport , Mahmoud Khaled , Murat Arcak , Majid Zamani

Phase retrieval in real or complex Hilbert spaces is the task of recovering a vector, up to an overall unimodular multiplicative constant, from magnitudes of linear measurements. In this paper, we assume that the vector is normalized, but…

Probability · Mathematics 2019-11-19 Dylan Domel-White , Bernhard G. Bodmann

We show that wave maps from Minkowski space $R^{1+n}$ to a sphere are globally smooth if the initial data is smooth and has small norm in the critical Sobolev space $\dot H^{n/2}$ in the high dimensional case $n \geq 5$. A major difficulty,…

Analysis of PDEs · Mathematics 2007-05-23 Terence Tao

Determining whether a subspace spanned by certain quantum states is entangled and its entanglement dimensionality remains a fundamental challenge in quantum information science. This paper introduces a geometric measure of $r$-bounded rank,…

Quantum Physics · Physics 2025-06-12 Xuanran Zhu , Chao Zhang , Bei Zeng

We give a dimensionality reduction procedure to approximate the sum of distances of a given set of $n$ points in $R^d$ to any "shape" that lies in a $k$-dimensional subspace. Here, by "shape" we mean any set of points in $R^d$. Our…

Data Structures and Algorithms · Computer Science 2021-06-25 Zhili Feng , Praneeth Kacham , David P. Woodruff

We present a strategy for implementing multiparty-controlled remote state preparation (MCRSP) for a family of four-qubit cluster-type states with genuine entanglements while employing, Greenberg-Horne-Zeilinger-class states as quantum…

Quantum Physics · Physics 2014-11-20 Dong Wang , Liu Ye , Sabre Kais

Validity of the single parameter scaling (SPS) in one dimensional Anderson model with purely off-diagonal disorder is being studied. It is shown that the localized region with standard symmetry is divided into two regimes: SPS and non-SPS.…

Disordered Systems and Neural Networks · Physics 2009-11-11 Hosein Cheraghchi

The Reifenberg theorem \cite{reif_orig} tells us that if a set $S\subseteq B_2\subseteq \mathbb R^n$ is uniformly close on all points and scales to a $k$-dimensional subspace, then $S$ is H\"older homeomorphic to a $k$-dimensional Euclidean…

Analysis of PDEs · Mathematics 2024-05-07 Nicholas Edelen , Aaron Naber , Daniele Valtorta

Given integers n $\geq$ m, let Sep(n,m) be the set of separable states on the Hilbert space $\mathbb{C}^n \otimes \mathbb{C}^m$. It is well-known that for (n,m)=(3,2) the set of separable states has a simple description using semidefinite…

Quantum Physics · Physics 2019-05-08 Hamza Fawzi

In large quantum systems multipartite entanglement can be found in many inequivalent classes under local operations and classical communication. Preparing states of arbitrary size in different classes is important for performing a wide…

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

Computational Geometry · Computer Science 2014-04-25 Quentin Mérigot