{"version":"1.0","provider_name":"Microsoft Research","provider_url":"https:\/\/www.microsoft.com\/en-us\/research","author_name":"Martin Roetteler","author_url":"https:\/\/www.microsoft.com\/en-us\/research\/people\/martinro\/","title":"Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity - Microsoft Research","type":"rich","width":600,"height":338,"html":"
Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity<\/a><\/blockquote>