Quantum Equivalence of the DLP and CDHP for Group Actions

12/21/2018
by   Steven Galbraith, et al.
0

In this short note we give a polynomial-time quantum reduction from the vectorization problem (DLP) to the parallelization problem (CDHP) for group actions. Combined with the trivial reduction from par-allelization to vectorization, we thus prove the quantum equivalence of both problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2023

Quantum Money from Abelian Group Actions

We give a candidate construction of public key quantum money, and even a...
research
05/15/2021

The equivalence between correctability of deletions and insertions of separable states in quantum codes

In this paper, we prove the equivalence of inserting separable quantum s...
research
06/11/2022

Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection

We define rewinding operators that invert quantum measurements. Then, we...
research
10/08/2020

Neural Group Actions

We introduce an algorithm for designing Neural Group Actions, collection...
research
04/25/2022

Online Simulation Reduction

We study the problem of simultaneously performing reachability analysis ...
research
06/05/2023

On the complexity of isomorphism problems for tensors, groups, and polynomials III: actions by classical groups

We study the complexity of isomorphism problems for d-way arrays, or ten...
research
09/23/2021

Quantum algorithms for group convolution, cross-correlation, and equivariant transformations

Group convolutions and cross-correlations, which are equivariant to the ...

Please sign up or login with your details

Forgot password? Click here to reset