scholarly journals Simulating quantum computations with Tutte polynomials

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Ryan L. Mann
Keyword(s):  
Structural Properties ◽  
Explicit Form ◽  
Heuristic Algorithm ◽  
Tutte Polynomial ◽  
Quantum Probability ◽  
Experimental Results ◽  
Quantum Circuits ◽  
Contraction Property ◽  
Tutte Polynomials ◽  
Output Probability

AbstractWe establish a classical heuristic algorithm for exactly computing quantum probability amplitudes. Our algorithm is based on mapping output probability amplitudes of quantum circuits to evaluations of the Tutte polynomial of graphic matroids. The algorithm evaluates the Tutte polynomial recursively using the deletion–contraction property while attempting to exploit structural properties of the matroid. We consider several variations of our algorithm and present experimental results comparing their performance on two classes of random quantum circuits. Further, we obtain an explicit form for Clifford circuit amplitudes in terms of matroid invariants and an alternative efficient classical algorithm for computing the output probability amplitudes of Clifford circuits.

Salp swarm algorithm with crossover scheme and Lévy flight for global optimization

2021 ◽  
pp. 1-12
Author(s):  
Heming Jia ◽  
Chunbo Lang
Keyword(s):  
Global Optimization ◽  
Heuristic Algorithm ◽  
Experimental Results ◽  
High Dimensional ◽  
Lévy Flight ◽  
Test Functions ◽  
Levy Flight ◽  
Salp Swarm Algorithm ◽  
Swarm Algorithm ◽  
Accuracy And Stability

Salp swarm algorithm (SSA) is a meta-heuristic algorithm proposed in recent years, which shows certain advantages in solving some optimization tasks. However, with the increasing difficulty of solving the problem (e.g. multi-modal, high-dimensional), the convergence accuracy and stability of SSA algorithm decrease. In order to overcome the drawbacks, salp swarm algorithm with crossover scheme and Lévy flight (SSACL) is proposed. The crossover scheme and Lévy flight strategy are used to improve the movement patterns of salp leader and followers, respectively. Experiments have been conducted on various test functions, including unimodal, multimodal, and composite functions. The experimental results indicate that the proposed SSACL algorithm outperforms other advanced algorithms in terms of precision, stability, and efficiency. Furthermore, the Wilcoxon’s rank sum test illustrates the advantages of proposed method in a statistical and meaningful way.

scholarly journals The Tutte polynomial of symmetric hyperplane arrangements

2020 ◽  
Vol 29 (03) ◽  
pp. 2050004
Author(s):  
Hery Randriamaro
Keyword(s):  
Hyperplane Arrangement ◽  
Dual Graph ◽  
Tutte Polynomial ◽  
Hyperplane Arrangements ◽  
Weyl Groups ◽  
Reflection Groups ◽  
Tutte Polynomials ◽  
One Year ◽  
The One ◽  
Definition Of

The Tutte polynomial is originally a bivariate polynomial which enumerates the colorings of a graph and of its dual graph. Ardila extended in 2007 the definition of the Tutte polynomial on the real hyperplane arrangements. He particularly computed the Tutte polynomials of the hyperplane arrangements associated to the classical Weyl groups. Those associated to the exceptional Weyl groups were computed by De Concini and Procesi one year later. This paper has two objectives: On the one side, we extend the Tutte polynomial computing to the complex hyperplane arrangements. On the other side, we introduce a wider class of hyperplane arrangements which is that of the symmetric hyperplane arrangements. Computing the Tutte polynomial of a symmetric hyperplane arrangement permits us to deduce the Tutte polynomials of some hyperplane arrangements, particularly of those associated to the imprimitive reflection groups.

Application of Immune Genetic Algorithm in Survey Data Processing

2012 ◽  
Vol 241-244 ◽  
pp. 1737-1740
Author(s):  
Wei Chen
Keyword(s):  
Genetic Algorithm ◽  
Immune System ◽  
Data Processing ◽  
Survey Data ◽  
Heuristic Algorithm ◽  
Experimental Results ◽  
Immune Genetic Algorithm ◽  
Basic Principles ◽  
Immune Operator ◽  
Biological Immune System

The immune genetic algorithm is a kind of heuristic algorithm which simulates the biological immune system and introduces the genetic operator to its immune operator. Conquering the inherent defects of genetic algorithm that the convergence direction can not be easily controlled so as to result in the prematureness；it is characterized by a better global search and memory ability. The basic principles and solving steps of the immune genetic algorithm are briefly introduced in this paper. The immune genetic algorithm is applied to the survey data processing and experimental results show that this method can be practicably and effectively applied to the survey data processing.

scholarly journals A study about the Tutte polynomials of benzenoid chains

2017 ◽  
Vol 5 (1) ◽  
pp. 28-32
Author(s):  
Abdulgani Sahin
Keyword(s):  
Tutte Polynomial ◽  
Signed Graphs ◽  
Tutte Polynomials

Abstract The Tutte polynomials for signed graphs were introduced by Kauffman. In 2012, Fath-Tabar, Gholam-Rezaeı and Ashrafı presented a formula for computing Tutte polynomial of a benzenoid chain. From this point on, we have also calculated the Tutte polynomials of signed graphs of benzenoid chains in this study.

scholarly journals Dichromatic polynomial for graph of a (2,n)-torus knot

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Abdulgani Şahin
Keyword(s):  
Tutte Polynomial ◽  
Signed Graph ◽  
Torus Knots ◽  
Torus Knot ◽  
Tutte Polynomials ◽  
The Relationship ◽  
Dichromatic Polynomial

AbstractIn this study, we introduce the relationship between the Tutte polynomials and dichromatic polynomials of (2,n)-torus knots. For this aim, firstly we obtain the signed graph of a (2,n)-torus knot, marked with {+} signs, via the regular diagram of its. Whereupon, we compute the Tutte polynomial for this graph and find a generalization through these calculations. Finally we obtain dichromatic polynomial lying under the unmarked states of the signed graph of the (2,n)-torus knots by the generalization.

scholarly journals Graph polynomials and symmetries

2019 ◽  
Vol 18 (09) ◽  
pp. 1950172 ◽  
Author(s):  
Nafaa Chbili
Keyword(s):  
Automorphism Group ◽  
Finite Field ◽  
Characteristic Polynomial ◽  
Prime Order ◽  
Tutte Polynomial ◽  
Quotient Graph ◽  
Graph Polynomials ◽  
Tutte Polynomials

In a recent paper, we studied the interaction between the automorphism group of a graph and its Tutte polynomial. More precisely, we proved that certain symmetries of graphs are clearly reflected by their Tutte polynomials. The purpose of this paper is to extend this study to other graph polynomials. In particular, we prove that if a graph [Formula: see text] has a symmetry of prime order [Formula: see text], then its characteristic polynomial, with coefficients in the finite field [Formula: see text], is determined by the characteristic polynomial of its quotient graph [Formula: see text]. Similar results are also proved for some generalization of the Tutte polynomial.

An Algorithm for Modeling the Covalent Triazine-Based Frameworks

2019 ◽  
Vol 956 ◽  
pp. 212-217
Author(s):  
Ce Song ◽  
Zhao Liang Meng ◽  
Jin Yan Wang ◽  
Fang Yuan Hu ◽  
Xi Gao Jian
Keyword(s):  
Theoretical Model ◽  
Pore Size ◽  
Structural Properties ◽  
Experimental Results ◽  
Size Distributions ◽  
Design Strategies ◽  
Surface Areas ◽  
Pore Size Distributions ◽  
Amorphous Structures ◽  
Acceptable Consistency

An algorithm for generating the representative structures of covalent triazine-based frameworks (CTFs) is proposed, and examined by being applied to the framework synthesized by the trimerization of dicyanobenzene. The algorithm is validated by the comparison between the calculated and experimental results of the structural properties such as surface areas and pore size distributions, which shows acceptable consistency. Moreover, the presented modeling approach can be expected for more extensive use for other CTFs. Thus the simulated atomistic strucutures produced from the modeling method can improve the understanding for amorphous structures of the CTFs which have already been developed, as well as predict the theoretical model of new CTFs, and provide useful design strategies for the future experimental efforts.

scholarly journals The Arithmetic Tutte polynomial of two matrices associated to Trees

2018 ◽  
Vol 6 (1) ◽  
pp. 310-322
Author(s):  
R. B. Bapat ◽  
Sivaramakrishnan Sivasubramanian
Keyword(s):  
Analogous Result ◽  
Polynomial Matrix ◽  
Tutte Polynomial ◽  
Distance Matrix ◽  
Minimum Volume ◽  
Maximum Volume ◽  
Recent Interest ◽  
Minimum Volume Ellipsoid ◽  
Tutte Polynomials ◽  
Exponential Distance

Abstract Arithmetic matroids arising from a list A of integral vectors in Zn are of recent interest and the arithmetic Tutte polynomial MA(x, y) of A is a fundamental invariant with deep connections to several areas. In this work, we consider two lists of vectors coming from the rows of matrices associated to a tree T. Let T = (V, E) be a tree with |V| = n and let LT be the q-analogue of its Laplacian L in the variable q. Assign q = r for r ∈ ℤ with r/= 0, ±1 and treat the n rows of LT after this assignment as a list containing elements of ℤn. We give a formula for the arithmetic Tutte polynomial MLT (x, y) of this list and show that it depends only on n, r and is independent of the structure of T. An analogous result holds for another polynomial matrix associated to T: EDT, the n × n exponential distance matrix of T. More generally, we give formulae for the multivariate arithmetic Tutte polynomials associated to the list of row vectors of these two matriceswhich shows that even the multivariate arithmetic Tutte polynomial is independent of the tree T. As a corollary, we get the Ehrhart polynomials of the following zonotopes: - ZEDT obtained from the rows of EDT and - ZLT obtained from the rows of LT. Further, we explicitly find the maximum volume ellipsoid contained in the zonotopes ZEDT, ZLT and show that the volume of these ellipsoids are again tree independent for fixed n, q. A similar result holds for the minimum volume ellipsoid containing these zonotopes.

scholarly journals Graphs, Links, and Duality on Surfaces

2010 ◽  
Vol 20 (2) ◽  
pp. 267-287 ◽  
Author(s):  
VYACHESLAV KRUSHKAL
Keyword(s):  
Planar Graphs ◽  
Jones Polynomial ◽  
Tutte Polynomial ◽  
Natural Duality ◽  
Polynomial Invariant ◽  
Topological Duality ◽  
Ribbon Graphs ◽  
Virtual Links ◽  
Graphs On Surfaces ◽  
Tutte Polynomials

We introduce a polynomial invariant of graphs on surfaces,PG, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result forPG, analogous to the duality for the Tutte polynomial of planar graphs. This property is important from the perspective of statistical mechanics, where the Tutte polynomial is known as the partition function of the Potts model. For ribbon graphs,PGspecializes to the well-known Bollobás–Riordan polynomial, and in fact the two polynomials carry equivalent information in this context. Duality is also established for a multivariate version of the polynomialPG. We then consider a 2-variable version of the Jones polynomial for links in thickened surfaces, taking into account homological information on the surface. An analogue of Thistlethwaite's theorem is established for these generalized Jones and Tutte polynomials for virtual links.

Quantum circuits for calculating the squared sum of the inner product of quantum states and its application

2019 ◽  
Vol 17 (05) ◽  
pp. 1950043
Author(s):  
Panchi Li ◽  
Jiahui Guo ◽  
Bing Wang ◽  
Mengqi Hao
Keyword(s):  
Quantum Circuit ◽  
Quantum States ◽  
Experimental Results ◽  
Quantum Circuits ◽  
Inner Product ◽  
Superposition State ◽  
Initial State ◽  
Control Rules ◽  
Control Qubit ◽  
Classical Computer

In this paper, we propose a quantum circuit for calculating the squared sum of the inner product of quantum states. The circuit is designed by the multi-qubits controlled-swapping gates, in which the initial state of each control qubit is [Formula: see text] and they are in the equilibrium superposition state after passing through some Hadamard gates. Then, according to the control rules, each basis state in the superposition state controls the corresponding quantum states pair to swap. Finally, the Hadamard gates are applied to the control qubits again, and the squared sum of the inner product of many pairs of quantum states can be obtained simultaneously by measuring only one control qubit. We investigate the application of this method in quantum images matching on a classical computer, and the experimental results verify the correctness of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document