Browse
Submit Data
Databases
API
Help

Dataset Information

85 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Simulating complex quantum networks with time crystals.

ABSTRACT: Crystals arise as the result of the breaking of a spatial translation symmetry. Similarly, translation symmetries can also be broken in time so that discrete time crystals appear. Here, we introduce a method to describe, characterize, and explore the physical phenomena related to this phase of matter using tools from graph theory. The analysis of the graphs allows to visualizing time-crystalline order and to analyze features of the quantum system. For example, we explore in detail the melting process of a minimal model of a period-2 discrete time crystal and describe it in terms of the evolution of the associated graph structure. We show that during the melting process, the network evolution exhibits an emergent preferential attachment mechanism, directly associated with the existence of scale-free networks. Thus, our strategy allows us to propose a previously unexplored far-reaching application of time crystals as a quantum simulator of complex quantum networks.

SUBMITTER: Estarellas MP

PROVIDER: S-EPMC7567590 | biostudies-literature | 2020 Oct

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Simulating complex quantum networks with time crystals.

Estarellas M P MP Osada T T Bastidas V M VM Renoust B B Sanaka K K Munro W J WJ Nemoto K K

Science advances 20201016 42

Crystals arise as the result of the breaking of a spatial translation symmetry. Similarly, translation symmetries can also be broken in time so that discrete time crystals appear. Here, we introduce a method to describe, characterize, and explore the physical phenomena related to this phase of matter using tools from graph theory. The analysis of the graphs allows to visualizing time-crystalline order and to analyze features of the quantum system. For example, we explore in detail the melting pr ...[more]

PMID: 33067242

Similar Datasets

Quantum ferroelectricity in charge-transfer complex crystals.

Project description:Quantum phase transition achieved by fine tuning the continuous phase transition down to zero kelvin is a challenge for solid state science. Critical phenomena distinct from the effects of thermal fluctuations can materialize when the electronic, structural or magnetic long-range order is perturbed by quantum fluctuations between degenerate ground states. Here we have developed chemically pure tetrahalo-p-benzoquinones of n iodine and 4-n bromine substituents (QBr4-nIn, n=0-4) to search for ferroelectric charge-transfer complexes with tetrathiafulvalene (TTF). Among them, TTF-QBr2I2 exhibits a ferroelectric neutral-ionic phase transition, which is continuously controlled over a wide temperature range from near-zero kelvin to room temperature under hydrostatic pressure. Quantum critical behaviour is accompanied by a much larger permittivity than those of other neutral-ionic transition compounds, such as well-known ferroelectric complex of TTF-QCl4 and quantum antiferroelectric of dimethyl-TTF-QBr4. By contrast, TTF-QBr3I complex, another member of this compound family, shows complete suppression of the ferroelectric spin-Peierls-type phase transition.

| S-EPMC4490386 | biostudies-literature

Simulating Finite-Time Isothermal Processes with Superconducting Quantum Circuits.

Project description:Finite-time isothermal processes are ubiquitous in quantum-heat-engine cycles, yet complicated due to the coexistence of the changing Hamiltonian and the interaction with the thermal bath. Such complexity prevents classical thermodynamic measurements of a performed work. In this paper, the isothermal process is decomposed into piecewise adiabatic and isochoric processes to measure the performed work as the internal energy change in adiabatic processes. The piecewise control scheme allows the direct simulation of the whole process on a universal quantum computer, which provides a new experimental platform to study quantum thermodynamics. We implement the simulation on ibmqx2 to show the 1/τ scaling of the extra work in finite-time isothermal processes.

| S-EPMC8002232 | biostudies-literature

Simulating quantum chaos on a quantum computer.

Project description:Noisy intermediate-scale quantum (NISQ) computers provide a new experimental platform for investigating the behaviour of complex quantum systems. We show that currently available NISQ devices can be used for versatile quantum simulations of chaotic systems. We introduce a classical-quantum hybrid approach for exploring the dynamics of the chaotic quantum kicked top (QKT) on a quantum computer. The programmability of this approach allows us to experimentally explore a broad range of QKT chaoticity parameter regimes inaccessible to previous studies. Furthermore, the number of gates in our simulation does not increase with the number of kicks, thus making it possible to study the QKT evolution for arbitrary number of kicks without fidelity loss. Using a publicly accessible NISQ computer (IBMQ), we observe periodicities in the evolution of the 2-qubit QKT, as well as signatures of chaos in the time-averaged 2-qubit entanglement. We also demonstrate a connection between entanglement and delocalization in the 2-qubit QKT, confirming theoretical predictions.

| S-EPMC11542069 | biostudies-literature

Quantum navigation and ranking in complex networks.

Project description:Complex networks are formal frameworks capturing the interdependencies between the elements of large systems and databases. This formalism allows to use network navigation methods to rank the importance that each constituent has on the global organization of the system. A key example is Pagerank navigation which is at the core of the most used search engine of the World Wide Web. Inspired in this classical algorithm, we define a quantum navigation method providing a unique ranking of the elements of a network. We analyze the convergence of quantum navigation to the stationary rank of networks and show that quantumness decreases the number of navigation steps before convergence. In addition, we show that quantum navigation allows to solve degeneracies found in classical ranks. By implementing the quantum algorithm in real networks, we confirm these improvements and show that quantum coherence unveils new hierarchical features about the global organization of complex systems.

| S-EPMC3428603 | biostudies-other

Describing and Simulating Concurrent Quantum Systems

Project description:We present a programming language for describing and analysing concurrent quantum systems. We have an interpreter for programs in the language, using a symbolic rather than a numeric calculator, and we give its performance on examples from quantum communication and cryptography.

| S-EPMC7480686 | biostudies-literature

Potential energy of complex networks: a quantum mechanical perspective.

Project description:We propose a characterization of complex networks, based on the potential of an associated Schrödinger equation. The potential is designed so that the energy spectrum of the Schrödinger equation coincides with the graph spectrum of the normalized Laplacian. Crucial information is retained in the reconstructed potential, which provides a compact representation of the properties of the network structure. The median potential over several random network realizations, which we call ensemble potential, is fitted via a Landau-like function, and its length scale is found to diverge as the critical connection probability is approached from above. The ruggedness of the ensemble potential profile is quantified by using the Higuchi fractal dimension, which displays a maximum at the critical connection probability. This demonstrates that this technique can be successfully employed in the study of random networks, as an alternative indicator of the percolation phase transition. We apply the proposed approach to the investigation of real-world networks describing infrastructures (US power grid). Curiously, although no notion of phase transition can be given for such networks, the fractality of the ensemble potential displays signatures of criticality. We also show that standard techniques (such as the scaling features of the largest connected component) do not detect any signature or remnant of criticality.

| S-EPMC7592062 | biostudies-literature

On the complexity of quantum link prediction in complex networks.

Project description:Link prediction methods use patterns in known network data to infer which connections may be missing. Previous work has shown that continuous-time quantum walks can be used to represent path-based link prediction, which we further study here to develop a more optimized quantum algorithm. Using a sampling framework for link prediction, we analyze the query access to the input network required to produce a certain number of prediction samples. Considering both well-known classical path-based algorithms using powers of the adjacency matrix as well as our proposed quantum algorithm for path-based link prediction, we argue that there is a polynomial quantum advantage on the dependence on N, the number of nodes in the network. We further argue that the complexity of our algorithm, although sub-linear in N, is limited by the complexity of performing a quantum simulation of the network's adjacency matrix, which may prove to be an important problem in the development of quantum algorithms for network science in general.

| S-EPMC10781705 | biostudies-literature

Hybrid computational modeling demonstrates the utility of simulating complex cellular networks in type 1 diabetes.

Project description:Persistent destruction of pancreatic β-cells in type 1 diabetes (T1D) results from multifaceted pancreatic cellular interactions in various phase progressions. Owing to the inherent heterogeneity of coupled nonlinear systems, computational modeling based on T1D etiology help achieve a systematic understanding of biological processes and T1D health outcomes. The main challenge is to design such a reliable framework to analyze the highly orchestrated biology of T1D based on the knowledge of cellular networks and biological parameters. We constructed a novel hybrid in-silico computational model to unravel T1D onset, progression, and prevention in a non-obese-diabetic mouse model. The computational approach that integrates mathematical modeling, agent-based modeling, and advanced statistical methods allows for modeling key biological parameters and time-dependent spatial networks of cell behaviors. By integrating interactions between multiple cell types, model results captured the individual-specific dynamics of T1D progression and were validated against experimental data for the number of infiltrating CD8+T-cells. Our simulation results uncovered the correlation between five auto-destructive mechanisms identifying a combination of potential therapeutic strategies: the average lifespan of cytotoxic CD8+T-cells in islets; the initial number of apoptotic β-cells; recruitment rate of dendritic-cells (DCs); binding sites on DCs for naïve CD8+T-cells; and time required for DCs movement. Results from therapy-directed simulations further suggest the efficacy of proposed therapeutic strategies depends upon the type and time of administering therapy interventions and the administered amount of therapeutic dose. Our findings show modeling immunogenicity that underlies autoimmune T1D and identifying autoantigens that serve as potential biomarkers are two pressing parameters to predict disease onset and progression.

| S-EPMC8496846 | biostudies-literature

Simulating groundstate and dynamical quantum phase transitions on a superconducting quantum computer.

Project description:The phenomena of quantum criticality underlie many novel collective phenomena found in condensed matter systems. They present a challenge for classical and quantum simulation, in part because of diverging correlation lengths and consequently strong finite-size effects. Tensor network techniques that work directly in the thermodynamic limit can negotiate some of these difficulties. Here, we optimise a translationally invariant, sequential quantum circuit on a superconducting quantum device to simulate the groundstate of the quantum Ising model through its quantum critical point. We further demonstrate how the dynamical quantum critical point found in quenches of this model across its quantum critical point can be simulated. Our approach avoids finite-size scaling effects by using sequential quantum circuits inspired by infinite matrix product states. We provide efficient circuits and a variety of error mitigation strategies to implement, optimise and time-evolve these states.

| S-EPMC9550817 | biostudies-literature

Complex quantum networks as structured environments: engineering and probing.

Project description:We consider structured environments modeled by bosonic quantum networks and investigate the probing of their spectral density, structure, and topology. We demonstrate how to engineer a desired spectral density by changing the network structure. Our results show that the spectral density can be very accurately detected via a locally immersed quantum probe for virtually any network configuration. Moreover, we show how the entire network structure can be reconstructed by using a single quantum probe. We illustrate our findings presenting examples of spectral densities and topology probing for networks of genuine complexity.

| S-EPMC4882597 | biostudies-other

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