1
|
Gyongyosi L, Imre S. Scalable distributed gate-model quantum computers. Sci Rep 2021; 11:5172. [PMID: 33637770 PMCID: PMC7910494 DOI: 10.1038/s41598-020-76728-5] [Citation(s) in RCA: 16] [Impact Index Per Article: 5.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/18/2020] [Accepted: 10/30/2020] [Indexed: 11/08/2022] Open
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.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, 1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, 1051, Hungary.
| | - Sandor Imre
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, 1117, Hungary
| |
Collapse
|
2
|
Gyongyosi L, Imre S. Resource prioritization and balancing for the quantum internet. Sci Rep 2020; 10:22390. [PMID: 33372180 PMCID: PMC7770047 DOI: 10.1038/s41598-020-78960-5] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/23/2020] [Accepted: 12/02/2020] [Indexed: 11/21/2022] Open
Abstract
The quantum Internet enables networking based on the fundamentals of quantum mechanics. Here, methods and procedures of resource prioritization and resource balancing are defined for the quantum Internet. We define a model for resource consumption optimization in quantum repeaters, and a strongly-entangled network structure for resource balancing. We study the resource-balancing efficiency of the strongly-entangled structure. We prove that a strongly-entangled quantum network is two times more efficient in a resource balancing problem than a full-mesh network of the traditional Internet.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, 1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, 1051, Hungary.
| | - Sandor Imre
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, 1117, Hungary
| |
Collapse
|
3
|
Alhumaima RS, Alwan ST, Ahmed RK. Mitigating X2‐AP interface cost using quantum teleportation. IET NETWORKS 2020. [DOI: 10.1049/iet-net.2019.0230] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
Affiliation(s)
- Raad S. Alhumaima
- Department of CommunicationsCollege of EngineeringUniversity of DiyalaDiyalaIraq
| | - Saib Thiab Alwan
- Department of MaterialsCollege of EngineeringUniversity of DiyalaDiyalaIraq
| | - Riyadh Khlf Ahmed
- Department of CommunicationsCollege of EngineeringUniversity of DiyalaDiyalaIraq
| |
Collapse
|
4
|
Gyongyosi L. Objective function estimation for solving optimization problems in gate-model quantum computers. Sci Rep 2020; 10:14220. [PMID: 32848174 PMCID: PMC7450069 DOI: 10.1038/s41598-020-71007-9] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/13/2020] [Accepted: 07/09/2020] [Indexed: 01/03/2023] Open
Abstract
Quantum computers provide a valuable resource to solve computational problems. The maximization of the objective function of a computational problem is a crucial problem in gate-model quantum computers. The objective function estimation is a high-cost procedure that requires several rounds of quantum computations and measurements. Here, we define a method for objective function estimation of arbitrary computational problems in gate-model quantum computers. The proposed solution significantly reduces the costs of the objective function estimation and provides an optimized estimate of the state of the quantum computer for solving optimization problems.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, 1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, 1051, Hungary.
| |
Collapse
|
5
|
Gyongyosi L. Dynamics of entangled networks of the quantum Internet. Sci Rep 2020; 10:12909. [PMID: 32737328 PMCID: PMC7395178 DOI: 10.1038/s41598-020-68498-x] [Citation(s) in RCA: 10] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/16/2020] [Accepted: 06/26/2020] [Indexed: 11/23/2022] Open
Abstract
Entangled quantum networks are a fundamental of any global-scale quantum Internet. Here, a mathematical model is developed to quantify the dynamics of entangled network structures and entanglement flow in the quantum Internet. The analytical solutions of the model determine the equilibrium states of the entangled quantum networks and characterize the stability, fluctuation attributes, and dynamics of entanglement flow in entangled network structures. We demonstrate the results of the model through various entangled structures and quantify the dynamics.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, 1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, 1051, Hungary.
| |
Collapse
|
6
|
Gyongyosi L, Imre S. Routing space exploration for scalable routing in the quantum Internet. Sci Rep 2020; 10:11874. [PMID: 32681034 PMCID: PMC7367878 DOI: 10.1038/s41598-020-68354-y] [Citation(s) in RCA: 11] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/26/2019] [Accepted: 06/19/2020] [Indexed: 11/09/2022] Open
Abstract
The entangled network structure of the quantum Internet formulates a high complexity routing space that is hard to explore. Scalable routing is a routing method that can determine an optimal routing at particular subnetwork conditions in the quantum Internet to perform a high-performance and low-complexity routing in the entangled structure. Here, we define a method for routing space exploration and scalable routing in the quantum Internet. We prove that scalable routing allows a compact and efficient routing in the entangled networks of the quantum Internet.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, 1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, 1051, Hungary.
| | - Sandor Imre
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, 1117, Hungary
| |
Collapse
|
7
|
Gyongyosi L, Imre S. Circuit Depth Reduction for Gate-Model Quantum Computers. Sci Rep 2020; 10:11229. [PMID: 32641766 PMCID: PMC7343887 DOI: 10.1038/s41598-020-67014-5] [Citation(s) in RCA: 19] [Impact Index Per Article: 4.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/19/2019] [Accepted: 05/13/2020] [Indexed: 11/18/2022] Open
Abstract
Quantum computers utilize the fundamentals of quantum mechanics to solve computational problems more efficiently than traditional computers. Gate-model quantum computers are fundamental to implement near-term quantum computer architectures and quantum devices. Here, a quantum algorithm is defined for the circuit depth reduction of gate-model quantum computers. The proposed solution evaluates the reduced time complexity equivalent of a reference quantum circuit. We prove the complexity of the quantum algorithm and the achievable reduction in circuit depth. The method provides a tractable solution to reduce the time complexity and physical layer costs of quantum computers.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, H-1051, Hungary.
| | - Sandor Imre
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary
| |
Collapse
|
8
|
Gyongyosi L. Unsupervised Quantum Gate Control for Gate-Model Quantum Computers. Sci Rep 2020; 10:10701. [PMID: 32612113 PMCID: PMC7329862 DOI: 10.1038/s41598-020-67018-1] [Citation(s) in RCA: 11] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/23/2020] [Accepted: 05/11/2020] [Indexed: 12/03/2022] Open
Abstract
In near-term quantum computers, the operations are realized by unitary quantum gates. The precise and stable working mechanism of quantum gates is essential for the implementation of any complex quantum computations. Here, we define a method for the unsupervised control of quantum gates in near-term quantum computers. We model a scenario in which a tensor product structure of non-stable quantum gates is not controllable in terms of control theory. We prove that the non-stable quantum gate becomes controllable via a machine learning method if the quantum gates formulate an entangled gate structure.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, H-1051, Hungary.
| |
Collapse
|
9
|
Gyongyosi L. Quantum State Optimization and Computational Pathway Evaluation for Gate-Model Quantum Computers. Sci Rep 2020; 10:4543. [PMID: 32161308 PMCID: PMC7066182 DOI: 10.1038/s41598-020-61316-4] [Citation(s) in RCA: 19] [Impact Index Per Article: 4.8] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/21/2019] [Accepted: 02/25/2020] [Indexed: 11/09/2022] Open
Abstract
A computational problem fed into a gate-model quantum computer identifies an objective function with a particular computational pathway (objective function connectivity). The solution of the computational problem involves identifying a target objective function value that is the subject to be reached. A bottleneck in a gate-model quantum computer is the requirement of several rounds of quantum state preparations, high-cost run sequences, and multiple rounds of measurements to determine a target (optimal) state of the quantum computer that achieves the target objective function value. Here, we define a method for optimal quantum state determination and computational path evaluation for gate-model quantum computers. We prove a state determination method that finds a target system state for a quantum computer at a given target objective function value. The computational pathway evaluation procedure sets the connectivity of the objective function in the target system state on a fixed hardware architecture of the quantum computer. The proposed solution evolves the target system state without requiring the preparation of intermediate states between the initial and target states of the quantum computer. Our method avoids high-cost system state preparations and expensive running procedures and measurement apparatuses in gate-model quantum computers. The results are convenient for gate-model quantum computations and the near-term quantum devices of the quantum Internet.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, H-1051, Hungary.
| |
Collapse
|
10
|
Gyongyosi L, Imre S. Optimizing High-Efficiency Quantum Memory with Quantum Machine Learning for Near-Term Quantum Devices. Sci Rep 2020; 10:135. [PMID: 31924814 PMCID: PMC6954268 DOI: 10.1038/s41598-019-56689-0] [Citation(s) in RCA: 28] [Impact Index Per Article: 7.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/30/2019] [Accepted: 12/12/2019] [Indexed: 11/09/2022] Open
Abstract
Quantum memories are a fundamental of any global-scale quantum Internet, high-performance quantum networking and near-term quantum computers. A main problem of quantum memories is the low retrieval efficiency of the quantum systems from the quantum registers of the quantum memory. Here, we define a novel quantum memory called high-retrieval-efficiency (HRE) quantum memory for near-term quantum devices. An HRE quantum memory unit integrates local unitary operations on its hardware level for the optimization of the readout procedure and utilizes the advanced techniques of quantum machine learning. We define the integrated unitary operations of an HRE quantum memory, prove the learning procedure, and evaluate the achievable output signal-to-noise ratio values. We prove that the local unitaries of an HRE quantum memory achieve the optimization of the readout procedure in an unsupervised manner without the use of any labeled data or training sequences. We show that the readout procedure of an HRE quantum memory is realized in a completely blind manner without any information about the input quantum system or about the unknown quantum operation of the quantum register. We evaluate the retrieval efficiency of an HRE quantum memory and the output SNR (signal-to-noise ratio). The results are particularly convenient for gate-model quantum computers and the near-term quantum devices of the quantum Internet.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, H-1051, Hungary.
| | - Sandor Imre
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary
| |
Collapse
|
11
|
Gyongyosi L, Imre S. Training Optimization for Gate-Model Quantum Neural Networks. Sci Rep 2019; 9:12679. [PMID: 31481737 PMCID: PMC6722103 DOI: 10.1038/s41598-019-48892-w] [Citation(s) in RCA: 20] [Impact Index Per Article: 4.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/24/2018] [Accepted: 08/15/2019] [Indexed: 11/13/2022] Open
Abstract
Gate-based quantum computations represent an essential to realize near-term quantum computer architectures. A gate-model quantum neural network (QNN) is a QNN implemented on a gate-model quantum computer, realized via a set of unitaries with associated gate parameters. Here, we define a training optimization procedure for gate-model QNNs. By deriving the environmental attributes of the gate-model quantum network, we prove the constraint-based learning models. We show that the optimal learning procedures are different if side information is available in different directions, and if side information is accessible about the previous running sequences of the gate-model QNN. The results are particularly convenient for gate-model quantum computer implementations.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, H-1051, Hungary.
| | - Sandor Imre
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary
| |
Collapse
|
12
|
Abstract
Quantum measurement is a fundamental cornerstone of experimental quantum computations. The main issues in current quantum measurement strategies are the high number of measurement rounds to determine a global optimal measurement output and the low success probability of finding a global optimal measurement output. Each measurement round requires preparing the quantum system and applying quantum operations and measurements with high-precision control in the physical layer. These issues result in extremely high-cost measurements with a low probability of success at the end of the measurement rounds. Here, we define a novel measurement for quantum computations called dense quantum measurement. The dense measurement strategy aims at fixing the main drawbacks of standard quantum measurements by achieving a significant reduction in the number of necessary measurement rounds and by radically improving the success probabilities of finding global optimal outputs. We provide application scenarios for quantum circuits with arbitrary unitary sequences, and prove that dense measurement theory provides an experimentally implementable solution for gate-model quantum computer architectures.
Collapse
|
13
|
Gyongyosi L, Imre S. Opportunistic Entanglement Distribution for the Quantum Internet. Sci Rep 2019; 9:2219. [PMID: 30778094 PMCID: PMC6379403 DOI: 10.1038/s41598-019-38495-w] [Citation(s) in RCA: 29] [Impact Index Per Article: 5.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/03/2018] [Accepted: 12/31/2018] [Indexed: 11/10/2022] Open
Abstract
Quantum entanglement is a building block of the entangled quantum networks of the quantum Internet. A fundamental problem of the quantum Internet is entanglement distribution. Since quantum entanglement will be fundamental to any future quantum networking scenarios, the distribution mechanism of quantum entanglement is a critical and emerging issue in quantum networks. Here we define the method of opportunistic entanglement distribution for the quantum Internet. The opportunistic model defines distribution sets that are aimed to select those quantum nodes for which the cost function picks up a local minimum. The cost function utilizes the error patterns of the local quantum memories and the predictability of the evolution of the entanglement fidelities. Our method provides efficient entanglement distributing with respect to the actual statuses of the local quantum memories of the node pairs. The model provides an easily-applicable, moderate-complexity solution for high-fidelity entanglement distribution in experimental quantum Internet scenarios.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, H-1051, Hungary.
| | - Sandor Imre
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary
| |
Collapse
|
14
|
Gyongyosi L, Imre S. Multilayer Optimization for the Quantum Internet. Sci Rep 2018; 8:12690. [PMID: 30140031 PMCID: PMC6107661 DOI: 10.1038/s41598-018-30957-x] [Citation(s) in RCA: 26] [Impact Index Per Article: 4.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/28/2017] [Accepted: 08/06/2018] [Indexed: 01/05/2023] Open
Abstract
We define a multilayer optimization method for the quantum Internet. Multilayer optimization integrates separate procedures for the optimization of the quantum layer and the classical layer of the quantum Internet. The multilayer optimization procedure defines advanced techniques for the optimization of the layers. The optimization of the quantum layer covers the minimization of total usage time of quantum memories in the quantum nodes, the maximization of the entanglement throughput over the entangled links, and the reduction of the number of entangled links between the arbitrary source and target quantum nodes. The objective of the optimization of the classical layer is the cost minimization of any auxiliary classical communications. The multilayer optimization framework provides a practically implementable tool for quantum network communications, or long-distance quantum communications.
Collapse
Affiliation(s)
- Laszlo Gyongyosi
- School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK.
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary.
- MTA-BME Information Systems Research Group, Hungarian Academy of Sciences, Budapest, H-1051, Hungary.
| | - Sandor Imre
- Department of Networked Systems and Services, Budapest University of Technology and Economics, Budapest, H-1117, Hungary
| |
Collapse
|