PhD candidate at CWI
András studied mathematics and physics at the Eötvös Uiversity in Budapest, where he attained mathematical maturity, with the help of professors representing the traditional Hungarian mathematical school. Later he went to Cambridge to take the Part III of the Mathematical tripos, where he was introduced to the world of Quantum Computing by the lectures of Richard Jozsa. András also obtained practical knowledge about computing, he already developed commercial software during his high school studies. It enables him to back up his research with simulations — one of his recent projects were awarded 2nd prize at Microsoft’s Quantum Challange in 2016.
András investigates the possible speed-ups that are achievable on a quantum computer. Although there are a few well known quantum algorithms that expolits quantum effects, in fact the number of quantum algorithmic building blocks is quite limited. András is mainly working on quantum algorithms seeking new methods and novel approaches for achieving quantum supremacy.
(Microsoft Quantum Challange award winner entry:) https://github.com/StationQ/Liquid/blob/master/QuantumChallenge/QC_1/Testing_Quantum_State_Engineering_Protocols.pdf