A feasible approach for automatically differentiable unitary coupled-cluster on quantum computers.
Ontology highlight
ABSTRACT:
SUBMITTER: Kottmann JS
PROVIDER: S-EPMC8179519 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
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
Project description:BACKGROUND AND AIMS:Binge-watching (i.e., watching multiple episodes of a TV series in one session) has recently become standard practice among TV series viewers; this expansion generates concerns regarding the potential negative outcomes associated with this habit. However, the investigation of its psychological correlates remains fragmentary, with few initial studies a priori conceptualizing this behavior as a new addictive disorder. This study explored these psychological correlates using cluster analysis of binge-watching behavior based on three key psychological factors: motivations, impulsivity, and emotional reactivity. METHODS:An online survey was completed by 4,039 TV series viewers. Data were analyzed using hierarchical and non-hierarchical cluster analyses, the validity of the clusters being finally determined through mutual comparisons with a selection of external correlates. RESULTS:Four clusters were identified: recreational TV series viewers (presenting low involvement in binge-watching), regulated binge-watchers (moderately involved), avid binge-watchers (presenting elevated but non-problematic involvement), and unregulated binge-watchers (presenting potentially problematic involvement associated with negative outcomes). DISCUSSION AND CONCLUSIONS:This study underlines the heterogeneous and multidetermined nature of binge-watching. Our findings suggest that high engagement in binge-watching is distinct from problematic binge-watching, thus reinforcing the notion that conceptualizing binge-watching as an addictive disorder is of low relevance and might actually lead to the overpathologization of this highly popular leisure activity.
| S-EPMC7044630 | biostudies-literature
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
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
Project description: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.
| S-EPMC7910494 | biostudies-literature
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
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
Project description:The full configuration interaction (full-CI) method is capable of providing the numerically best wave functions and energies of atoms and molecules within basis sets being used, although it is intractable for classical computers. Quantum computers can perform full-CI calculations in polynomial time against the system size by adopting a quantum phase estimation algorithm (QPEA). In the QPEA, the preparation of initial guess wave functions having sufficiently large overlap with the exact wave function is recommended. The Hartree-Fock (HF) wave function is a good initial guess only for closed shell singlet molecules and high-spin molecules carrying no spin-? unpaired electrons, around their equilibrium geometry, and thus, the construction of multiconfigurational wave functions without performing post-HF calculations on classical computers is highly desired for applying the method to a wide variety of chemistries and physics. In this work, we propose a method to construct multiconfigurational initial guess wave functions suitable for QPEA-based full-CI calculations on quantum computers, by utilizing diradical characters computed from spin-projected UHF wave functions. The proposed approach drastically improves the wave function overlap, particularly in molecules with intermediate diradical characters.
| S-EPMC6346626 | biostudies-literature
Project description:Since two quantum states that are local unitary (LU) equivalent have the same amount of entanglement, it is meaningful to find a practical method to determine the LU equivalence of given quantum states. In this paper, we present a valid process to find the unitary tensor product decomposition for an arbitrary unitary matrix. Then, by using this process, the conditions for determining the local unitary equivalence of quantum states are obtained. A numerical verification is carried out, which shows the practicability of our protocol. We also present a property of LU invariants by using the universality of quantum gates which can be used to construct the complete set of LU invariants.
| S-EPMC10452990 | biostudies-literature
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