Concept

No-cloning theorem

Related publications (19)

The complexity of quantum support vector machines

Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training of such models c ...

Wien2024

Creating and controlling exceptional points of non-Hermitian Hamiltonians via homodyne Lindbladian invariance

Fabrizio Minganti

The exceptional points (EPs) of non-Hermitian Hamiltonians (NHHs) are spectral degeneracies associated with coalescing eigenvalues and eigenvectors, which are associated with remarkable dynamical properties. These EPs can be generated experimentally in ope ...

AMER PHYSICAL SOC2022

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

Giuseppe Carleo, Stefano Barison, Filippo Vicentini

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

Interplay of S and As in Mekong Delta sediments during redox oscillations

Rizlan Bernier-Latmani, Laurent Louis José Charlet

The cumulative effects of periodic redox cycling on the mobility of As, Fe, and S from alluvial sediment to groundwater were investigated in bioreactor experiments. Two particular sediments from the alluvial floodplain of the Mekong Delta River were invest ...

CHINA UNIV GEOSCIENCES, BEIJING2019

Information-theoretic limitations on approximate quantum cloning and broadcasting

Marius Christopher Lemm

We prove quantitative limitations on any approximate simultaneous cloning or broadcasting of mixed states. The results are based on information-theoretic (entropic) considerations and generalize the well-known no-cloning and no-broadcasting theorems. We al ...

2017

Quantum information density scaling and qubit operation time constraints of CMOS silicon-based quantum computer architectures

Edoardo Charbon, Fabio Sebastiano

Even the quantum simulation of an apparently simple molecule such as Fe2S2 requires a considerable number of qubits of the order of 106, while more complex molecules such as alanine (C3H7NO2) require about a hundred times more. In order to assess such a mu ...

2017

Short Stickelberger Class Relations and Application to Ideal-SVP

Benjamin Pierre Charles Wesolowski

The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of Ideal-SVP allows to prove the Ring-LWE and Ring-SIS assumptions, and t ...

Springer International Publishing Ag2017

Dictionary Learning Based on Sparse Distribution Tomography

Michaël Unser, Pedram Pad

We propose a new statistical dictionary learning algorithm for sparse signals that is based on an α-stable innovation model. The parameters of the underlying model—that is, the atoms of the dictionary, the sparsity index α and the dispersion of the transfo ...

P. Pad2017

Path integral approach to the quantum fidelity amplitude

Jiri Vanicek

The Loschmidt echo is a measure of quantum irreversibility and is determined by the fidelity amplitude of an imperfect time-reversal protocol. Fidelity amplitude plays an important role both in the foundations of quantum mechanics and its applications, suc ...

Royal Soc2016

Building Scene Models by Completing and Hallucinating Depth and Semantics

Mathieu Salzmann

Building 3D scene models has been a longstanding goal of computer vision. The great progress in depth sensors brings us one step closer to achieving this in a single shot. However, depth sensors still produce imperfect measurements that are sparse and cont ...

Springer Int Publishing Ag2016

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.