Research All

All Research

Towards Large-scale Functional Verification of Universal Quantum Circuits

M. Amy

Quantum Physics and Logic (QPL 2018)

https://doi.org/10.4204/EPTCS.287.1
Quantum++: A modern C++ quantum computing library

Vlad Gheorghiu

PLoS ONE 13(12): e0208073 (2018)

https://doi.org/10.1371/journal.pone.0208073
A Finite Presentation of CNOT-Dihedral Operators

M. Amy, J. Chen, N. J. Ross

Quantum Physics and Logic (QPL 2017)

https://doi.org/10.4204/EPTCS.266.5
On the CNOT complexity of CNOT–phase circuits

M. Amy, P. Azimzadeh, M. Mosca

Quantum Science and Technology 4 (1) (2018)

https://doi.org/10.1088%2F2058-9565%2Faad8ca
Comparison of fault-tolerant thresholds for planar qudit geometries

Jacob Marks, Tomas J.-O'Connor and Vlad Gheorghiu

New Journal of Physics 19, 113022 (2017).

https://doi.org/10.1088/1367-2630/aa939a
Parallelizing quantum circuit synthesis

O. Di Matteo, M. Mosca

Quantum Science and Technology 1 (1) (2016)

http://iopscience.iop.org/article/10.1088/2058-9565/1/1/015003/meta
Technology mapping of reversible circuits to Clifford+T quantum circuits

N. Abdessaied, M. Amy, M. Soeken, R. Drechsler

https://infoscience.epfl.ch/record/216835
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3

M. Amy, O. Di Matteo, V. Gheorghiu, M. Mosca, A. Parent, J. Schanck

Select Areas in Cryptography (SAC'2016)

https://arxiv.org/abs/1603.09383
Complexity of reversible circuits and their quantum implementations

N. Abdessaied, M. Amy, R. Drechsler, M. Soeken

http://www.sciencedirect.com/science/article/pii/S0304397516000220
Verified compilation of space-efficient reversible circuits

M. Amy, M. Roetteler, K. Svore

Computer Aided Verification (CAV 2017)

https://doi.org/10.1007/978-3-319-63390-9_1
T-count optimization and Reed-Muller codes

M. Amy, M. Mosca

Accepted to IEEE Trans. Inf. Theory.

http://arxiv.org/abs/1601.07363
On the robustness of bucket brigade quantum RAM

S. Arunachalam, V. Gheorghiu, T. J.-O'Connor, M. Mosca and P. Varshinee Srinivasan

New Journal of Physics 17, 123010 (2015)

http://dx.doi.org/10.1088/1367-2630/17/12/123010
Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets

S. Forest, D. Gosset, V. Kliuchnikov, D. McKinnon http://arxiv.org/abs/1501.04944

Quantum++ - A C++11 quantum computing library

V. Gheorghiu

http://arxiv.org/abs/1412.4704
An algorithm for the T-count

D. Gosset, V. Kliuchnikov, M. Mosca, V. Russo. Quantum Info. Comput. 14 (15-16) 1261-1276 (2014)

http://dl.acm.org/citation.cfm?id=2685179.2685180
Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning

M. Amy, D. Maslov, M. Mosca IEEE Trans. Comput.-Aided Design Integr. Circuits Syst. 33 (10) 1476-1489 (2014)

http://dx.doi.org/10.1109/TCAD.2014.2341953
Asymptotically optimal topological quantum compiling

V. Kliuchnikov, A. Bocharov, K. M. Svore. Phys. Rev. Lett. 112 140504 (2014)

http://dx.doi.org/10.1103/PhysRevLett.112.140504
Optimization of Clifford circuits

V. Kliuchnikov, D. Maslov Phys. Rev. A 88 052307 (2013)

http://dx.doi.org/10.1103/PhysRevA.88.052307
Floating point representations in quantum circuit synthesis

N. Wiebe, V. Kliuchnikov. New J. Phys. 15 093041 (2013)

http://dx.doi.org/10.1088/1367-2630/15/9/093041
Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates

V. Kliuchnikov, D. Maslov, M. Mosca. Quantum Info. Comput. 13 (7-8) 607-630 (2013)

http://dl.acm.org/citation.cfm?id=2535653
Meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits

M. Amy, D. Maslov, M. Mosca, M. Roetteler. IEEE Trans. Comput.-Aided Design Integr. Circuits Syst. 32 (6) 818-828 (2013)

http://dx.doi.org/10.1109/TCAD.2013.2244643
Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits

V. Kliuchnikov, D. Maslov, M. Mosca Phys. Rev. Lett. 110 190502 (2013)

http://dx.doi.org/10.1103/PhysRevLett.110.190502
Synthesis of unitaries with Clifford+T circuits

V. Kliuchnikov

http://arxiv.org/abs/1306.3200
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits

V. Kliuchnikov, D. Maslov, M. Mosca

http://arxiv.org/abs/1212.6964