Possible quantum algorithm for the Lipshitz-Sarkar-Steenrod square for Khovanov homology

Author(s):  
Juan Ospina
2014 ◽  
Vol 7 (3) ◽  
pp. 817-848 ◽  
Author(s):  
Robert Lipshitz ◽  
Sucharit Sarkar

Author(s):  
Louis H. Kauffman ◽  
Igor Mikhailovich Nikonov ◽  
Eiji Ogasa

We discuss links in thickened surfaces. We define the Khovanov–Lipshitz–Sarkar stable homotopy type and the Steenrod square for the homotopical Khovanov homology of links in thickened surfaces with genus [Formula: see text]. A surface means a closed oriented surface unless otherwise stated. Of course, a surface may or may not be the sphere. A thickened surface means a product manifold of a surface and the interval. A link in a thickened surface (respectively, a 3-manifold) means a submanifold of a thickened surface (respectively, a 3-manifold) which is diffeomorphic to a disjoint collection of circles. Our Khovanov–Lipshitz–Sarkar stable homotopy type and our Steenrod square of links in thickened surfaces with genus [Formula: see text] are stronger than the homotopical Khovanov homology of links in thickened surfaces with genus [Formula: see text]. It is the first meaningful Khovanov–Lipshitz–Sarkar stable homotopy type of links in 3-manifolds other than the 3-sphere. We point out that our theory has a different feature in the torus case.


2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Yanbing Zhang ◽  
Tingting Song ◽  
Zhihao Wu

2020 ◽  
Vol 2020 (769) ◽  
pp. 87-119
Author(s):  
Sabin Cautis ◽  
Aaron D. Lauda ◽  
Joshua Sussan

AbstractRickard complexes in the context of categorified quantum groups can be used to construct braid group actions. We define and study certain natural deformations of these complexes which we call curved Rickard complexes. One application is to obtain deformations of link homologies which generalize those of Batson–Seed [3] [J. Batson and C. Seed, A link-splitting spectral sequence in Khovanov homology, Duke Math. J. 164 2015, 5, 801–841] and Gorsky–Hogancamp [E. Gorsky and M. Hogancamp, Hilbert schemes and y-ification of Khovanov–Rozansky homology, preprint 2017] to arbitrary representations/partitions. Another is to relate the deformed homology defined algebro-geometrically in [S. Cautis and J. Kamnitzer, Knot homology via derived categories of coherent sheaves IV, colored links, Quantum Topol. 8 2017, 2, 381–411] to categorified quantum groups (this was the original motivation for this paper).


2021 ◽  
Vol 26 ◽  
Author(s):  
T. Berry ◽  
J. Sharpe

Abstract This paper introduces and demonstrates the use of quantum computers for asset–liability management (ALM). A summary of historical and current practices in ALM used by actuaries is given showing how the challenges have previously been met. We give an insight into what ALM may be like in the immediate future demonstrating how quantum computers can be used for ALM. A quantum algorithm for optimising ALM calculations is presented and tested using a quantum computer. We conclude that the discovery of the strange world of quantum mechanics has the potential to create investment management efficiencies. This in turn may lead to lower capital requirements for shareholders and lower premiums and higher insured retirement incomes for policyholders.


2021 ◽  
Vol 2 (1) ◽  
pp. 1-35
Author(s):  
Adrien Suau ◽  
Gabriel Staffelbach ◽  
Henri Calandra

In the last few years, several quantum algorithms that try to address the problem of partial differential equation solving have been devised: on the one hand, “direct” quantum algorithms that aim at encoding the solution of the PDE by executing one large quantum circuit; on the other hand, variational algorithms that approximate the solution of the PDE by executing several small quantum circuits and making profit of classical optimisers. In this work, we propose an experimental study of the costs (in terms of gate number and execution time on a idealised hardware created from realistic gate data) associated with one of the “direct” quantum algorithm: the wave equation solver devised in [32]. We show that our implementation of the quantum wave equation solver agrees with the theoretical big-O complexity of the algorithm. We also explain in great detail the implementation steps and discuss some possibilities of improvements. Finally, our implementation proves experimentally that some PDE can be solved on a quantum computer, even if the direct quantum algorithm chosen will require error-corrected quantum chips, which are not believed to be available in the short-term.


Sign in / Sign up

Export Citation Format

Share Document