betaFeedback

WorksPhysics and Astronomy

Entanglement Lower Bounds for Symmetric Quantum Circuits

Abstract

Symmetric circuits require every symmetry of the input to extend to an automorphism of the circuit. In the classical setting, their connection to descriptive complexity yields strong unconditional lower bounds. We extend this approach to the quantum model of symmetric computation defined by Castro-Silva, Gur, and Strelchuk (ITCS 2026), proving a tradeoff between circuit size and entanglement width (the smallest bb such that, on every computational-basis input, the state after each layer factors into states on at most bb qubits each). Our main result identifies a graph property decidable in classical polynomial time that no polynomial-size family of symmetric quantum circuits on nn-vertex graphs with entanglement width o(n/log⁡n)o(n/\log n) can compute. The bound holds for circuits with arbitrary one-qubit and two-qubit gates and unrestricted depth, and remains valid under the weaker notion of symmetry with respect to even permutations of vertices. Our proof is based on a new quantum pebble game based on the partial trace. The resulting indistinguishability theorem transfers classical pebble-game lower bounds to quantum circuits with restricted entanglement. By contrast, without entanglement restrictions, we show that every graph property in BQP can be computed by a uniform family of polynomial-size symmetric quantum circuits. Restricting to circuits with no entanglement at all, we show that polynomial-size symmetric quantum circuits with entanglement width 1 can compute every graph property definable in fixed-point logic with counting. Finally, we give an efficient symmetric implementation of QAOA for MAX 3XOR, providing a starting point for studying entanglement lower bounds in quantum optimization algorithms.

Introduction

Graph properties such as 3-colorability and Hamiltonicity give rise to fundamental computational problems, with numerous applications in both theory and practice. Although these properties are, by definition, invariant under relabelling of vertices, algorithms that decide them need not respect these symmetries: they may single out an arbitrary vertex or use the vertex labels to impose an ordering. This mismatch between the levels of abstraction at which computational problems are formulated and at which algorithms are designed and analyzed was a central motivation for the study of choiceless polynomial time by Blass, Gurevich, and Shelah [3], and is closely related to the longstanding problem of capturing polynomial-time computation in descriptive complexity theory.

This line of research has led to the systematic study of symmetric circuits, a model of computation in which the symmetries inherent to a problem are required to extend to the structure of the computation itself. Symmetric circuits thus provide a natural framework for investigating when symmetry-breaking, a form of algorithmic choice, is necessary for efficient computation.

Symmetric circuits were shown to admit exact characterizations in terms of mathematical logic, establishing a deep connection with descriptive complexity theory. In particular, Anderson and Dawar [1] established a correspondence between uniform families of polynomial-size symmetric circuits (with threshold gates) and definability in fixed-point logic with counting (FPC). This connection has made techniques from finite model theory available for studying circuit complexity, most notably pebble games between Spoiler and Duplicator. Building on these ideas, Dawar [6] and Dawar and Wilsenach [9, 10] developed methods for deriving symmetric circuit lower bounds from winning strategies for Duplicator in pebble games.

With a view to extending this programme to quantum computation, Castro-Silva, Gur, and Strelchuk [5] introduced the notion of symmetric quantum circuits. They showed how such circuits can efficiently implement fundamental quantum algorithmic techniques and, moreover, demonstrated exponential quantum advantage in the symmetric setting. In this paper, we turn to the complementary question: can the symmetry restriction itself be exploited to prove lower bounds for quantum circuits? Developing such a technique would be particularly valuable given the scarcity of methods for establishing quantum circuit lower bounds.

Here, we introduce a quantum-inspired generalization of pebble games tailored to the study of symmetric quantum circuits. Our notion of quantum pebble games takes a group-theoretic perspective, interpreting pebbles as restrictions on the symmetries available to Duplicator. The classical notion of partial isomorphism is replaced by a quantum analogue formulated in terms of reduced density matrices, recovering the classical notion for computational-basis states. By recasting pebble games in terms of symmetries and the local structure of quantum states, our framework offers a new perspective that we believe may be of independent interest.

Our main technical contribution is to turn this framework into a method for proving superpolynomial lower bounds on symmetric quantum circuits with restricted entanglement. In particular, we establish such lower bounds for an explicit graph property that is decidable in classical polynomial time: no family of polynomial-size symmetric quantum circuits with entanglement width o(n/log⁡n)o(n/\log n) can compute this property. Thus, even for classically tractable problems, symmetry together with restrictions on entanglement can impose fundamental limitations on the power of quantum computation.

To complement this result, we show that bounding some quantum resource is needed for a result of this type to hold: without such restrictions, polynomial-size symmetric quantum circuits capture the full power of BQP on graph problems (and on more general relational structures). Even in the total absence of entanglement, however, we prove that polynomial-size symmetric quantum circuits using only two-qubit gates can still compute all FPC-definable properties. This sharply contrasts with the classical setting, where polynomial-size symmetric circuits with Boolean gates cannot even compute the parity of the number of edges [7].

Finally, we give a direct symmetric implementation of QAOA for MAX 3XOR, together with a test of whether an assignment satisfies a prescribed number of equations. The resulting symmetric circuit accepts with the same probability that QAOA finds an assignment satisfying at least the prescribed number of equations.

Main results

Our results will be described in terms of the graph input model. A graph on [n][n] is encoded by its n2n^2 adjacency bits in the computational basis, with one input qubit for each ordered pair of vertices. Additional ancilla qubits begin in ∣0⟩\lvert0\rangle. A circuit applies layers of pairwise commuting gates and measures a distinguished output qubit. Its size s(C)s(C) is the total number of gates. Computing a property means producing the correct Boolean answer with probability at least 2/32/3 on every input.

Let Sym⁡n\operatorname{Sym}_n be the group of permutations of [n][n]. Graph properties are invariant under the action of Sym⁡n\operatorname{Sym}_n on its vertices. Quantum circuits are said to be symmetric if they are likewise invariant under these symmetries: we require every σ∈Sym⁡n\sigma\in\operatorname{Sym}_n to extend from the input qubits, by (u,v)↦(σ(u),σ(v))(u,v) \mapsto(\sigma(u),\sigma(v)), to a permutation of the circuit wires that preserves each layer and fixes the output wire. (See § 2.2 for a precise definition.)

The entanglement width3 of a state ∣ψ⟩\lvert\psi\rangle is the smallest number bb such that ∣ψ⟩\lvert\psi\rangle can be written as a tensor product of states on disjoint sets of at most bb qubits. For example, a product state has width 11, while a tensor product of Bell pairs has width 22 regardless of the number of pairs. The entanglement width η(C)\eta(C) of a quantum circuit CC is the smallest integer such that, on every computational-basis input and after each circuit layer, the global state of all wires has entanglement width at most η(C)\eta(C); the partition of the state into blocks is allowed to depend on both the input and the layer. Formal definitions appear in § 2.

The hard property PCFIAlt\mathcal{P}_{\mathrm{CFI}}^{\mathrm{Alt}} is a fixed polynomial-time graph property separating two families obtained from the construction of Cai, Fürer, and Immerman [4]. Their members are nonisomorphic but remain indistinguishable in an appropriate pebble game with linearly many pebbles. § 6 describes these families and the separating property.

We note that the property PCFIAlt\mathcal{P}_{\mathrm{CFI}}^{\mathrm{Alt}} admits a classical polynomial-time algorithm. Our main result identifies a restriction to computing it symmetrically, even in the quantum setting: polynomial-size circuits must generate near-linear entanglement (on the number of vertices) in order to compute it.

Theorem 1.1. Let f:Z+→Z+f:\mathbb{Z}_{+}\to\mathbb{Z}_{+} be any increasing function with f(n)=ω(log⁡n)f(n)=\omega(\log n). There is no family of symmetric quantum circuits (Cn)n(C_n)_n using one-qubit and two-qubit gates computing PCFIAlt\mathcal{P}_{\mathrm{CFI}}^{\mathrm{Alt}} which has size s(Cn)=2o(f(n))s(C_n)=2^{o(f(n))} and entanglement width η(Cn)=O(n/f(n))\eta(C_n)=O(n/f(n)).

In this theorem, the function ff relates the allowed entangled block size to the excluded circuit size. If the blocks have size O(n/f(n))O(n/f(n)), a family computing the property cannot have gate count 2o(f(n))2^{o(f(n))}. The condition f(n)=ω(log⁡n)f(n)=\omega(\log n) ensures that this excluded range includes every polynomial gate count. We note that the exact result we prove is stronger, as it also holds for circuits which are only symmetric with respect to the alternating group Alt⁡n\operatorname{Alt}_n of even permutations; see Theorem 6.1. As previously mentioned, the theorem is proven via a more general framework of Spoiler–Duplicator pebble games, which we describe in § 2.4. The following immediate consequences give the polynomial-size case and the case of a power-law bound on the block size.

Corollary 1.2. There is no polynomial-size family of symmetric quantum circuits (Cn)n(C_n)_n using one-qubit and two-qubit gates that computes PCFIAlt\mathcal{P}^{\mathrm{Alt}}_{\mathrm{CFI}} and has entanglement width η(Cn)=o(n/log⁡n)\eta(C_n) = o(n/\log n).

Corollary 1.3. Let 0<γ≤10 < \gamma\le1. There is no family of symmetric quantum circuits (Cn)n(C_n)_n using one-qubit and two-qubit gates computing PCFIAlt\mathcal{P}^{\mathrm{Alt}}_{\mathrm{CFI}} which has size s(Cn)=2o(nγ)s(C_n) = 2^{o(n^\gamma)} and entanglement width η(Cn)=O(n1−γ)\eta(C_n) = O(n^{1-\gamma}).

Our next result shows that restricting some quantum resource is essential for obtaining the lower bounds above: unrestricted polynomial-time symmetric computation attains the full power of BQP.

Theorem 1.4. Let P\mathcal{P} be a graph property. Suppose that a polynomial-time uniform family of quantum circuits computes P\mathcal{P} using q(n)q(n) one-qubit and two-qubit gates on inputs of order nn. Then, P\mathcal{P} can also be computed by a polynomial-time uniform family of symmetric quantum circuits using O(q(n)+n4log⁡2(n))O(q(n) + n^4\log^2(n)) one-qubit and two-qubit gates.

Furthermore, restricting entanglement width does not trivialize our model of computation. Fixed-point logic with counting (FPC) extends first-order logic with inductive definitions and counting, without assuming an ordering of the input vertices. It can express connectivity and the existence of a perfect matching, and captures all polynomial-time graph properties on planar graphs [7]. Our next result shows that every FPC-definable graph property can be computed by a polynomial-time uniform family of polynomial-size symmetric quantum circuits of entanglement width 1, using only one-qubit and two-qubit gates.

Theorem 1.5. Let P\mathcal{P} be an FPC-definable graph property. Then P\mathcal{P} can be computed by a polynomial-time uniform family of symmetric quantum circuits with entanglement width 1 using only one-qubit and two-qubit gates.

Finally, we connect our framework to quantum optimization by giving an efficient symmetric implementation of the Quantum Approximate Optimization Algorithm which we apply to MAX 3XOR. An instance of this problem is given by J=(A,d)J = (A,d), and consists of mm equations Ay=dAy = d over F2\mathbb{F}_2 with nn Boolean variables, where each row of AA contains three nonzero entries. The aim is to find an assignment satisfying as many equations as possible. QAOA begins with the uniform superposition of all assignments and at each round applies phases determined by the number of satisfied equations, followed by the application of e−iβrXe^{-i\beta_r X} on every variable qubit. The parameters γr\gamma_r and βr\beta_r control these two operations in round rr, respectively.

Permuting the equations permutes the rows of AA and the corresponding entries of dd, permuting the variables permutes the columns of AA. We call a circuit symmetric for this problem if every such independent permutation of the equations and variables extends to a permutation of all circuit wires that preserves each layer and fixes the output wire.

Theorem 1.6 (Symmetric implementation of QAOA). For positive integers m,n,p∈Nm,n,p \in\mathbb{N}, a threshold t∈{0,…,m}t \in\{0,\ldots,m\}, and angles γ=(γ1,…,γp)\gamma= (\gamma_1,\ldots,\gamma_p) and β=(β1,…,βp)∈Rp\beta= (\beta_1,\ldots,\beta_p) \in\mathbb{R}^p, there is a symmetric quantum circuit CC that uses O(pmn+mlog⁡m)O(pmn + m\log m) one-qubit and two-qubit gates and satisfies the following: on every MAX 3XOR instance J=(A,d)J = (A,d) with mm equations and nn variables, encoded as ∣J⟩=∣A⟩∣d⟩|J\rangle= |A\rangle|d\rangle, its acceptance probability equals the probability that QAOA with angles γ,β\gamma,\beta produces an assignment satisfying at least tt equations.

This construction connects our lower bound methods to quantum optimization. The computation accepts when the QAOA algorithm produces an assignment satisfying at least tt equations (so its acceptance probability measures success in the optimization task). Our techniques can therefore be used to study the entanglement required by the full symmetric implementation, including its auxiliary qubits.

Prior work

Anderson and Dawar [1] characterize fixed-point logic with counting by polynomially uniform families of symmetric circuits over a suitable gate set. Symmetry here is a property of the circuit structure: every permutation of the input labels respecting the encoding extends to an automorphism of the whole circuit. Inexpressibility in FPC, as in the result of Cai, Fürer, and Immerman [4], consequently yields lower bounds for symmetric circuits [7].

Dawar [6] and Dawar and Wilsenach [9, 10] formulate the lower-bound argument directly using pebble games. Their method also applies to symmetric arithmetic circuits computing the permanent [9] and determinant [10]. Dawar extends the CFI lower bound to other properties through symmetric circuit reductions [6]. Our quantum indistinguishability theorem has the same role: it transfers a winning Duplicator strategy into equality of circuit output probabilities.

The symmetric quantum model of Castro-Silva, Gur, and Strelchuk supports amplitude amplification and phase estimation [5]. They also give polynomial-size symmetric quantum circuits for XOR-SAT, obtaining an exponential separation from symmetric classical threshold circuits. These upper bounds use arbitrary single-qubit gates and unbounded-fan-in threshold gates. Using our symmetric implementation of threshold gates using 1-qubit and 2-qubit gates (Lemma 7.1), we show that our models are equivalent in power.

Jozsa and Linden [14] show that polynomial-size uniform quantum computations over two-qubit gates can be simulated efficiently when, after every gate, their states factor into blocks of bounded size. Our result addresses the entanglement needed under a symmetry requirement, for a property that already has a classical polynomial-time algorithm. Note that we allow the block-size bound to grow to n1−o(1)n^{1-o(1)}, thus going beyond the remit of their results.

AI disclosure statement

The definition of the quantum pebble game and the associated lower bounds were obtained and written without AI assistance. Theorems 1.4–1.6 were later obtained by Google Antigravity when prompted by the authors. The authors subsequently simplified and rewrote the proofs of those results.

Circuit model, pebble games, and proof overview

Here, we formally describe our symmetric quantum circuit model. While our main results are stated for graphs, this model holds in greater generality for any finite relational structure, as given below.

Preliminary definitions

Definition 2.1. A relational vocabulary is a nonempty finite tuple τ=(R1r1,…,Rkrk)\tau= (R_1^{r_1}, \ldots, R_k^{r_k}) of relation symbols, where for each i∈[k]i \in[k], the relation symbol RiR_i has an associated arity ri∈Z+r_i \in\mathbb{Z}_+.

Definition 2.2. A τ\tau-structure with respect to a relational vocabulary τ=(R1r1,…,Rkrk)\tau= (R_1^{r_1}, \ldots, R_k^{r_k}) is a tuple A=⟨A;R1A,…,RkA⟩\mathcal{A} = \langle A; R_1^{\mathcal{A}}, \ldots, R_k^{\mathcal{A}} \rangle, where AA is a set called the domain of A\mathcal{A} and for each i∈[k]i \in[k], we have RiA⊆AriR_i^{\mathcal{A}} \subseteq A^{r_i}.

Let fin⁡[τ]\operatorname{fin}[\tau] denote the set of finite τ\tau-structures. The elements of the domain AA are called the elements of A\mathcal{A}. The size of a structure is the size of its domain. A structure A\mathcal{A} is finite if its domain is finite.

For example, consider the relational vocabulary τgraph=(E2)\tau_{\mathrm{graph}} = (E^{2}) consisting of one binary relation EE. A directed graph can then be described as a τgraph\tau_{\mathrm{graph}}-structure G=⟨V;EG⟩\mathcal{G} = \langle V; E^{\mathcal{G}}\rangle where the domain is the set of vertices VV and the edges are described by EG⊆V2E^{\mathcal{G}} \subseteq V^{2}.

A τ\tau-property P\mathcal{P} is a subset of fin⁡[τ]\operatorname{fin}[\tau]. A τ\tau-property P\mathcal{P} is said to be polynomial time if there is a polynomial-time algorithm which, given an efficient representation of a finite τ\tau-structure A\mathcal{A}, decides whether A∈P\mathcal{A} \in\mathcal{P}. Say that a τ\tau-property P\mathcal{P} separates two structures A,B∈fin⁡[τ]\mathcal{A}, \mathcal{B} \in\operatorname{fin}[\tau] if A\mathcal{A} and B\mathcal{B} do not agree on membership in P\mathcal{P}, and P\mathcal{P} separates two families of τ\tau-structures (An)n∈Z≥1(\mathcal{A}_{n})_{n\in\mathbb{Z}_{\geq1}} and (Bn)n∈Z≥1(\mathcal{B}_{n})_{n\in\mathbb{Z}_{\geq1}} if it separates An\mathcal{A}_{n} and Bn\mathcal{B}_{n} for each nn.

For a finite set SS, let Sym⁡S\operatorname{Sym}_{S} denote the symmetric group of all permutations on SS. Let Alt⁡S≤Sym⁡S\operatorname{Alt}_{S} \leq\operatorname{Sym}_{S} denote the alternating group of even permutations on SS. Write Sym⁡n\operatorname{Sym}_{n} for Sym⁡[n]\operatorname{Sym}_{[n]} and Alt⁡n\operatorname{Alt}_{n} for Alt⁡[n]\operatorname{Alt}_{[n]}. If GG is a group acting on SS and s∈Ss \in S, let Stab⁡G(s)={σ∈G:σ(s)=s}\operatorname{Stab}_{G}(s) = \{\sigma\in G : \sigma(s) = s\} denote the stabilizer group of ss and Orb⁡G(s)={σ(s):σ∈G}\operatorname{Orb}_{G}(s) = \{\sigma(s) : \sigma\in G\} denote the orbit of ss under GG. If T⊆ST \subseteq S, let σ(T)={σ(t):t∈T}\sigma(T) = \{\sigma(t) : t \in T\} and let Stab⁡G(T)=⋂t∈TStab⁡G(t)\operatorname{Stab}_{G}(T) = \bigcap_{t\in T}\operatorname{Stab}_{G}(t) denote the pointwise stabilizer of TT.

References

  1. [1]Matthew Anderson and Anuj Dawar. “On Symmetric Circuits and Fixed-Point Logics”. In: Theory of Computing Systems 60 (Apr. 2017), pp. 521–551. DOI: 10.1007/s00224-016-9692-2.
  2. [2]Reinhold A. Bertlmann and Nicolai Friis. “Multipartite Entanglement”. In: Modern Quantum Theory. 1st ed. Oxford University Press, Sept. 2023, pp. 593–626. DOI: 10.1093/oso/9780199683338.003.0018.DOI
  3. [3]Andreas Blass, Yuri Gurevich, and Saharon Shelah. “Choiceless polynomial time”. In: Annals of Pure and Applied Logic 100.1–3 (1999), pp. 141–187. DOI: 10.1016/S0168-0072(99)00005-6.DOI
  4. [4]Jin-Yi Cai, Martin Fürer, and Neil Immerman. “An optimal lower bound on the number of variables for graph identification”. In: Combinatorica 12.4 (Dec. 1992), pp. 389–410. DOI: 10.1007/BF01305232.
  5. [5]Davi Castro-Silva, Tom Gur, and Sergii Strelchuk. “Symmetric Quantum Computation”. In: 17th Innovations in Theoretical Computer Science Conference (ITCS 2026). Vol. 362. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026, 35:1–35:10. DOI: 10.4230/LIPIcs.ITCS.2026.35. Full version at arXiv:2501.01214.
  6. [6]Anuj Dawar. “On Symmetric and Choiceless Computation”. In: Topics in Theoretical Computer Science (TTCS). Ed. by Mohammed Taghi Hajiaghayi and Mohammad Reza Mousavi. Tehran, Iran, Aug. 2015, pp. 23–29. DOI: 10.1007/978–3–319–28678–5_2.DOI
  7. [7]Anuj Dawar. “The nature and power of fixed-point logic with counting”. In: ACM SIGLOG News 2.1 (Jan. 2015), pp. 8–21. DOI: 10.1145/2728816.2728820.DOI
  8. [8]John D. Dixon and Brian Mortimer. Permutation groups. Graduate Texts in Mathematics. New York: Springer, 1996.
  9. [9]Anuj Dawar and Gregory Wilsenach. “Symmetric Arithmetic Circuits”. In: 47th International Colloquium on Automata, Languages, and Programming (ICALP). Ed. by Artur Czumaj, Anuj Dawar, and Emanuela Merelli. Vol. 168. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020, 36:1–36:18. DOI: 10.4230/LIPIcs.ICALP.2020.36. Full version at arXiv:2002.06451v3.arxiv.org/abs/2002.06451
  10. [10]Anuj Dawar and Gregory Wilsenach. “Lower Bounds for Symmetric Circuits for the Determinant”. In: 13th Innovations in Theoretical Computer Science Conference (ITCS). Ed. by Mark Braverman. Vol. 215. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, 52:1–52:22. DOI: 10.4230/LIPIcs.ITCS.2022.52. Full version at arXiv:2107.10986v3.arxiv.org/abs/2107.10986
  11. [11]Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A Quantum Approximate Optimization Algorithm. 2014. arXiv: 1411.4028 [quant-ph].arxiv.org/abs/1411.4028
  12. [12]Tsubasa Ichikawa et al. “Exchange symmetry and multipartite entanglement”. In: Physical Review A 78.5 (2008), p. 052105. DOI: 10.1103/PhysRevA.78.052105.DOI
  13. [13]Neil Immerman and Eric Lander. “Describing Graphs: A First-Order Approach to Graph Canonization”. In: Complexity Theory Retrospective. Ed. by Alan L. Selman. New York, NY: Springer, 1990, pp. 59–81. DOI: 10.1007/978–1–4612–4478–3_5.DOI
  14. [14]Richard Jozsa and Noah Linden. “On the role of entanglement in quantum computational speed-up”. In: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 459.2036 (Aug. 2003), pp. 2011–2032. DOI: 10.1098/rspa.2002.1097.DOI
  15. [15]Sandra Kiefer and Daniel Neuen. “Bounding the Weisfeiler–Leman Dimension via a Depth Analysis of I/R-Trees”. In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS ’24. Association for Computing Machinery, 2024, 50:1–50:14. DOI: 10.1145/3661814.3662122.DOI
  16. [16]Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Dec. 2010. DOI: 10.1017/CBO9780511976667.
  17. [17]Oleg Pikhurko, Helmut Veith, and Oleg Verbitsky. The First Order Definability of Graphs: Upper Bounds for Quantifier Rank. 2003. DOI: 10.48550/arXiv.math/0311041. arXiv: math/0311041 [math.CO].DOI
  18. [18]Thomas Schneider and Pascal Schweitzer. “An Upper Bound on the Weisfeiler–Leman Dimension”. In: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Ed. by Keren Censor-Hillel et al. Vol. 334. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, 129:1–129:18. DOI: 10.4230/LIPIcs.ICALP.2025.129.arxiv.org/abs/2403.12581

Paper details

vlnc:W_2axg4a3k
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Google Antigravity

View statement
Looking for related papers…
Contents