相关论文: Simple and maximally robust processes with no clas…
Our recent work (Ayral et al., 2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)) showed the first implementation of the Quantum Divide and Compute (QDC) method, which allows to break quantum circuits into smaller fragments with…
This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\eta$, is smaller than a constant threshold, $\eta_c$. The result holds for a very…
A critical milestone on the path to useful quantum computers is quantum supremacy - a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB…
A major challenge in quantum communication is addressing the negative effects of noise on channel capacity, especially for completely depolarizing channels, where information transmission is inherently impossible. The concept of indefinite…
We demonstrate exciting similarities between classical and quantum many body systems whose microscopic dynamics are composed of non-reciprocal three-site facilitated exclusion processes. We show that the quantum analogue of the classical…
A proof of quantumness is a method for provably demonstrating (to a classical verifier) that a quantum device can perform computational tasks that a classical device with comparable resources cannot. Providing a proof of quantumness is the…
Two systems whose correlations cannot be classically accounted for display the simplest instance of quantum entanglement. Although this two-party association has caused a revolution in the foundations and uses of quantum mechanics, genuine…
Quantum computational pseudorandomness has emerged as a fundamental notion that spans connections to complexity theory, cryptography and fundamental physics. However, all known constructions of efficient quantum-secure pseudorandom objects…
This thesis focuses on the experimental creation and detection of a variety of quantum correlations using nuclear magnetic resonance hardware. Quantum entanglement, being most common and counter-intuitive, is one of the main type considered…
Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near-term. In this…
A growing body of work has established the modelling of stochastic processes as a promising area of application for quantum techologies; it has been shown that quantum models are able to replicate the future statistics of a stochastic…
We develop a recently introduced representation of quantum dynamics based on sampling negative Markov chain processes. By introducing particles and antiparticles, this formalism maps generic quantum dynamics onto a Markov process defined…
Continuous-time stochastic processes pervade everyday experience, and the simulation of models of these processes is of great utility. Classical models of systems operating in continuous-time must typically track an unbounded amount of…
Memoryless processes are ubiquitous in nature, in contrast with the mathematics of open systems theory, which states that non-Markovian processes should be the norm. This discrepancy is usually addressed by subjectively making the…
Sequential quantum information processing may lie in the peaceful coexistence of no-go theorems on quantum operations, such as the no-cloning theorem, the monogamy of correlations, and the no-signalling principle. In this work, we…
We show that the ability to create entanglement is necessary for execution of bipartite quantum gates even when they are applied to unentangled states and create no entanglement. Starting with a simple example we demonstrate that to execute…
The ultimate goal of quantum error correction is to create logical qubits with very low error rates (e.g. 1e-12) and assemble them into large-scale quantum computers capable of performing many (e.g. billions) of logical gates on many (e.g.…
We {characterize the multipartite entanglement in a quantum system by the quantity} which vanishes if only the quantum system may be decomposed into two weakly entangled subsystems, unlike measures of multipartite entanglement introduced…
Quantum computers require error correction to achieve universal quantum computing. However, current decoding of quantum error-correcting codes relies on classical computation, which is slower than quantum operations in superconducting…
In a recent series of works [Ebler et al. Phys. Rev. Lett. 120, 120502 (2018); arXiv:1809.06655v2; arXiv:1810.10457v2], it has been proposed that the quantum superposition of causal order -- the quantum switch -- may offer an enhancement of…