Browse
Submit Data
Databases
API
Help

Dataset Information

27 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Scalable distributed gate-model quantum computers.

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.

SUBMITTER: Gyongyosi L

PROVIDER: S-EPMC7910494 | biostudies-literature | 2021 Feb

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Scalable distributed gate-model quantum computers.

Gyongyosi Laszlo L Imre Sandor S

Scientific reports 20210226 1

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 comp ...[more]

PMID: 33637770

Similar Datasets

Unsupervised Quantum Gate Control for Gate-Model Quantum Computers.

Project description: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.

| S-EPMC7329862 | biostudies-literature

Quantum State Optimization and Computational Pathway Evaluation for Gate-Model Quantum Computers.

Project description: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.

| S-EPMC7066182 | biostudies-literature

Objective function estimation for solving optimization problems in gate-model quantum computers.

Project description: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.

| S-EPMC7450069 | biostudies-literature

Algorithmic cooling and scalable NMR quantum computers.

Project description:We present here algorithmic cooling (via polarization heat bath)-a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by using a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented by using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Interestingly, the interaction with the environment, usually a most undesired interaction, is used here to our benefit, allowing a cooling mechanism. Cooling spins to a very low temperature without cooling the environment could lead to a breakthrough in NMR experiments, and our "spin-refrigerating" method suggests that this is possible. The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices, and our spin-refrigerating method suggests that this problem can be resolved.

| S-EPMC122533 | biostudies-literature

Nuclear shell-model simulation in digital quantum computers.

Project description:The nuclear shell model is one of the prime many-body methods to study the structure of atomic nuclei, but it is hampered by an exponential scaling on the basis size as the number of particles increases. We present a shell-model quantum circuit design strategy to find nuclear ground states by exploiting an adaptive variational quantum eigensolver algorithm. Our circuit implementation is in excellent agreement with classical shell-model simulations for a dozen of light and medium-mass nuclei, including neon and calcium isotopes. We quantify the circuit depth, width and number of gates to encode realistic shell-model wavefunctions. Our strategy also addresses explicitly energy measurements and the required number of circuits to perform them. Our simulated circuits approach the benchmark results exponentially with a polynomial scaling in quantum resources for each nucleus. This work paves the way for quantum computing shell-model studies across the nuclear chart and our quantum resource quantification may be used in configuration-interaction calculations of other fermionic systems.

| S-EPMC10387092 | biostudies-literature

Localized Quantum Chemistry on Quantum Computers.

Project description:Quantum chemistry calculations of large, strongly correlated systems are typically limited by the computation cost that scales exponentially with the size of the system. Quantum algorithms, designed specifically for quantum computers, can alleviate this, but the resources required are still too large for today's quantum devices. Here, we present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation (QPE) and variational unitary coupled cluster singles and doubles (UCCSD) to compute their ground-state energy. Our algorithm, termed "local active space unitary coupled cluster" (LAS-UCC), scales linearly with the system size for certain geometries, providing a polynomial reduction in the total number of gates compared with QPE, while providing accuracy above that of the variational quantum eigensolver using the UCCSD ansatz and also above that of the classical local active space self-consistent field. The accuracy of LAS-UCC is demonstrated by dissociating (H2)2 into two H2 molecules and by breaking the two double bonds in trans-butadiene, and resource estimates are provided for linear chains of up to 20 H2 molecules.

| S-EPMC9753592 | biostudies-literature

RNA folding using quantum computers.

Project description:The 3-dimensional fold of an RNA molecule is largely determined by patterns of intramolecular hydrogen bonds between bases. Predicting the base pairing network from the sequence, also referred to as RNA secondary structure prediction or RNA folding, is a nondeterministic polynomial-time (NP)-complete computational problem. The structure of the molecule is strongly predictive of its functions and biochemical properties, and therefore the ability to accurately predict the structure is a crucial tool for biochemists. Many methods have been proposed to efficiently sample possible secondary structure patterns. Classic approaches employ dynamic programming, and recent studies have explored approaches inspired by evolutionary and machine learning algorithms. This work demonstrates leveraging quantum computing hardware to predict the secondary structure of RNA. A Hamiltonian written in the form of a Binary Quadratic Model (BQM) is derived to drive the system toward maximizing the number of consecutive base pairs while jointly maximizing the average length of the stems. A Quantum Annealer (QA) is compared to a Replica Exchange Monte Carlo (REMC) algorithm programmed with the same objective function, with the QA being shown to be highly competitive at rapidly identifying low energy solutions. The method proposed in this study was compared to three algorithms from literature and, despite its simplicity, was found to be competitive on a test set containing known structures with pseudoknots.

| S-EPMC9022793 | biostudies-literature

Training Optimization for Gate-Model Quantum Neural Networks.

Project description: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.

| S-EPMC6722103 | biostudies-literature

Elucidating reaction mechanisms on quantum computers.

Project description:With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

| S-EPMC5530650 | biostudies-literature

mRNA codon optimization with quantum computers.

Project description:Reverse translation of polypeptide sequences to expressible mRNA constructs is a NP-hard combinatorial optimization problem. Each amino acid in the protein sequence can be represented by as many as six codons, and the process of selecting the combination that maximizes probability of expression is termed codon optimization. This work investigates the potential impact of leveraging quantum computing technology for codon optimization. A Quantum Annealer (QA) is compared to a standard genetic algorithm (GA) programmed with the same objective function. The QA is found to be competitive in identifying optimal solutions. The utility of gate-based systems is also evaluated using a simulator resulting in the finding that while current generations of devices lack the hardware requirements, in terms of both qubit count and connectivity, to solve realistic problems, future generation devices may be highly efficient.

| S-EPMC8555812 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data