Study shows limitations and possibilities of learning quantum circuit output distributions.
problem Learnability of output distributions of local quantum circuits.
method Investigated within two oracle models: statistical query model and direct sample access model.
result Output distributions of super-logarithmic depth Clifford circuits are not efficiently learnable in the statistical query model.
Single T-gate makes distribution learning hard for deep circuits.
problem Learning probability distributions from quantum circuits.
method Characterization of learnability and simulatability of quantum circuit outputs.
result Injection of a single T-gate into depth n^Ω(1) circuits makes distribution learning hard.
Quantum circuits reveal pathways to dequantization in machine learning models.
problem Navigating the complex landscape of quantum machine learning models and algorithms.
method Introducing a framework connecting quantum circuit structure to function representability.
result Fundamental properties of quantum circuits determine classical simulability of models.
MBQC linked to CQCA, yielding efficient Ansätze.
problem Quantum computation efficiency and Ansatz adaptation.
method Relating MBQC to CQCA and constructing Ansätze.
result MBQC Ansätze can lead to different performances on learning tasks.
The study examines how quantum resources enhance the complexity of quantum circuits.
problem Quantum resource enhancement on circuit complexity.
method Utilizing quantum resource theories, the study analyzes statistical complexities of quantum circuits with limited quantum resources.
result Bounds for statistical complexities of quantum circuits are derived and applied to specific cases.
Topological theory for qLDPC codes enables non-Clifford gates and magic state injection.
problem Fault-tolerant quantum computation in qLDPC codes with non-Clifford gates and magic state resources.
method Developed a topological theory using simplicial or CW complex structures and deformation retraction.
result Achieved non-Clifford gates and magic state injection in qLDPC codes with constant rate and polynomial distance.
Unified approach for quantum and classical learning from evaluation oracles.
problem Learning from evaluation oracles in quantum and classical settings.
method Inspired by Kearns' SQ and Valiant's weak evaluation oracle, a unified framework is established.
result Characterizes query complexity for learning linear function classes and extends learnability results for quantum circuits.
Quantum method generates unbiased samples from discrete graphical models.
problem Sampling from discrete graphical models is challenging and intractable in high dimensions.
method Embedding graphical models into unitary operators and using quantum circuits.
result Provably generates unbiased and independent samples from general discrete factor models.
Study evaluates capacity and trainability of parametrized quantum circuits.
problem Finding the best type of circuits for hybrid quantum-classical algorithms.
method Geometric structure of parameter space, effective quantum dimension, and circuit expressiveness.
result Identifies a transition in quantum geometry leading to decay of quantum natural gradient for deep circuits.
The paper examines smoothness in graded skew Clifford algebras.
problem Smoothness of graded skew Clifford algebras.
method Investigation of differential smoothness.
result Results on the differential smoothness of graded skew Clifford algebras.
The paper tests if LLMs' capabilities are executed by small subnetworks (circuits).
problem Understanding how LLMs execute their capabilities.
method Formalized criteria for circuits, developed hypothesis tests, applied to six circuits.
result Synthetic circuits align with idealized properties, while Transformer circuits vary in their alignment.
Study relates Finsler structures to Clifford bundles for flat metrics.
problem Relating Finsler structures to Clifford bundles for flat metrics.
method Examines extensions of Clifford bundles and Finsler type structures for flat metrics.
result Triangle map exists between Finsler structures constructed from metrics and 1-forms.
Study detects if a circuit bounds a disc using curve intersections.
problem Determining if a circuit bounds an embedded disc.
method Analyzing the group generated by Dehn twists about curves in a circuit.
result Cycle relation between Dehn twists detects disc-boundability.
Extends Kostant's results to symmetric pairs in Clifford algebras.
problem Analyzing k-invariants in Clifford algebras of symmetric pairs. method Proves Cartan theorem, transgression theorem, Harish-Chandra isomorphism, and Clifford algebra conjecture for relative case.
result Establishes a relative transgression theorem and Harish-Chandra isomorphism for Clifford algebras.
A Clifford-Wolf translation of a connected Finsler space is an isometry which moves each point the same distance. A Finsler space (M,F) is called Clifford-Wolf homogeneous if for any two points x1,x2∈M there is a Clifford-Wolf translation ρ such that ρ(x1)=x2. In this paper, we give a complete classifi…
Evolutionary strategy optimizes quantum circuit design and parameters.
problem Optimizing quantum circuit design and parameters for NISQ devices.
method Simple evolutionary strategy to optimize both circuit architecture and parameters.
result Minor slowdown on actual quantum hardware compared to simulations, with insights into mutation operations.
We introduce the concept of a Clifford-Weyl structure on a conformal manifold, which consists of an even Clifford structure parallel with respect to the tensor product of a metric connection on the Clifford bundle and a Weyl structure on the manifold. We show that the Weyl structure is necessarily closed except for som…
The paper studies 4-qubit Clifford states and their properties.
problem Understanding the set and properties of 4-qubit Clifford states.
method Analyzing the 293760 4-qubit Clifford states, splitting them into 18 groups, and studying the action of CNOT gates and local gates.
result There are 293760 4-qubit Clifford states with specific entanglement entropies, and any pair can be connected with local gates and at most 3 CNOT gates.
New symmetric Willmore tori emerge from Clifford torus in Berger spheres.
problem Finding new symmetric Willmore surfaces from Clifford torus.
method Applying bifurcation theory to estimate Morse index of Willmore surfaces.
result New symmetric Willmore tori emerge from Clifford torus.
This work uses SVM to identify track component failures in AC Track Circuits.
problem Detecting and identifying specific track component failures in AC Track Circuits.
method Applied SVM classifier to STDS track circuit data.
result Successfully classified 15 different track component failures.
A Clifford-Wolf translation of a connected Finsler space is an isometry which moves each point the sam distance. A Finsler space (M,F) is called Clifford-Wolf homogeneous if for any two point x1,x2∈M there is a Clifford-Wolf translation ρ such that ρ(x1)=x2. In this paper, we study Clifford-Wolf transl…
The statistical complexity of quantum circuits is studied using Rademacher complexity.
problem Measuring the richness of quantum hypothesis spaces.
method Applying Rademacher complexity to quantum circuits, investigating dependencies on resources, depth, width, and input/output registers.
result Bounds on the capacity of quantum neural networks constrained by circuit depth, width, and resource measures.
We consider the diffeological version of the Clifford algebra of a (diffeological) finite-dimensional vector space; we start by commenting on the notion of a diffeological algebra (which is the expected analogue of the usual one) and that of a diffeological module (also an expected counterpart of the usual notion). Aft…
Quantum circuit Born machines are generative models which represent the probability distribution of classical dataset as quantum pure states. Computational complexity considerations of the quantum sampling problem suggest that the quantum circuits exhibit stronger expressibility compared to classical neural networks. O…
Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural net…
Classifies compact Clifford-Klein forms for specific Lie algebras.
problem Classifying compact Clifford-Klein forms for given Lie algebra structures.
method Using Onishchik's results on semisimple Lie algebras, the paper classifies forms for triples (g,h,l).
result New examples of reductive homogeneous spaces with non-standard compact Clifford-Klein forms.
Machine learning identifies key metabolic control circuits in bacterial pathways.
problem Identifying regulated metabolic pathways in bacteria.
method Machine learning approach analyzing multi-omics data.
result Identification of E. coli Glycolysis regulatory circuits.
In this paper, we study Clifford-Wolf translations of Finsler spaces. We first give a characterization of Clifford-Wolf translations of Finsler spaces in terms of Killing vector fields. In particular, we show that there is a natural correspondence between Clifford-Wolf translations and the Killing vector fields of cons…
A new approach uses circuit topology to study complex polymer interactions.
problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.
Study bounds VAR model's circuit complexity, showing it's limited to TC^0 circuits.
problem Understanding the limitations of the Visual AutoRegressive model.
method Established circuit complexity bounds for the VAR model.
result VAR model is equivalent to a TC^0 threshold circuit with hidden dimension ≤ O(n).
We consider pseudo-Riemannian generalizations of Osserman, Clifford, and the duality principle properties for algebraic curvature tensors and investigate relations between them. We introduce quasi-Clifford curvature tensors using a generalized Clifford family and show that they are Osserman. This allows us to discover …
Quantum mechanics fundamentally forbids deterministic discrimination of quantum states and processes. However, the ability to optimally distinguish various classes of quantum data is an important primitive in quantum information science. In this work, we train near-term quantum circuits to classify data represented by …
We constructed an analog electrical circuit which generates fluctuations in which probability density function has power law tails. In the circuit fluctuations with an arbitrary exponent of the power law can be obtained by adjusting the resistance. With this low cost circuit the random fluctuations which have the simil…
Constructs a model for differential KO-theory using Clifford modules.
problem Refining Atiyah and Singer's families index with differential structure.
method Builds a model using families of Clifford modules with superconnection.
result Affords a differential refinement of Atiyah and Singer's families index.
Spin networks boost quantum algorithms solving SU(2) symmetric problems.
problem Efficiently solving SU(2) symmetric problems on quantum hardware.
method Using SU(2) equivariant variational quantum circuits based on spin networks.
result Spin networks provide a direct implementation for SU(2) equivariant quantum circuits.
The paper explores connections between quaternionic and Cayley calibrations in dimensions 8 and 16.
problem Exploring connections between quaternionic and Cayley calibrations in dimensions 8 and 16.
method Starting from collections of 'Kähler 2-forms', the paper constructs canonical 4-forms and calibrated 4-planes in dimensions 8 and 16.
result Explicit formulas for canonical 4-forms ΦSpin(8) and ΦSpin(7)U(1) are derived, and their calibrated 4-planes are characterized. Enhances quantum circuit synthesis using deep learning and geometric methods.
problem Optimizing quantum circuits for time efficiency.
method Combining deep learning with geometric control techniques.
result Improved time-optimal control in quantum circuit synthesis.
Paper develops data-driven compact models for diodes.
problem Manual and time-consuming compact model development.
method Machine Learning techniques for automation.
result Data-driven models accurately predict diode behavior.
A homogeneous space G/H is said to have a compact Clifford-Klein form if there exists a discrete subgroup D of G that acts properly discontinuously on G/H, such that the quotient space D\G/H is compact. When n is even, we find every closed, connected subgroup H of G = SO(2,n), such that G/H has a compact Clifford-Klein…
The geometry of nonholonomic bundle gerbes, provided with nonlinear connection structure, and nonholonomic gerbe modules is elaborated as the theory of Clifford modules on nonholonomic manifolds which positively fail to be spin. We explore an approach to such nonholonomic Dirac operators and derive the related Atiyah-S…
We propose a neural information processing system which is obtained by re-purposing the function of a biological neural circuit model, to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce Neuronal Circuit Policies (NCPs), defined as…
Superconducting circuit technologies have recently achieved quantum protocols involving closed feedback loops. Quantum artificial intelligence and quantum machine learning are emerging fields inside quantum technologies which may enable quantum devices to acquire information from the outer world and improve themselves …
Unified study of surfaces using Clifford algebras.
problem Classifying immersed surfaces in various manifolds.
method Using Clifford algebras to construct formalism for immersed bilegendrian surfaces.
result Full classifications of immersed bilegendrian surfaces in the unit tangent bundle of the 3-sphere.
We provide a necessary condition for the existence of a compact Clifford-Klein form of a given homogeneous space of reductive type. The key to the proof is to combine a result of Kobayashi-Ono with an elementary fact that certain two different Clifford-Klein forms have the same cohomology ring. We give some examples, S…
Quantum circuits are hard to learn on average.
problem Learning the output distributions of quantum circuits is hard.
method Statistical query model analysis.
result Learning quantum circuits requires exponentially many queries.
New proof of divisibility property for certain algebraic varieties.
problem Divisibility property for LQEL varieties.
method Construction of Clifford algebra representations to Severi varieties.
result New proof of Russo's Divisibility Property for LQEL varieties.
Study improves probabilistic circuits using transformations for better predictions.
problem Predictive limitations of probabilistic circuits in robotic scenarios.
method Integrates transformations into joint probability trees, extending their capabilities.
result Achieves higher likelihoods with fewer parameters on various data sets.
We compute the Bott-Morse Floer cohomology of the Clifford torus in $\CP^n$ with all possible spin-structures. Each spin structure is known to determine an orientation of the moduli space of holomorphic discs, and we analyze the change of orientation according to the change of spin structure of the Clifford torus. Also…