Related papers: Deja-Vu: A Glimpse on Radioactive Soft-Error Conse…
In classical computation, a "write-only memory" (WOM) is little more than an oxymoron, and the addition of WOM to a (deterministic or probabilistic) classical computer brings no advantage. We prove that quantum computers that are augmented…
We study theoretically two consequences of the mixed classical phase space for three repulsively-interacting bosonic particles in a circular trap. First, we show that the energy levels of the corresponding quantum system are well described…
Classical verification of quantum learning allows classical clients to reliably leverage quantum computing advantages by interacting with untrusted quantum servers. Yet, current quantum devices available in practice suffers from a variety…
Quantum computing has existed in the theoretical realm for several decades. Recently, quantum computing has re-emerged as a promising technology to solve problems that a classical computer could take hundreds of years to solve. However,…
We propose a simple scheme to reduce readout errors in experiments on quantum systems with finite number of measurement outcomes. Our method relies on performing classical post-processing which is preceded by Quantum Detector Tomography,…
Recent experimental achievements motivate an ever-growing interest from companies starting to feel the limitations of classical computing. Yet, in light of ongoing privacy scandals, the future availability of quantum computing through…
We propose an implementation of a quantum computer to solve Deutsch's problem, which requires exponential time on a classical computer but only linear time with quantum parallelism. By using a dual-rail qubit representation as a simple form…
Numerous physical systems have been proposed for constructing quantum computers, but formidable obstacles stand in the way of making even modest systems with a few hundred quantum bits (qubits). Several approaches utilize the spin of an…
The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…
Electron and nuclear spins are very promising candidates to serve as quantum bits (qubits) for proposed quantum computers, as the spin degrees of freedom are relatively isolated from their surroundings, and can be coherently manipulated…
The purpose of this paper is to show the unusual behavior of a number of simple circuits under the effects of post-selection. A useful duality exists between post-selected ensembles and a consistent picture of acausal physics embodying the…
We describe in detail a set of ideas for implementing qubits, quantum gates and quantum gate networks in a semiconductor heterostructure device. Our proposal is based on an extension of the technology used for surface acoustic wave (SAW)…
Accurate quantum chemistry simulations remain challenging on classical computers for problems of industrially relevant sizes and there is reason for hope that quantum computing may help push the boundaries of what is technically feasible.…
These are the lecture notes from the 2019 Les Houches Summer School on "Quantum Information Machines". After a brief introduction to quantum error correction and bosonic codes, we focus on the case of cat qubits stabilized by a nonlinear…
I discuss the delayed choice quantum eraser experiment (DCQE) by drawing an analogy to a Bell-type measurement and giving a straightforward account in standard quantum mechanics. The delayed choice quantum eraser experiment turns out to…
The demonstration of quantum error correction (QEC) is one of the most important milestones in the realization of fully-fledged quantum computers. Toward this, QEC experiments using the surface codes have recently been actively conducted.…
Bribery in election (or computational social choice in general) is an important problem that has received a considerable amount of attention. In the classic bribery problem, the briber (or attacker) bribes some voters in attempting to make…
Random circuit sampling (RCS) is a leading approach to demonstrate quantum advantage, with its believed classical hardness rooted in anticoncentration of output distributions and average-case hardness of probability estimation. Here we show…
We consider quantum computation efficiency from a new perspective. The efficiency is reduced to its classical counterpart by imposing the semi-classical limit. We show that this reduction is caused by the fact that any elementary quantum…
It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to…