@article{MTMT:34750423,
	title = {High performance Boson sampling simulation via data-flow engines},
	url = {https://m2.mtmt.hu/api/publication/34750423},
	author = {Morse, Gregory and Rybotycki, Tomasz and Kaposi, Ágoston and Kolarovszki, Zoltán and Stojčić, Uroš and Kozsik, Tamás and Mencer, Oskar and Oszmaniec, Michał and Zimborás, Zoltán and Rakyta, Péter},
	doi = {10.1088/1367-2630/ad313b},
	journal-iso = {NEW J PHYS},
	journal = {NEW JOURNAL OF PHYSICS},
	volume = {26},
	unique-id = {34750423},
	issn = {1367-2630},
	abstract = {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.},
	year = {2024},
	eissn = {1367-2630},
	orcid-numbers = {Morse, Gregory/0000-0002-0231-6557; Kozsik, Tamás/0000-0003-4484-9172; Rakyta, Péter/0000-0002-3506-558X}
}

@article{MTMT:33336748,
	title = {Highly optimized quantum circuits synthesized via data-flow engines},
	url = {https://m2.mtmt.hu/api/publication/33336748},
	author = {Rakyta, Péter and Morse, Gregory and Nádori, Jakab and Majnay-Takács, Zita and Mencer, Oskar and Zimborás, Zoltán},
	doi = {10.1016/j.jcp.2024.112756},
	journal-iso = {J COMPUT PHYS},
	journal = {JOURNAL OF COMPUTATIONAL PHYSICS},
	volume = {500},
	unique-id = {33336748},
	issn = {0021-9991},
	abstract = {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.},
	year = {2024},
	eissn = {1090-2716},
	orcid-numbers = {Rakyta, Péter/0000-0002-3506-558X; Morse, Gregory/0000-0002-0231-6557}
}

@misc{MTMT:34139689,
	title = {High performance Boson Sampling simulation via data-flow engines},
	url = {https://m2.mtmt.hu/api/publication/34139689},
	author = {Morse, Gregory and Tomasz, Rybotycki and Kaposi, Ágoston and Kolarovszki, Zoltán and Uros, Stojic and Kozsik, Tamás and Oskar, Mencer and Michał, Oszmaniec and Zimborás, Zoltán and Rakyta, Péter},
	unique-id = {34139689},
	year = {2023},
	orcid-numbers = {Morse, Gregory/0000-0002-0231-6557; Kozsik, Tamás/0000-0003-4484-9172; Rakyta, Péter/0000-0002-3506-558X}
}

@article{MTMT:34053239,
	title = {Minimal Path Delay Leading Zero Counters on Xilinx FPGAs},
	url = {https://m2.mtmt.hu/api/publication/34053239},
	author = {Morse, Gregory and Kozsik, Tamás and Rakyta, Péter},
	doi = {10.1007/978-3-031-36024-4_48},
	journal-iso = {LNCS},
	journal = {LECTURE NOTES IN COMPUTER SCIENCE},
	volume = {10477},
	unique-id = {34053239},
	issn = {0302-9743},
	year = {2023},
	eissn = {1611-3349},
	pages = {626-640},
	orcid-numbers = {Morse, Gregory/0000-0002-0231-6557; Kozsik, Tamás/0000-0003-4484-9172; Rakyta, Péter/0000-0002-3506-558X}
}

@article{MTMT:33833875,
	title = {Non-local Andreev reflection through Andreev molecular states in graphene Josephson junctions},
	url = {https://m2.mtmt.hu/api/publication/33833875},
	author = {Zsurka, E. and Plaszkó, N. and Rakyta, Péter and Kormányos, Andor},
	doi = {10.1088/2053-1583/acce4b},
	journal-iso = {2D MATER},
	journal = {2D MATERIALS},
	volume = {10},
	unique-id = {33833875},
	issn = {2053-1583},
	year = {2023},
	eissn = {2053-1583},
	orcid-numbers = {Rakyta, Péter/0000-0002-3506-558X; Kormányos, Andor/0000-0002-6837-6966}
}

@article{MTMT:32907171,
	title = {Quantum interference tuning of spin-orbit coupling in twisted van der Waals trilayers},
	url = {https://m2.mtmt.hu/api/publication/32907171},
	author = {Péterfalvi, Csaba Géza and David, Alessandro and Rakyta, Péter and Burkard, Guido and Kormányos, Andor},
	doi = {10.1103/PhysRevResearch.4.L022049},
	journal-iso = {PRRESEARCH},
	journal = {PHYSICAL REVIEW RESEARCH},
	volume = {4},
	unique-id = {32907171},
	abstract = {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.},
	year = {2022},
	eissn = {2643-1564},
	orcid-numbers = {Péterfalvi, Csaba Géza/0000-0002-7723-9445; Rakyta, Péter/0000-0002-3506-558X; Kormányos, Andor/0000-0002-6837-6966}
}

@article{MTMT:32836965,
	title = {Simulation of Photonic Quantum Computers Enhanced by Data-Flow Engines},
	url = {https://m2.mtmt.hu/api/publication/32836965},
	author = {Rakyta, Péter and Kaposi, Ágoston and Kolarovszki, Zoltán and Kozsik, Tamás and Zimborás, Zoltán},
	journal-iso = {ERCIM NEWS},
	journal = {ERCIM NEWS},
	unique-id = {32836965},
	issn = {0926-4981},
	year = {2022},
	eissn = {1564-0094},
	pages = {17-18},
	orcid-numbers = {Rakyta, Péter/0000-0002-3506-558X; Kozsik, Tamás/0000-0003-4484-9172}
}

@misc{MTMT:32735724,
	title = {Efficient quantum gate decomposition via adaptive circuit compression},
	url = {https://m2.mtmt.hu/api/publication/32735724},
	author = {Rakyta, Péter and Zimborás, Zoltán},
	unique-id = {32735724},
	keywords = {quantum physics},
	year = {2022},
	orcid-numbers = {Rakyta, Péter/0000-0002-3506-558X}
}

@article{MTMT:32711399,
	title = {Approaching the theoretical limit in quantum gate decomposition},
	url = {https://m2.mtmt.hu/api/publication/32711399},
	author = {Rakyta, Péter and Zimborás, Zoltán},
	doi = {10.22331/Q-2022-05-11-710},
	journal-iso = {QUANTUM-AUSTRIA},
	journal = {QUANTUM},
	volume = {6},
	unique-id = {32711399},
	issn = {2521-327X},
	abstract = {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.},
	keywords = {quantum physics; Quantum Science & Technology},
	year = {2022},
	eissn = {2521-327X},
	orcid-numbers = {Rakyta, Péter/0000-0002-3506-558X}
}

@misc{MTMT:32576995,
	title = {Polynomial speedup in Torontonian calculation by a scalable recursive algorithm},
	url = {https://m2.mtmt.hu/api/publication/32576995},
	author = {Kaposi, Ágoston and Kolarovszki, Zoltán and Kozsik, Tamás and Zimborás, Zoltán and Rakyta, Péter},
	unique-id = {32576995},
	year = {2021},
	orcid-numbers = {Kozsik, Tamás/0000-0003-4484-9172; Rakyta, Péter/0000-0002-3506-558X}
}