English
Related papers

Related papers: Fault-tolerant mosaic encoding in knot-based crypt…

200 papers

Mosaic tiles were first introduced by Lomonaco and Kauffman in 2008 to describe quantum knots, and have since been studied for their own right. Using a modified set of tiles, front projections of Legendrian knots can be built from mosaics…

Geometric Topology · Mathematics 2025-10-14 Margaret Kipe , Samantha Pezzimenti , Leif Schaumann , Luc Ta , Wing Hong Tony Wong

Distributed computing systems are well-known to suffer from the problem of slow or failed nodes; these are referred to as stragglers. Straggler mitigation (for distributed matrix computations) has recently been investigated from the…

Information Theory · Computer Science 2024-12-20 Anindya Bijoy Das , Aditya Ramamoorthy

Reducing space and time overheads of fault-tolerant quantum computation (FTQC) has been receiving increasing attention as it is crucial for the development of quantum computers and also plays a fundamental role in understanding the…

Quantum Physics · Physics 2025-08-14 Yugo Takada , Hayata Yamasaki

Surface codes are a popular choice for implementing fault-tolerant quantum computing. Two-qubit gates may be realised in these codes using only nearest-neighbour interactions, either by lattice surgery or by braiding defects around each…

Quantum Physics · Physics 2025-08-21 Mateusz Kupper , Dominic Horsman , Chris Heunen , Niel de Beaudrap

The art of tying knots is exploited in nature and occurs in multiple applications ranging from being an essential part of scouting programs to engineering molecular knots. Biomolecular knots, such as knotted proteins, bear various cellular…

Biological Physics · Physics 2021-06-09 Anatoly Golovnev , Alireza Mashaghi

Large-degree polynomial multiplication is an integral component of post-quantum secure lattice-based cryptographic algorithms like CRYSTALS-Kyber and Dilithium. The computational complexity of large-degree polynomial multiplication can be…

Hardware Architecture · Computer Science 2023-11-09 Suraj Mandal , Debapriya Basu Roy

Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at…

Combinatorics · Mathematics 2017-10-19 Carolina Medina , Jorge Ramírez-Alfonsín , Gelasio Salazar

In this paper, network error control coding is studied for robust and efficient multicast in a directed acyclic network with imperfect links. The block network error control coding framework, BNEC, is presented and the capability of the…

Information Theory · Computer Science 2008-09-25 Hossein Bahramgiri , Farshad Lahouti

Quantum error correction and fault-tolerance make it possible to perform quantum computations in the presence of imprecision and imperfections of realistic devices. An important question is to find the noise rate at which errors can be…

Quantum Physics · Physics 2016-06-30 Christopher Chamberland , Tomas Jochym-O'Connor , Raymond Laflamme

Proteins are linear molecular chains that often fold to function. The topology of folding is widely believed to define its properties and function, and knot theory has been applied to study protein structure and its implications. More that…

Geometric Topology · Mathematics 2020-07-13 Colin Adams , Judah Devadoss , Mohamed Elhamdadi , Alireza Mashaghi

A secure and reliable image encryption scheme is presented in this study. The encryption scheme hereby introduces a novel chaotic log-map, deep convolution neural network (CNN) model for key generation, and bit reversion operation for the…

Information Theory · Computer Science 2022-02-01 Uğur Erkan , Abdurrahim Toktas , Serdar Enginoğlu , Enver Karabacak , Dang N. H. Thanh

We compare two different implementations of fault-tolerant entangling gates on logical qubits. In one instance, a twelve-qubit trapped-ion quantum computer is used to implement a non-transversal logical CNOT gate between two five qubit…

We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based…

Quantum Physics · Physics 2011-08-31 Andrew J. Landahl , Jonas T. Anderson , Patrick R. Rice

We propose an easy implementable prepare-and-measure protocol for robust quantum key distribution with photon polarization. The protocol is fault tolerant against collective random unitary channel noise. The protocol does not need any…

Quantum Physics · Physics 2009-11-10 X. B. Wang

This dissertation considers new constructions and decoding approaches for error-correcting codes based on non-conventional polynomials, with the objective of providing new coding solutions to the applications mentioned above. With skew…

Information Theory · Computer Science 2025-01-08 Hedongliang Liu

Small interconnected quantum processors can collaborate to tackle quantum computational problems that typically demand more capable devices. These linked processors, referred to as quantum nodes, can use shared entangled states to execute…

Quantum Physics · Physics 2024-08-26 Lars Talsma , Álvaro G. Iñesta , Stephanie Wehner

Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate. To recover multiple…

Information Theory · Computer Science 2019-05-13 Ronald Cramer , Chaoping Xing , Chen Yuan

We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…

Geometric Topology · Mathematics 2020-11-02 Sergei Gukov , James Halverson , Fabian Ruehle , Piotr Sułkowski

Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators do not couple physical subsystems within the same code block.…

Quantum Physics · Physics 2009-11-13 Bryan Eastin , Emanuel Knill

The Morse-Novikov number MN(L) of a smooth link L in the three-dimensional sphere is by definition the minimal possible number of critical points of a regular circle-valued Morse function on the link complement (the term regular means that…

Geometric Topology · Mathematics 2007-05-23 Hiroshi Goda , Andrei V. Pajitnov