Recherche

Afficher tous les résultats pour

Accueil

Concept

Quantum algorithm

Science formelle
Informatique théorique
Theory of computation
Informatique quantique

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (32)

Fast correlation function calculator A high-performance pair-counting toolkit

Cheng Zhao

Context. A novel high-performance exact pair-counting toolkit called fast correlation function calculator (FCFC) is presented.Aims. With the rapid growth of modern cosmological datasets, the evaluation of correlation functions with observational and simula ...

EDP SCIENCES S A2023

Quantum process tomography with unsupervised learning and tensor networks

Giuseppe Carleo

The impressive pace of advance of quantum technology calls for robust and scalable techniques for the characterization and validation of quantum hardware. Quantum process tomography, the reconstruction of an unknown quantum channel from measurement data, r ...

Nature Portfolio2023

A squeezed mechanical oscillator with millisecond quantum decoherence

Tobias Kippenberg, Amir Youssefi, Mahdi Chegnizadeh, Shingo Kono

An enduring challenge in constructing mechanical-oscillator-based hybrid quantum systems is to ensure engineered coupling to an auxiliary degree of freedom and maintain good mechanical isolation from the environment, that is, low quantum decoherence, consi ...

NATURE PORTFOLIO2023

Validating functional redundancy with mixed generative adversarial networks

Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Trung-Dung Hoang

Data redundancy has been one of the most important problems in data-intensive applications such as data mining and machine learning. Removing data redundancy brings many benefits in efficient data updating, effective data storage, and error-free query proc ...

ELSEVIER2023

Deep learning-based solid component measuring enabled interpretable prediction of tumor invasiveness for lung adenocarcinoma

Jiancheng Yang, Li Zhang, Xinchao Wang, Hua Sun

Background: The nature of the solid component of subsolid nodules (SSNs) can indicate tumor pathological invasiveness. However, preoperative solid component assessment still lacks a reference standard.Methods: In this retrospective study, an AI algorithm w ...

Elsevier Ireland Ltd2023

Bayesian reconstruction of memories stored in neural networks from their connectivity

Florent Gérard Krzakala, Lenka Zdeborová

The advent of comprehensive synaptic wiring diagrams of large neural circuits has created the field of connectomics and given rise to a number of open research questions. One such question is whether it is possible to reconstruct the information stored in ...

2023

Geometric Considerations in Lattice Programming

Moritz Andreas Venzin

We provide faster algorithms and fine-grained reductions for lattice problems in general norms. ...

EPFL2023

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

arXiv2023

Engineering random spin models with atoms in a high-finesse cavity

Jean-Philippe Brantut, Nick Jacob Sauerwein, Tigrane Arthur Cantat Moltrecht

Random spin models play a key role in our understanding of disorder and complex many-body systems. Two all-to-all interacting, disordered models have now been realized using a cavity quantum electrodynamics platform. ...

NATURE PORTFOLIO2023

Variational dynamics as a ground-state problem on a quantum computer

Giuseppe Carleo, Filippo Vicentini, Stefano Barison

We propose a variational quantum algorithm to study the real-time dynamics of quantum systems as a ground -state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits. We prepare the ...

AMER PHYSICAL SOC2022

Efficient Preparation of Cyclic Quantum States

Giovanni De Micheli, Fereshte Mozafari Ghoraba

Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...

IEEE2022

Page 2 sur 2