Topological quantum compilation of metaplectic anyons based on the genetic optimized algorithms

• URL: http://arxiv.org/abs/2501.01745v4
• Date: Sun, 09 Feb 2025 09:31:19 GMT
• Title: Topological quantum compilation of metaplectic anyons based on the genetic optimized algorithms
• Authors: Jiangwei Long, Jianxin Zhong, Lijun Meng,
• Abstract summary: We obtain a total of 6 anyon models utilizing F-matrices, R-symbols, and fusion rules of metaplectic anyon.<n>For one-qubit case, the classical H- and T-gate can be well constructed using the genetic algorithm enhanced Solovay-Kitaev algorithm.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Topological quantum computing holding global anti-interference ability is realized by braiding some anyons, such as well-known Fibonacci anyons. Here, based on $SO(3)_2$ theory we obtain a total of 6 anyon models utilizing F-matrices, R-symbols, and fusion rules of metaplectic anyon.We obtain the elementary braided matrices (EBMs) by means of unconventional encoding. After braid $X$ and $X'$, we insert a pair of $Z$ anyons into they to ensure that the initial order of anyons remains unchanged. In this process only fusion is required, and measurement is not necessary. Three of them $\{V_3^{113}, V_3^{131}, V_1^{133}\}$ are studied in detail. We study systematically the compilation of these three models through EBMs obtained analytically. For one-qubit case, the classical H- and T-gate can be well constructed using the genetic algorithm enhanced Solovay-Kitaev algorithm (GA-enhanced SKA) by $\{V_3^{113}, V_3^{131}, V_1^{133}\}$. The obtained accuracy of the H/T-gate by $\{V_3^{113}, V_1^{133}\}$ is slightly inferior to the corresponding gates of the Fibonacci anyon model, but it also can meet the requirements of fault-tolerant quantum computing, $V^3_131$ giving the best performance of these four models. For the two-qubit case, we use the exhaustive method for short lengths and the GA for long lengths to obtain braidword for $\{V_3^{113}, V_3^{131}, V_1^{133}\}$ models. The resulting matrices can well approximate the local equivalence class of the CNOT-gate, while demonstrating a much smaller error than the Fibonacci model, especially for the $V_3^{113}$.

Related papers

• Computational-Statistical Gaps in Gaussian Single-Index Models [77.1473134227844]
  Single-Index Models are high-dimensional regression problems with planted structure. We show that computationally efficient algorithms, both within the Statistical Query (SQ) and the Low-Degree Polynomial (LDP) framework, necessarily require $Omega(dkstar/2)$ samples.
  arXiv  Detail & Related papers  (2024-03-08T18:50:19Z)
• How to Capture Higher-order Correlations? Generalizing Matrix Softmax Attention to Kronecker Computation [12.853829771559916]
  We study a generalization of attention which captures triple-wise correlations. This generalization is able to solve problems about detecting triple-wise connections that were shown to be impossible for transformers. We show that our construction, algorithms, and lower bounds naturally generalize to higher-order tensors and correlations.
  arXiv  Detail & Related papers  (2023-10-06T07:42:39Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials [93.59919600451487]
  "Statistical-computational gaps" occur in many statistical inference tasks. We consider a model for random order-3 decomposition where one component is slightly larger in norm than the rest. We show that tensor entries can accurately estimate the largest component when $ll n3/2$ but fail to do so when $rgg n3/2$.
  arXiv  Detail & Related papers  (2022-11-10T00:40:37Z)
• NAG-GS: Semi-Implicit, Accelerated and Robust Stochastic Optimizer [45.47667026025716]
  We propose a novel, robust and accelerated iteration that relies on two key elements. The convergence and stability of the obtained method, referred to as NAG-GS, are first studied extensively. We show that NAG-arity is competitive with state-the-art methods such as momentum SGD with weight decay and AdamW for the training of machine learning models.
  arXiv  Detail & Related papers  (2022-09-29T16:54:53Z)
• Minimax Optimal Quantization of Linear Models: Information-Theoretic Limits and Efficient Algorithms [59.724977092582535]
  We consider the problem of quantizing a linear model learned from measurements. We derive an information-theoretic lower bound for the minimax risk under this setting. We show that our method and upper-bounds can be extended for two-layer ReLU neural networks.
  arXiv  Detail & Related papers  (2022-02-23T02:39:04Z)
• U(1) Fields from Qubits: an Approach via D-theory Algebra [0.0]
  A new quantum link microstructure was proposed for the lattice quantum chromodynamics (QCD) Hamiltonian. This formalism provides a general framework for building lattice field theory algorithms for quantum computing.
  arXiv  Detail & Related papers  (2022-01-07T11:45:22Z)
• On $O( \max \{n_1, n_2 \}\log ( \max \{ n_1, n_2 \} n_3) )$ Sample Entries for $n_1 \times n_2 \times n_3$ Tensor Completion via Unitary Transformation [20.854908850239035]
  This paper investigates the incoherence conditions of $n_3$ low-rank $n_3$ low-rank $n_3$ matrix slices. We show that such low-rank tensors can be recovered exactly with high probability.
  arXiv  Detail & Related papers  (2020-12-16T08:03:48Z)
• Quantum algorithms for spectral sums [50.045011844765185]
  We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. We show how the algorithms and techniques used in this work can be applied to three problems in spectral graph theory.
  arXiv  Detail & Related papers  (2020-11-12T16:29:45Z)
• Even more efficient quantum computations of chemistry through tensor hypercontraction [0.6234350105794442]
  We describe quantum circuits with only $widetildecal O(N)$ Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of $N$ arbitrary orbitals. This is the lowest complexity that has been shown for quantum computations of chemistry within an arbitrary basis.
  arXiv  Detail & Related papers  (2020-11-06T18:03:29Z)
• Tensor lattice field theory with applications to the renormalization group and quantum computing [0.0]
  We discuss the successes and limitations of statistical sampling for a sequence of models studied in the context of lattice QCD. We show that these lattice models can be reformulated using tensorial methods where the field integrations in the path-integral formalism are replaced by discrete sums. We derive Hamiltonians suitable to perform quantum simulation experiments, for instance using cold atoms, or to be programmed on existing quantum computers.
  arXiv  Detail & Related papers  (2020-10-13T16:46:34Z)
• Generalized Matrix Factorization: efficient algorithms for fitting generalized linear latent variable models to large data arrays [62.997667081978825]
  Generalized Linear Latent Variable models (GLLVMs) generalize such factor models to non-Gaussian responses. Current algorithms for estimating model parameters in GLLVMs require intensive computation and do not scale to large datasets. We propose a new approach for fitting GLLVMs to high-dimensional datasets, based on approximating the model using penalized quasi-likelihood.
  arXiv  Detail & Related papers  (2020-10-06T04:28:19Z)
• Linear-Sample Learning of Low-Rank Distributions [56.59844655107251]
  We show that learning $ktimes k$, rank-$r$, matrices to normalized $L_1$ distance requires $Omega(frackrepsilon2)$ samples. We propose an algorithm that uses $cal O(frackrepsilon2log2fracepsilon)$ samples, a number linear in the high dimension, and nearly linear in the matrices, typically low, rank proofs.
  arXiv  Detail & Related papers  (2020-09-30T19:10:32Z)
• Fibonacci anyons versus Majorana fermions [0.0]
  We compare the Ising ($k=2$) anyon and Fibonacci ($k=3$) anyon models, motivated by their potential for future realizations based on Majorana fermion quasiparticles or exotic fractional quantum-Hall states. We find that for reasonable levels of decoherence, even the hybrid Ising anyon model retains a significant topological advantage over a conventional, non-topological, quantum computer.
  arXiv  Detail & Related papers  (2020-08-25T02:44:17Z)
• Compiling single-qubit braiding gate for Fibonacci anyons topological quantum computation [0.0]
  Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons.
  arXiv  Detail & Related papers  (2020-08-08T15:34:03Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)
• The quantum sine-Gordon model with quantum circuits [0.0]
  We numerically investigate a one-dimensional, faithful, analog, quantum electronic circuit simulator built out of Josephson junctions. We provide numerical evidence that the parameters required to realize the quantum sine-Gordon model are accessible with modern-day superconducting circuit technology.
  arXiv  Detail & Related papers  (2020-07-14T07:39:31Z)
• Estimation of sparse Gaussian graphical models with hidden clustering structure [8.258451067861932]
  We propose a model to estimate the sparse Gaussian graphical models with hidden clustering structure. We develop a symmetric Gauss-Seidel based alternating direction method of the multipliers. Numerical experiments on both synthetic data and real data demonstrate the good performance of our model.
  arXiv  Detail & Related papers  (2020-04-17T08:43:31Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)
• Learning Gaussian Graphical Models via Multiplicative Weights [54.252053139374205]
  We adapt an algorithm of Klivans and Meka based on the method of multiplicative weight updates. The algorithm enjoys a sample complexity bound that is qualitatively similar to others in the literature. It has a low runtime $O(mp2)$ in the case of $m$ samples and $p$ nodes, and can trivially be implemented in an online manner.
  arXiv  Detail & Related papers  (2020-02-20T10:50:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.