TY - JOUR AU - Morse, Gregory AU - Rybotycki, Tomasz AU - Kaposi, Ágoston AU - Kolarovszki, Zoltán AU - Stojčić, Uroš AU - Kozsik, Tamás AU - Mencer, Oskar AU - Oszmaniec, Michał AU - Zimborás, Zoltán AU - Rakyta, Péter TI - High performance Boson sampling simulation via data-flow engines JF - NEW JOURNAL OF PHYSICS J2 - NEW J PHYS VL - 26 PY - 2024 IS - 3 PG - 17 SN - 1367-2630 DO - 10.1088/1367-2630/ad313b UR - https://m2.mtmt.hu/api/publication/34750423 ID - 34750423 AB - Boson sampling (BS) is viewed to be an accessible quantum computing paradigm to demonstrate computational advantage compared to classical computers. In this context, the evolution of permanent calculation algorithms attracts a significant attention as the simulation of BS experiments involves the evaluation of vast number of permanents. For this reason, we generalize the Balasubramanian–Bax–Franklin–Glynn permanent formula, aiming to efficiently integrate it into the BS strategy of Clifford and Clifford (2020 Faster classical boson sampling). A reduction in simulation complexity originating from multiplicities in photon occupation was achieved through the incorporation of a n-ary Gray code ordering of the addends during the permanent evaluation. Implementing the devised algorithm on FPGA-based data-flow engines, we leverage the resulting tool to accelerate boson sampling simulations for up to 40 photons. Drawing samples from a 60-mode interferometer, the achieved rate averages around 80 s per sample, employing 4 FPGA chips. The developed design facilitates the simulation of both ideal and lossy boson sampling experiments. LA - English DB - MTMT ER - TY - JOUR AU - Rakyta, Péter AU - Morse, Gregory AU - Nádori, Jakab AU - Majnay-Takács, Zita AU - Mencer, Oskar AU - Zimborás, Zoltán TI - Highly optimized quantum circuits synthesized via data-flow engines JF - JOURNAL OF COMPUTATIONAL PHYSICS J2 - J COMPUT PHYS VL - 500 PY - 2024 PG - 12 SN - 0021-9991 DO - 10.1016/j.jcp.2024.112756 UR - https://m2.mtmt.hu/api/publication/33336748 ID - 33336748 N1 - Export Date: 07 March 2024; CODEN: JCTPA AB - The formulation of quantum programs in terms of the fewest number of gate operations is crucial to retrieve meaningful results from the noisy quantum processors accessible these days. In this work, we demonstrate a use-case for Field Programmable Gate Array (FPGA) based data-flow engines (DFEs) to scale up variational quantum compilers to synthesize circuits up to 9-qubit programs.This gate decomposer utilizes a newly developed DFE quantum computer simulator that is designed to simulate arbitrary quantum circuit consisting of single qubit rotations and controlled two-qubit gates on FPGA chips. In our benchmark with the QISKIT package, the depth of the circuits produced by the SQUANDER package (with the DFE accelerator support) were less by 97% on average, while the fidelity of the circuits was still close to unity up to an error of ∼10−4. LA - English DB - MTMT ER - TY - GEN AU - Morse, Gregory AU - Tomasz, Rybotycki AU - Kaposi, Ágoston AU - Kolarovszki, Zoltán AU - Uros, Stojic AU - Kozsik, Tamás AU - Oskar, Mencer AU - Michał, Oszmaniec AU - Zimborás, Zoltán AU - Rakyta, Péter TI - High performance Boson Sampling simulation via data-flow engines PY - 2023 PG - 25 UR - https://m2.mtmt.hu/api/publication/34139689 ID - 34139689 LA - English DB - MTMT ER - TY - JOUR AU - Morse, Gregory AU - Kozsik, Tamás AU - Rakyta, Péter TI - Minimal Path Delay Leading Zero Counters on Xilinx FPGAs JF - LECTURE NOTES IN COMPUTER SCIENCE J2 - LNCS VL - 10477 PY - 2023 SP - 626 EP - 640 PG - 15 SN - 0302-9743 DO - 10.1007/978-3-031-36024-4_48 UR - https://m2.mtmt.hu/api/publication/34053239 ID - 34053239 LA - English DB - MTMT ER - TY - JOUR AU - Zsurka, E. AU - Plaszkó, N. AU - Rakyta, Péter AU - Kormányos, Andor TI - Non-local Andreev reflection through Andreev molecular states in graphene Josephson junctions JF - 2D MATERIALS J2 - 2D MATER VL - 10 PY - 2023 IS - 3 PG - 10 SN - 2053-1583 DO - 10.1088/2053-1583/acce4b UR - https://m2.mtmt.hu/api/publication/33833875 ID - 33833875 N1 - Export Date: 8 April 2024 LA - English DB - MTMT ER - TY - JOUR AU - Péterfalvi, Csaba Géza AU - David, Alessandro AU - Rakyta, Péter AU - Burkard, Guido AU - Kormányos, Andor TI - Quantum interference tuning of spin-orbit coupling in twisted van der Waals trilayers JF - PHYSICAL REVIEW RESEARCH J2 - PRRESEARCH VL - 4 PY - 2022 IS - 2 PG - 8 SN - 2643-1564 DO - 10.1103/PhysRevResearch.4.L022049 UR - https://m2.mtmt.hu/api/publication/32907171 ID - 32907171 AB - We show that in van der Waals stacks of twisted hexagonal layers the proximity induced Rashba spin-orbit coupling can be affected by quantum interference. We calculate the quantum phase responsible for this effect in graphene-transition metal dichalcogenide bilayers as a function of interlayer twist angle. We show how this quantum phase affects the spin polarization of the graphene bands and discuss its potential effect on spin-to-charge conversion measurements. In twisted trilayers symmetries can be broken as well as restored for certain twist angles. This can be used to deduce the effects of induced spin-orbit coupling on spin-lifetime anisotropy and magnetoconductance measurements. LA - English DB - MTMT ER - TY - JOUR AU - Rakyta, Péter AU - Kaposi, Ágoston AU - Kolarovszki, Zoltán AU - Kozsik, Tamás AU - Zimborás, Zoltán TI - Simulation of Photonic Quantum Computers Enhanced by Data-Flow Engines JF - ERCIM NEWS J2 - ERCIM NEWS PY - 2022 IS - 128 SP - 17 EP - 18 PG - 2 SN - 0926-4981 UR - https://m2.mtmt.hu/api/publication/32836965 ID - 32836965 N1 - Funding Agency and Grant Number: Ministry of Innovation and Technology; National Research, Development and Innovation Office within the Quantum Information National Laboratory of Hungary Funding text: This project has received funding from the Ministry of Innovation and Technology and the National Research, Development and Innovation Office within the Quantum Information National Laboratory of Hungary. LA - English DB - MTMT ER - TY - GEN AU - Rakyta, Péter AU - Zimborás, Zoltán TI - Efficient quantum gate decomposition via adaptive circuit compression PY - 2022 PG - 13 UR - https://m2.mtmt.hu/api/publication/32735724 ID - 32735724 LA - English DB - MTMT ER - TY - JOUR AU - Rakyta, Péter AU - Zimborás, Zoltán TI - Approaching the theoretical limit in quantum gate decomposition JF - QUANTUM J2 - QUANTUM-AUSTRIA VL - 6 PY - 2022 PG - 14 SN - 2521-327X DO - 10.22331/Q-2022-05-11-710 UR - https://m2.mtmt.hu/api/publication/32711399 ID - 32711399 AB - In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns out that $15$ and $63$ $CNOT$ gates are sufficient to decompose a general $3$- and $4$-qubit unitary, respectively. This is currently the lowest achieved gate count compared to other algorithms. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition. In addition, the algorithm can be adopted to sparse inter-qubit connectivity architectures provided by current mid-scale quantum computers, needing only a few additional $CNOT$ gates to be implemented in the resulting quantum circuits. LA - English DB - MTMT ER - TY - GEN AU - Kaposi, Ágoston AU - Kolarovszki, Zoltán AU - Kozsik, Tamás AU - Zimborás, Zoltán AU - Rakyta, Péter TI - Polynomial speedup in Torontonian calculation by a scalable recursive algorithm PY - 2021 PG - 13 UR - https://m2.mtmt.hu/api/publication/32576995 ID - 32576995 LA - English DB - MTMT ER -