02409nas a2200157 4500008004100000245009100041210006900132520188600201100003302087700001602120700001702136700002402153700002202177700001502199856003702214 2018 eng d00aQuantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning0 aQuantum SDP Solvers Large Speedups Optimality and Applications t3 a
We give two new quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with m constraint matrices, each of dimension n, rank r, and sparsity s. The first algorithm assumes an input model where one is given access to entries of the matrices at unit cost. We show that it has run time O~(s2(m−−√ε−10+n−−√ε−12)), where ε is the error. This gives an optimal dependence in terms of m,n and quadratic improvement over previous quantum algorithms when m≈n. The second algorithm assumes a fully quantum input model in which the matrices are given as quantum states. We show that its run time is O~(m−−√+poly(r))⋅poly(logm,logn,B,ε−1), with B an upper bound on the trace-norm of all input matrices. In particular the complexity depends only poly-logarithmically in n and polynomially in r. We apply the second SDP solver to the problem of learning a good description of a quantum state with respect to a set of measurements: Given m measurements and copies of an unknown state ρ, we show we can find in time m−−√⋅poly(logm,logn,r,ε−1) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as ρ on the m measurements, up to error ε. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes' principle from statistical mechanics. As in previous work, we obtain our algorithm by "quantizing" classical SDP solvers based on the matrix multiplicative weight method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians with a poly-logarithmic dependence on its dimension, which could be of independent interest.
1 aBrandão, Fernando, G. S. L.1 aKalev, Amir1 aLi, Tongyang1 aLin, Cedric, Yen-Yu1 aSvore, Krysta, M.1 aWu, Xiaodi uhttps://arxiv.org/abs/1710.0258102582nas a2200169 4500008004100000245010100041210006900142260001500211520202200226100003302248700001602281700001702297700002402314700002202338700001502360856003702375 2017 eng d00aExponential Quantum Speed-ups for Semidefinite Programming with Applications to Quantum Learning0 aExponential Quantum Speedups for Semidefinite Programming with A c2017/10/063 aWe give semidefinite program (SDP) quantum solvers with an exponential speed-up over classical ones. Specifically, we consider SDP instances with m constraint matrices of dimension n, each of rank at most r, and assume that the input matrices of the SDP are given as quantum states (after a suitable normalization). Then we show there is a quantum algorithm that solves the SDP feasibility problem with accuracy ǫ by using √ m log m · poly(log n,r, ǫ −1 ) quantum gates. The dependence on n provides an exponential improvement over the work of Brand ˜ao and Svore [6] and the work of van Apeldoorn et al. [23], and demonstrates an exponential quantum speed-up when m and r are small. We apply the SDP solver to the problem of learning a good description of a quantum state with respect to a set of measurements: Given m measurements and a supply of copies of an unknown state ρ, we show we can find in time √ m log m · poly(log n,r, ǫ −1 ) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as ρ on the m measurements up to error ǫ. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes’ principle. As in previous work, we obtain our algorithm by “quantizing” classical SDP solvers based on the matrix multiplicative weight update method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians with a poly-logarithmic dependence on its dimension based on the techniques developed in quantum principal component analysis, which could be of independent interest. Our quantum SDP solver is different from previous ones in the following two aspects: (1) it follows from a zero-sum game approach of Hazan [11] of solving SDPs rather than the primal-dual approach by Arora and Kale [5]; and (2) it does not rely on any sparsity assumption of the input matrices.
1 aBrandão, Fernando, G. S. L.1 aKalev, Amir1 aLi, Tongyang1 aLin, Cedric, Yen-Yu1 aSvore, Krysta, M.1 aWu, Xiaodi uhttps://arxiv.org/abs/1710.0258101826nas a2200169 4500008004100000245005800041210005800099260001500157490000700172520131900179100001901498700002401517700002001541700001701561700002401578856005401602 2017 eng d00aHamiltonian Simulation with Optimal Sample Complexity0 aHamiltonian Simulation with Optimal Sample Complexity c2017/03/310 v133 aWe investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd, Mohseni, and Rebentrost [Nat. Phys., 10(9):631--633, 2014] is optimal for this task. We further extend their method to the case of multiple input states, showing how to simulate any Hermitian polynomial of the states provided. As applications, we derive optimal algorithms for commutator simulation and orthogonality testing, and we give a protocol for creating a coherent superposition of pure states, when given sample access to those states. We also show that this sample-based Hamiltonian simulation can be used as the basis of a universal model of quantum computation that requires only partial swap operations and simple single-qubit states.
We describe two procedures which, given access to one copy of a quantum state and a sequence of two-outcome measurements, can distinguish between the case that at least one of the measurements accepts the state with high probability, and the case that all of the measurements have low probability of acceptance. The measurements cannot simply be tried in sequence, because early measurements may disturb the state being tested. One procedure is based on a variant of Marriott-Watrous amplification. The other procedure is based on the use of a test for this disturbance, which is applied with low probability. We find a number of applications. First, quantum query complexity separations in the property testing model for testing isomorphism of functions under group actions. We give quantum algorithms for testing isomorphism, linear isomorphism and affine isomorphism of boolean functions which use exponentially fewer queries than is possible classically, and a quantum algorithm for testing graph isomorphism which uses polynomially fewer queries than the best algorithm known. Second, testing properties of quantum states and operations. We show that any finite property of quantum states can be tested using a number of copies of the state which is logarithmic in the size of the property, and give a test for genuine multipartite entanglement of states of n qubits that uses O(n) copies of the state. Third, correcting an error in a result of Aaronson on de-Merlinizing quantum protocols. This result claimed that, in any one-way quantum communication protocol where two parties are assisted by an all-powerful but untrusted third party, the third party can be removed with only a modest increase in the communication cost. We give a corrected proof of a key technical lemma required for Aaronson's result.
1 aHarrow, Aram, W.1 aLin, Cedric, Yen-Yu1 aMontanaro, Ashley uhttp://epubs.siam.org/doi/10.1137/1.9781611974782.10501705nas a2200121 4500008004100000245005700041210005500098260001500153520133500168100002001503700002401523856003601547 2016 eng d00aA Complete Characterization of Unitary Quantum Space0 aComplete Characterization of Unitary Quantum Space c2016/04/053 aWe give two complete characterizations of unitary quantum space-bounded classes. The first is based on the Matrix Inversion problem for well-conditioned matrices. We show that given the size-n efficient encoding of a 2O(k(n))×2O(k(n)) well-conditioned matrix H, approximating a particular entry of H−1 is complete for the class of problems solvable by a quantum algorithm that uses O(k(n)) space and performs all quantum measurements at the end of the computation. In particular, the problem of computing entries of H−1 for an explicit well-conditioned n×n matrix H is complete for unitary quantum logspace. We then show that the problem of approximating to high precision the least eigenvalue of a positive semidefinite matrix H, encoded as a circuit, gives a second characterization of unitary quantum space complexity. In the process we also establish an equivalence between unitary quantum space-bounded classes and certain QMA proof systems. As consequences, we establish that QMA with exponentially small completeness-soundness gap is equal to PSPACE, that determining whether a local Hamiltonian is frustration-free is PSPACE-complete, and give a provable setting in which the ability to prepare PEPS states gives less computational power than the ability to prepare the ground state of a generic local Hamiltonian.1 aFefferman, Bill1 aLin, Cedric, Yen-Yu uhttp://arxiv.org/abs/1604.0138401440nas a2200121 4500008004100000245010100041210006900142260001500211520101600226100002401242700001601266856003601282 2016 eng d00aPerformance of QAOA on Typical Instances of Constraint Satisfaction Problems with Bounded Degree0 aPerformance of QAOA on Typical Instances of Constraint Satisfact c2016/01/083 aWe consider constraint satisfaction problems of bounded degree, with a good notion of "typicality", e.g. the negation of the variables in each constraint is taken independently at random. Using the quantum approximate optimization algorithm (QAOA), we show that μ+Ω(1/D−−√) fraction of the constraints can be satisfied for typical instances, with the assignment efficiently produced by QAOA. We do so by showing that the averaged fraction of constraints being satisfied is μ+Ω(1/D−−√), with small variance. Here μ is the fraction that would be satisfied by a uniformly random assignment, and D is the number of constraints that each variable can appear. CSPs with typicality include Max-kXOR and Max-kSAT. We point out how it can be applied to determine the typical ground-state energy of some local Hamiltonians. We also give a similar result for instances with "no overlapping constraints", using the quantum algorithm. We sketch how the classical algorithm might achieve some partial result.1 aLin, Cedric, Yen-Yu1 aZhu, Yechao uhttp://arxiv.org/abs/1601.0174400861nas a2200121 4500008004100000245005500041210005500096260001500151520049300166100002000659700002400679856003600703 2016 eng d00aQuantum Merlin Arthur with Exponentially Small Gap0 aQuantum Merlin Arthur with Exponentially Small Gap c2016/01/083 aWe study the complexity of QMA proof systems with inverse exponentially small promise gap. We show that this class can be exactly characterized by PSPACE, the class of problems solvable with a polynomial amount of memory. As applications we show that a "precise" version of the Local Hamiltonian problem is PSPACE-complete, and give a provable setting in which the ability to prepare PEPS states is not as powerful as the ability to prepare the ground state of general Local Hamiltonians.1 aFefferman, Bill1 aLin, Cedric, Yen-Yu uhttp://arxiv.org/abs/1601.0197521161nas a2200205 45000080041000000200022000410220014000632450069000772100068001462600015002143000016002294900007002455202053400252100002020786700002420806700002420830700002220854700002520876856005420901 2016 eng d a978-3-95977-013-2 a1868-896900aSpace-Efficient Error Reduction for Unitary Quantum Computations0 aSpaceEfficient Error Reduction for Unitary Quantum Computations c2016/04/27 a14:1--14:140 v553 aThis paper develops general space-efficient methods for error reduction for unitary quantum computation. Consider a polynomial-time quantum computation with completeness
Inspired by the Elitzur-Vaidman bomb testing problem [arXiv:hep-th/9305002], we introduce a new query complexity model, which we call bomb query complexity $B(f)$. We investigate its relationship with the usual quantum query complexity $Q(f)$, and show that $B(f)=\Theta(Q(f)^2)$. This result gives a new method to upper bound the quantum query complexity: we give a method of finding bomb query algorithms from classical algorithms, which then provide nonconstructive upper bounds on $Q(f)=\Theta(\sqrt{B(f)})$. We subsequently were able to give explicit quantum algorithms matching our upper bound method. We apply this method on the single-source shortest paths problem on unweighted graphs, obtaining an algorithm with $O(n^{1.5})$ quantum query complexity, improving the best known algorithm of $O(n^{1.5}\sqrt{\log n})$ [arXiv:quant-ph/0606127]. Applying this method to the maximum bipartite matching problem gives an $O(n^{1.75})$ algorithm, improving the best known trivial $O(n^2)$ upper bound.
1 aLin, Cedric, Yen-Yu1 aLin, Han-Hsuan uhttp://theoryofcomputing.org/articles/v012a018/01035nas a2200181 4500008004100000020002200041022001400063245002300077210002300100260001500123300000900138490000700147520060100154100001900755700002400774700001900798856003600817 2015 eng d a978-3-939897-96-5 a1868-896900aOracles with Costs0 aOracles with Costs c2015/02/07 a1-260 v443 a While powerful tools have been developed to analyze quantum query complexity, there are still many natural problems that do not fit neatly into the black box model of oracles. We create a new model that allows multiple oracles with differing costs. This model captures more of the difficulty of certain natural problems. We test this model on a simple problem, Search with Two Oracles, for which we create a quantum algorithm that we prove is asymptotically optimal. We further give some evidence, using a geometric picture of Grover's algorithm, that our algorithm is exactly optimal. 1 aKimmel, Shelby1 aLin, Cedric, Yen-Yu1 aLin, Han-Hsuan uhttp://arxiv.org/abs/1502.0217402194nas a2200133 4500008004100000245007300041210006800114260001500182520175300197100002301950700002401973700002601997856003702023 2014 eng d00aThe computational power of normalizer circuits over black-box groups0 acomputational power of normalizer circuits over blackbox groups c2014/09/163 a This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems. We show that all these different forms of quantum computation belong to a common new restricted model of quantum operations that we call \emph{black-box normalizer circuits}. To define these, we extend the previous model of normalizer circuits [arXiv:1201.4867v1,arXiv:1210.3637,arXiv:1409.3208], which are built of quantum Fourier transforms, group automorphism and quadratic phase gates associated to an Abelian group $G$. In previous works, the group $G$ is always given in an explicitly decomposed form. In our model, we remove this assumption and allow $G$ to be a black-box group. While standard normalizer circuits were shown to be efficiently classically simulable [arXiv:1201.4867v1,arXiv:1210.3637,arXiv:1409.3208], we find that normalizer circuits are powerful enough to factorize and solve classically-hard problems in the black-box setting. We further set upper limits to their computational power by showing that decomposing finite Abelian groups is complete for the associated complexity class. In particular, solving this problem renders black-box normalizer circuits efficiently classically simulable by exploiting the generalized stabilizer formalism in [arXiv:1201.4867v1,arXiv:1210.3637,arXiv:1409.3208]. Lastly, we employ our connection to draw a few practical implications for quantum algorithm design: namely, we give a no-go theorem for finding new quantum algorithms with black-box normalizer circuits, a universality result for low-depth normalizer circuits, and identify two other complete problems. 1 aBermejo-Vega, Juan1 aLin, Cedric, Yen-Yu1 aVan den Nest, Maarten uhttp://arxiv.org/abs/1409.4800v101142nas a2200157 4500008004100000245008300041210006900124260001500193520063900208100002300847700001800870700002400888700001900912700001600931856003700947 2014 eng d00aDifferent Strategies for Optimization Using the Quantum Adiabatic Algorithm 0 aDifferent Strategies for Optimization Using the Quantum Adiabati c2014/01/283 a We present the results of a numerical study, with 20 qubits, of the performance of the Quantum Adiabatic Algorithm on randomly generated instances of MAX 2-SAT with a unique assignment that maximizes the number of satisfied clauses. The probability of obtaining this assignment at the end of the quantum evolution measures the success of the algorithm. Here we report three strategies which consistently increase the success probability for the hardest instances in our ensemble: decreasing the overall evolution time, initializing the system in excited states, and adding a random local Hamiltonian to the middle of the evolution. 1 aCrosson, Elizabeth1 aFarhi, Edward1 aLin, Cedric, Yen-Yu1 aLin, Han-Hsuan1 aShor, Peter uhttp://arxiv.org/abs/1401.7320v102350nas a2200133 4500008004100000245009000041210006900131260001500200520189100215100002302106700002402129700002602153856003702179 2014 eng d00aNormalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems 0 aNormalizer circuits and a GottesmanKnill theorem for infinitedim c2014/09/103 a $\textit{Normalizer circuits}$ [1,2] are generalized Clifford circuits that act on arbitrary finite-dimensional systems $\mathcal{H}_{d_1}\otimes ... \otimes \mathcal{H}_{d_n}$ with a standard basis labeled by the elements of a finite Abelian group $G=\mathbb{Z}_{d_1}\times... \times \mathbb{Z}_{d_n}$. Normalizer gates implement operations associated with the group $G$ and can be of three types: quantum Fourier transforms, group automorphism gates and quadratic phase gates. In this work, we extend the normalizer formalism [1,2] to infinite dimensions, by allowing normalizer gates to act on systems of the form $\mathcal{H}_\mathbb{Z}^{\otimes a}$: each factor $\mathcal{H}_\mathbb{Z}$ has a standard basis labeled by $\textit{integers}$ $\mathbb{Z}$, and a Fourier basis labeled by $\textit{angles}$, elements of the circle group $\mathbb{T}$. Normalizer circuits become hybrid quantum circuits acting both on continuous- and discrete-variable systems. We show that infinite-dimensional normalizer circuits can be efficiently simulated classically with a generalized $\textit{stabilizer formalism}$ for Hilbert spaces associated with groups of the form $\mathbb{Z}^a\times \mathbb{T}^b \times \mathbb{Z}_{d_1}\times...\times \mathbb{Z}_{d_n}$. We develop new techniques to track stabilizer-groups based on normal forms for group automorphisms and quadratic functions. We use our normal forms to reduce the problem of simulating normalizer circuits to that of finding general solutions of systems of mixed real-integer linear equations [3] and exploit this fact to devise a robust simulation algorithm: the latter remains efficient even in pathological cases where stabilizer groups become infinite, uncountable and non-compact. The techniques developed in this paper might find applications in the study of fault-tolerant quantum computation with superconducting qubits [4,5]. 1 aBermejo-Vega, Juan1 aLin, Cedric, Yen-Yu1 aVan den Nest, Maarten uhttp://arxiv.org/abs/1409.3208v2