@article{MTMT:32870379, title = {Subchannel Estimation and Subcarrier Detection for Multiuser Multicarrier Continuous-Variable Quantum Key Distribution}, url = {https://m2.mtmt.hu/api/publication/32870379}, author = {Gyöngyösi, László and Imre, Sándor}, journal-iso = {QUANTUM ENG}, journal = {QUANTUM ENGINEERING}, unique-id = {32870379}, year = {2024}, eissn = {2577-0470}, orcid-numbers = {Imre, Sándor/0000-0002-2883-8919} } @inproceedings{MTMT:33095015, title = {Problem solving dynamics for gate-model quantum computers}, url = {https://m2.mtmt.hu/api/publication/33095015}, author = {Gyöngyösi, László and Imre, Sándor}, booktitle = {Quantum Information Science, Sensing, and Computation XIV}, doi = {10.1117/12.2618654}, unique-id = {33095015}, abstract = {In the noisy intermediate-scale quantum technological setting, the computational steps in a quantum computer are realized via unitary gates. Gate-model quantum computer architectures can be realized in near-term experimental implementations. Here, we study the model of adaptive problem solving dynamics in gate-model quantum computers.}, keywords = {COMMUNICATION; Quantum computers; ATOMIC ENSEMBLES; Repeaters; Quantum Science & Technology; Optical Networks; Gate-model quantum computers}, year = {2022}, orcid-numbers = {Imre, Sándor/0000-0002-2883-8919} } @article{MTMT:33071695, title = {Adaptive Problem Solving Dynamics in Gate-Model Quantum Computers}, url = {https://m2.mtmt.hu/api/publication/33071695}, author = {Gyöngyösi, László}, doi = {10.3390/e24091196}, journal-iso = {ENTROPY-SWITZ}, journal = {ENTROPY}, volume = {24}, unique-id = {33071695}, abstract = {Gate-model quantum computer architectures represent an implementable model used to realize quantum computations. The mathematical description of the dynamical attributes of adaptive problem solving and iterative objective function evaluation in a gate-model quantum computer is currently a challenge. Here, a mathematical model of adaptive problem solving dynamics in a gate-model quantum computer is defined. We characterize a canonical equation of adaptive objective function evaluation of computational problems. We study the stability of adaptive problem solving in gate-model quantum computers.}, year = {2022}, eissn = {1099-4300} } @article{MTMT:33061540, title = {Advances in the quantum internet}, url = {https://m2.mtmt.hu/api/publication/33061540}, author = {Gyöngyösi, László and Imre, Sándor}, doi = {10.1145/3524455}, journal-iso = {COMMUN ACM}, journal = {COMMUNICATIONS OF THE ACM}, volume = {65}, unique-id = {33061540}, issn = {0001-0782}, year = {2022}, eissn = {1557-7317}, pages = {52-63}, orcid-numbers = {Imre, Sándor/0000-0002-2883-8919} } @article{MTMT:32871096, title = {Scalable Distributed Gate-Model Quantum Computers}, url = {https://m2.mtmt.hu/api/publication/32871096}, author = {Gyöngyösi, László}, journal-iso = {BULL AM PHYS SOC}, journal = {BULLETIN OF THE AMERICAN PHYSICAL SOCIETY}, volume = {67}, unique-id = {32871096}, issn = {0003-0503}, abstract = {A scalable model for a distributed quantum computation is a challenging problem due to the complexity of the problem space provided by the diversity of possible quantum systems, from small-scale quantum devices to large-scale quantum computers. Here, we define a model of scalable distributed gate-model quantum computation in near-term quantum systems of the NISQ (noisy intermediate scale quantum) technology era. We prove that the proposed architecture can maximize an objective function of a computational problem in a distributed manner. We study the impacts of decoherence on distributed objective function evaluation.}, year = {2022}, pages = {10-11} } @inproceedings{MTMT:32728847, title = {Resource optimization for the quantum Internet}, url = {https://m2.mtmt.hu/api/publication/32728847}, author = {Gyöngyösi, László and Imre, Sándor}, booktitle = {Quantum Computing, Communication, and Simulation II}, doi = {10.1117/12.2607957}, unique-id = {32728847}, abstract = {The quantum Internet enables networking based on the fundamentals of quantum mechanics. Here, we define methods and procedures of resource prioritization and resource balancing for the quantum Internet. The aim of the proposed solutions is to optimize the resource allocation mechanisms and to reduce the resource consumptions of the network entities.}, year = {2022}, orcid-numbers = {Imre, Sándor/0000-0002-2883-8919} } @article{MTMT:32403135, title = {Entanglement Availability Differentiation Service for the Quantum Internet (vol 8, 10620, 2018)}, url = {https://m2.mtmt.hu/api/publication/32403135}, author = {Gyöngyösi, László and Imre, Sándor}, doi = {10.1038/s41598-020-75950-5}, journal-iso = {SCI REP}, journal = {SCIENTIFIC REPORTS}, volume = {11}, unique-id = {32403135}, issn = {2045-2322}, abstract = {An amendment to this paper has been published and can be accessed via a link at the top of the paper.}, year = {2021}, eissn = {2045-2322}, orcid-numbers = {Imre, Sándor/0000-0002-2883-8919} } @article{MTMT:32331496, title = {Scalable distributed gate-model quantum computers}, url = {https://m2.mtmt.hu/api/publication/32331496}, author = {Gyöngyösi, László and Imre, Sándor}, doi = {10.1038/s41598-020-76728-5}, journal-iso = {SCI REP}, journal = {SCIENTIFIC REPORTS}, volume = {11}, unique-id = {32331496}, issn = {2045-2322}, abstract = {A scalable model for a distributed quantum computation is a challenging problem due to the complexity of the problem space provided by the diversity of possible quantum systems, from small-scale quantum devices to large-scale quantum computers. Here, we define a model of scalable distributed gate-model quantum computation in near-term quantum systems of the NISQ (noisy intermediate scale quantum) technology era. We prove that the proposed architecture can maximize an objective function of a computational problem in a distributed manner. We study the impacts of decoherence on distributed objective function evaluation.}, year = {2021}, eissn = {2045-2322}, orcid-numbers = {Imre, Sándor/0000-0002-2883-8919} } @article{MTMT:32210664, title = {Approximation Method for Optimization Problems in Gate-Model Quantum Computers}, url = {https://m2.mtmt.hu/api/publication/32210664}, author = {Gyöngyösi, László}, doi = {10.1016/j.csfx.2021.100066}, journal-iso = {CHAOS SOLITONS AND FRACTALS : X}, journal = {CHAOS SOLITONS AND FRACTALS : X}, volume = {7}, unique-id = {32210664}, issn = {2590-0544}, abstract = {In near-term quantum computers, the computations are realized via unitary operators. The optimization problem fed into the quantum computer sets an objective function that is to be estimated via several measurement rounds. Here, we define a procedure for objective function approximation in gate-model quantum computers. The proposed solution optimizes the process of objective function estimation for optimization problems in gate-model quantum computers and quantum devices.}, year = {2021} } @article{MTMT:32204289, title = {Post-processing optimization for continuous-variable quantum key distribution}, url = {https://m2.mtmt.hu/api/publication/32204289}, author = {Gyöngyösi, László}, doi = {10.1016/j.tcs.2021.08.023}, journal-iso = {THEOR COMPUT SCI}, journal = {THEORETICAL COMPUTER SCIENCE}, volume = {893}, unique-id = {32204289}, issn = {0304-3975}, abstract = {The performance of a continuous-variable quantum key distribution (CVQKD) protocol depends on the efficiency of the post-processing of measurement results. The post-processing methods extract statistical information from the raw data, establish the mutual knowledge between the parties, and produce a final key that provides absolute security. The post-processing phase is a bottleneck in CVQKD with crucial importance to the efficiency and protocol attributes. Post-processing uses the raw data of the parties generated by the quantum-level transmission and a classical authenticated channel to generate a secret key between the parties. The current reconciliation procedures require high-complexity coding with moderate resulting efficiency. Here we define an optimization method for post-processing in continuous-variable quantum key distribution. The reconciliation method achieves additive Gaussian noise on the random secret for arbitrarily low dimensional blocks. The model consumes all information from the raw data blocks to provide maximal efficiency and security via standard operations. The results can be realized by generic Gaussian coding schemes, allowing an easily implementation for experimental CVQKD protocols. © 2021 The Author(s)}, year = {2021}, eissn = {1879-2294}, pages = {146-158} }