In-place implementation of Quantum-Gimli

07/13/2020
by   Lars Schlieper, et al.
0

We present an in-place implementation of the Gimli permutation, a NIST round 2 candidate for lightweight cryptography and provide an upper bound for the required quantum resource in depth and gate-counts. In particular, we do not use any ancilla bits and the state that our circuit produces is not entangled with any input, which offers further freedom in the usability and allows for a widespread use in different applications in a plug-and-play manner.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/01/2021

An upper bound on the Universality of the Quantum Approximate Optimization Algorithm

Using lie algebra, this brief text provides an upper bound on the univer...
09/29/2021

Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes

In this work we establish lower bounds on the size of Clifford circuits ...
08/31/2020

Rotational analysis of ChaCha permutation

We show that the underlying permutation of ChaCha20 stream cipher does n...
06/06/2020

Lowering the T-depth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic Networks

The multiplicative depth of a logic network over the gate basis {, ⊕, } ...
07/01/2020

Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions

The standard circuit model for quantum computation presumes the ability ...
03/19/2022

A Quantum Algorithm for Network Reliability

Building a network that is resilient to a component failure is vital. Ou...
04/24/2019

Circuit Relations for Real Stabilizers: Towards TOF+H

The real stabilizer fragment of quantum mechanics was shown to have a co...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.