Estimating operator norms using covering nets

We present several polynomial- and quasipolynomial-time approximation schemes for a large class of generalized operator norms. Special cases include the $2\rightarrow q$ norm of matrices for $q>2$, the support function of the set of separable quantum states, finding the least noisy output of entanglement-breaking quantum channels, and approximating the injective tensor norm for a map between two Banach spaces whose factorization norm through $\ell_1^n$ is bounded. These reproduce and in some cases improve upon the performance of previous algorithms by Brand\~ao-Christandl-Yard and followup work, which were based on the Sum-of-Squares hierarchy and whose analysis used techniques from quantum information such as the monogamy principle of entanglement. Our algorithms, by contrast, are based on brute force enumeration over carefully chosen covering nets. These have the advantage of using less memory, having much simpler proofs and giving new geometric insights into the problem. Net-based algorithms for similar problems were also presented by Shi-Wu and Barak-Kelner-Steurer, but in each case with a run-time that is exponential in the rank of some matrix. We achieve polynomial or quasipolynomial runtimes by using the much smaller nets that exist in $\ell_1$ spaces. This principle has been used in learning theory, where it is known as Maurey's empirical method.Comment: 24 page

Quantum de Finetti Theorems under Local Measurements with Applications

Quantum de Finetti theorems are a useful tool in the study of correlations in quantum multipartite states. In this paper we prove two new quantum de Finetti theorems, both showing that under tests formed by local measurements one can get a much improved error dependence on the dimension of the subsystems. We also obtain similar results for non-signaling probability distributions. We give the following applications of the results: We prove the optimality of the Chen-Drucker protocol for 3-SAT, under the exponential time hypothesis. We show that the maximum winning probability of free games can be estimated in polynomial time by linear programming. We also show that 3-SAT with m variables can be reduced to obtaining a constant error approximation of the maximum winning probability under entangled strategies of O(m^{1/2})-player one-round non-local games, in which the players communicate O(m^{1/2}) bits all together. We show that the optimization of certain polynomials over the hypersphere can be performed in quasipolynomial time in the number of variables n by considering O(log(n)) rounds of the Sum-of-Squares (Parrilo/Lasserre) hierarchy of semidefinite programs. As an application to entanglement theory, we find a quasipolynomial-time algorithm for deciding multipartite separability. We consider a result due to Aaronson -- showing that given an unknown n qubit state one can perform tomography that works well for most observables by measuring only O(n) independent and identically distributed (i.i.d.) copies of the state -- and relax the assumption of having i.i.d copies of the state to merely the ability to select subsystems at random from a quantum multipartite state. The proofs of the new quantum de Finetti theorems are based on information theory, in particular on the chain rule of mutual information.Comment: 39 pages, no figure. v2: changes to references and other minor improvements. v3: added some explanations, mostly about Theorem 1 and Conjecture 5. STOC version. v4, v5. small improvements and fixe

Efficient Quantum Pseudorandomness

Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum systems, but in many case pseudorandom operations can emulate certain properties of truly random ones. Indeed in the classical realm there is by now a well-developed theory of such pseudorandom operations. However the construction of such objects turns out to be much harder in the quantum case. Here we show that random quantum circuits are a powerful source of quantum pseudorandomness. This gives the for the first time a polynomialtime construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography and to understanding self-equilibration of closed quantum dynamics.Comment: 6 pages, 1 figure. Short version of http://arxiv.org/abs/1208.069

The critical elements of effective academic-practice partnerships: a framework derived from the Department of Veterans Affairs Nursing Academy.

BackgroundThe nursing profession is exploring how academic-practice partnerships should be structured to maximize the potential benefits for each partner. As part of an evaluation of the U.S. Department of Veterans Affairs Nursing Academy (VANA) program, we sought to identify indicators of successful partnerships during the crucial first year.MethodsWe conducted a qualitative analysis of 142 individual interviews and 23 focus groups with stakeholders from 15 partnerships across the nation. Interview respondents typically included the nursing school Dean, the VA chief nurse, both VANA Program Directors (VA-based and nursing school-based), and select VANA faculty members. The focus groups included a total of 222 VANA students and the nursing unit managers and staff from units where VANA students were placed. An ethnographic approach was utilized to identify emergent themes from these data that underscored indicators of and influences on Launch Year achievement.ResultsWe emphasize five key themes: the criticality of inter-organizational collaboration; challenges arising from blending different cultures; challenges associated with recruiting nurses to take on faculty roles; the importance of structuring the partnership to promote evidence-based practice and simulation-based learning in the clinical setting; and recognizing that stable relationships must be based on long-term commitments rather than short-term changes in the demand for nursing care.ConclusionsDeveloping an academic-clinical partnership requires identifying how organizations with different leadership and management structures, different responsibilities, goals and priorities, different cultures, and different financial models and accountability systems can bridge these differences to develop joint programs integrating activities across the organizations. The experience of the VANA sites in implementing academic-clinical partnerships provides a broad set of experiences from which to learn about how such partnerships can be effectively implemented, the barriers and challenges that will be encountered, and strategies and factors to overcome challenges and build an effective, sustainable partnership. This framework provides actionable guidelines for structuring and implementing effective academic-practice partnerships that support undergraduate nursing education

Radiation from a charge circulating inside a waveguide with dielectric filling

The emitted power of the radiation from a charged particle moving uniformly on a circle inside a cylindrical waveguide is considered. The expressions for the energy flux of the radiation passing through the waveguide cross-section are derived for both TE and TM waves. The results of the numerical evaluation are presented for the number of emitted quanta depending on the waveguide radius, the radius of the charge rotation orbit and dielectric permittivity of the filling medium. These results are compared with the corresponding quantities for the synchrotron radiation in a homogeneous medium.Comment: 10 pages, Latex, four EPS figure