相关论文: Majorization and the time complexity of linear opt…

We quantify the emergent complexity of quantum states near quantum critical points on regular 1D lattices, via complex network measures based on quantum mutual information as the adjacency matrix, in direct analogy to quantifying the…

Modulating macroscopic parameters of materials in time offers innovative avenues for manipulating electromagnetic waves. Due to such enticing prospects, the general research subject of time-varying systems is expanding today in different…

Major obstacles against efficient long distance quantum communication are photon losses during transmission and the probabilistic nature of Bell measurement causing exponential scaling in time and resource with distance. To overcome these…

The precise description of quantum nuclear fluctuations in atomistic modelling is possible by employing path integral techniques, which involve a considerable computational overhead due to the need of simulating multiple replicas of the…

Since its introduction Boson Sampling has been the subject of intense study in the world of quantum computing. The task is to sample independently from the set of all $n \times n$ submatrices built from possibly repeated rows of a larger $m…

In a distributed quantum computer scalability is accomplished by networking together many elementary nodes. Typically the network is optical and inter-node entanglement involves photon detection. In complex networks the entanglement…

Majorization provides a rather powerful partial-order classification of probability distributions depending only on the spread of the statistics, and not on the actual numerical values of the variable being described. We propose to apply…

Quantum circuit complexity is a fundamental concept whose importance permeates quantum information, computation, many-body physics and high-energy physics. While extensively studied in closed systems, its characterization and behaviors in…

The development of prototype metropolitan-scale quantum networks is underway and entails transmitting quantum information via single photons through deployed optical fibers spanning several tens of kilometers. The major challenges in…

Loop-based boson samplers interfere photons in the time degree of freedom using a sequence of delay lines. Since they require few hardware components while also allowing for long-range entanglement, they are strong candidates for…

Boson sampling is a problem intractable for classical computers, but can be naturally solved on a specialized photonic quantum simulator which requires less resources than building a universal quantum computer. The biggest challenge to…

The goal of the present paper is to derive some conditions on saturation of (strong) subadditivity inequality for the stochastic matrices. The notion of relative entropy of stochastic matrices is introduced by mimicking quantum relative…

What is the relationship between the complexity of a learner and the randomness of his mistakes? This question was posed in \cite{rat0903} who showed that the more complex the learner the higher the possibility that his mistakes deviate…

Classic cache-oblivious parallel matrix multiplication algorithms achieve optimality either in time or space, but not both, which promotes lots of research on the best possible balance or tradeoff of such algorithms. We study modern…

General quantum computation consists of unitary operations and also measurements. It is well known that intermediate quantum measurements can be deferred to the end of the computation, resulting in an equivalent purely unitary computation.…

We theoretically investigate quantum interference of two single photons at a lossy asymmetric beam splitter, the most general passive 2$\times$2 optical circuit. The losses in the circuit result in a non-unitary scattering matrix with a…

One of the most significant challenges facing the development of linear optics quantum computing (LOQC) is mode-mismatch, whereby photon distinguishability is introduced within circuits, undermining quantum interference effects. We examine…

This paper narrows the gap between previous literature on quantum linear algebra and practical data analysis on a quantum computer, formalizing quantum procedures that speed-up the solution of eigenproblems for data representations in…

We introduce a binary relation on the finite discrete probability distributions which generalizes notions of majorization that have been studied in quantum information theory. Motivated by questions in thermodynamics, our relation describes…

Sampling from a quantum distribution can be exponentially hard for classical computers and yet could be performed efficiently by a noisy intermediate-scale quantum device. A prime example of a distribution that is hard to sample is given by…