01436nas a2200133 4500008004100000245007900041210006900120260001400189520100200203100002001205700002101225700001901246856003701265 2024 eng d00aBeatty Sequences for a Quadratic Irrational: Decidability and Applications0 aBeatty Sequences for a Quadratic Irrational Decidability and App c2/13/20243 a

Let α and β belong to the same quadratic field. We show that the inhomogeneous Beatty sequence (⌊nα+β⌋)n≥1 is synchronized, in the sense that there is a finite automaton that takes as input the Ostrowski representations of n and y in parallel, and accepts if and only if y=⌊nα+β⌋. Since it is already known that the addition relation is computable for Ostrowski representations based on a quadratic number, a consequence is a new and rather simple proof that the first-order logical theory of these sequences with addition is decidable. The decision procedure is easily implemented in the free software Walnut.  As an application, we show that for each r≥1 it is decidable whether the set {⌊nα+β⌋:n≥1} forms an additive basis (or asymptotic additive basis) of order r. Using our techniques, we also solve some open problems of Reble and Kimberling, and give an explicit characterization of a sequence of Hildebrand et al.

1 aSchaeffer, Luke1 aShallit, Jeffrey1 aZorcic, Stefan uhttps://arxiv.org/abs/2402.0833102367nas a2200181 4500008004100000022001400041245004800055210004800103260001400151300000900165490000600174520189200180100001802072700001802090700001802108700002002126856003902146 2024 eng d a2521-327X00aFast simulation of planar Clifford circuits0 aFast simulation of planar Clifford circuits c2/12/2024 a12510 v83 a

A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally exponential in the treewidth of the underlying graph. Separately, Gottesman and Knill showed that if all gates are restricted to be Clifford, then there is a polynomial time simulation. We combine these two ideas and show that treewidth and planarity can be exploited to improve Clifford circuit simulation. Our main result is a classical algorithm with runtime scaling asymptotically as nω/2<n1.19 which samples from the output distribution obtained by measuring all n qubits of a planar graph state in given Pauli bases. Here ω is the matrix multiplication exponent. We also provide a classical algorithm with the same asymptotic runtime which samples from the output distribution of any constant-depth Clifford circuit in a planar geometry. Our work improves known classical algorithms with cubic runtime. A key ingredient is a mapping which, given a tree decomposition of some graph G, produces a Clifford circuit with a structure that mirrors the tree decomposition and which emulates measurement of the corresponding graph state. We provide a classical simulation of this circuit with the runtime stated above for planar graphs and otherwise ntω−1 where t is the width of the tree decomposition. Our algorithm incorporates two subroutines which may be of independent interest. The first is a matrix-multiplication-time version of the Gottesman-Knill simulation of multi-qubit measurement on stabilizer states. The second is a new classical algorithm for solving symmetric linear systems over F2 in a planar geometry, extending previous works which only applied to non-singular linear systems in the analogous setting.

1 aGosset, David1 aGrier, Daniel1 aKerzner, Alex1 aSchaeffer, Luke uhttps://arxiv.org/abs/2009.03218v301560nas a2200181 4500008004100000245006500041210005800106260001500164520103400179100001701213700002101230700002201251700002301273700002001296700001801316700002301334856002101357 2023 eng d00aOn the Rational Degree of Boolean Functions and Applications0 aRational Degree of Boolean Functions and Applications c10/12/20233 a

We study a natural complexity measure of Boolean functions known as the (exact) rational degree. For total functions f, it is conjectured that rdeg(f) is polynomially related to deg(f), where deg(f) is the Fourier degree. Towards this conjecture, we show that symmetric functions have rational degree at least deg(f)/2 and monotone functions have rational degree at least deg(f)−−−−−√. We observe that both of these lower bounds are tight. In addition, we show that all read-once depth-d Boolean formulae have rational degree at least Ω(deg(f)1/d). Furthermore, we show that almost every Boolean function on n variables has rational degree at least n/2−O(n−−√).
In contrast to total functions, we exhibit partial functions that witness unbounded separations between rational and approximate degree, in both directions. As a consequence, we show that for quantum computers, post-selection and bounded-error are incomparable resources in the black-box model.

1 aIyer, Vishnu1 aJain, Siddhartha1 aKovacs-Deak, Matt1 aKumar, Vinayak, M.1 aSchaeffer, Luke1 aWang, Daochen1 aWhitmeyer, Michael uarXiv:2310.0800401949nas a2200193 4500008004100000245005300041210005200094260001500146520133800161653004301499653002701542653003101569653002901600653003101629100001801660700002001678700002001698856003701718 2022 eng d00aSample-optimal classical shadows for pure states0 aSampleoptimal classical shadows for pure states c11/21/20223 a

We consider the classical shadows task for pure states in the setting of both joint and independent measurements. The task is to measure few copies of an unknown pure state ρ in order to learn a classical description which suffices to later estimate expectation values of observables. Specifically, the goal is to approximate Tr(Oρ) for any Hermitian observable O to within additive error ϵ provided Tr(O2)≤B and ∥O∥=1. Our main result applies to the joint measurement setting, where we show Θ~(B−−√ϵ−1+ϵ−2) samples of ρ are necessary and sufficient to succeed with high probability. The upper bound is a quadratic improvement on the previous best sample complexity known for this problem. For the lower bound, we see that the bottleneck is not how fast we can learn the state but rather how much any classical description of ρ can be compressed for observable estimation. In the independent measurement setting, we show that O(Bd−−−√ϵ−1+ϵ−2) samples suffice. Notably, this implies that the random Clifford measurements algorithm of Huang, Kueng, and Preskill, which is sample-optimal for mixed states, is not optimal for pure states. Interestingly, our result also uses the same random Clifford measurements but employs a different estimator.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aInformation Theory (cs.IT)10aMachine Learning (cs.LG)10aQuantum Physics (quant-ph)1 aGrier, Daniel1 aPashayan, Hakop1 aSchaeffer, Luke uhttps://arxiv.org/abs/2211.11810