Related papers: Quantum space, ground space traversal, and how to …
For quantum computing (QC) to emerge as a practically indispensable computational tool, there is a need for quantum protocols with an end-to-end practical applications -- in this instance, fluid dynamics. We debut here a high performance…
Quantum data access and quantum processing can make certain classically intractable learning tasks feasible. However, quantum capabilities will only be available to a select few in the near future. Thus, reliable schemes that allow…
The efficient certification of classically intractable quantum devices has been a central research question for some time. However, to observe a "quantum advantage", it is believed that one does not need to build a large scale universal…
We study the maximum constraint satisfaction problem, Max-CSP, in the streaming setting. Given $n$ variables, the constraints arrive sequentially in an arbitrary order, with each constraint involving only a small subset of the variables.…
Achieving quantum computational advantage requires solving a classically intractable problem on a quantum device. Natural proposals rely upon the intrinsic hardness of classically simulating quantum mechanics; however, verifying the output…
Realizing a conceptual quantum algorithm on an actual physical device necessitates the algorithm's quantum circuit description to undergo certain transformations in order to adhere to all constraints imposed by the hardware. In this regard,…
We present the architecture and analyze the applications of a metropolitan-scale quantum network that requires only limited hardware resources for end users. Using NetSquid, a quantum network simulation tool based on discrete events, we…
Basing on states and channels isomorphism we point out that semidefinite programming can be used as a quick test for nonzero one-way quantum channel capacity. This can be achieved by search of symmetric extensions of states isomorphic to a…
The Quantum Satisfiability problem (QSAT) is the generalization of the canonical NP-complete problem - Boolean Satisfiability. (k,s)-QSAT is the following variant of the problem: given a set of projectors of rank 1, acting non-trivially on…
When computation is outsourced, the data owner would like to be assured that the desired computation has been performed correctly by the service provider. In theory, proof systems can give the necessary assurance, but prior work is not…
Following initial work by Gregoratti and Werner [J. Mod. Optics 50, 913-933, 2003 and quant-ph/0403092] and Hayden and King [quant-ph/0409026], we study the problem of the capacity of a quantum channel assisted by a "friendly (channel)…
We prove classical simulation hardness, under the generalized $\mathsf{P}\neq\mathsf{NP}$ conjecture, for quantum circuit families with applications in near-term chemical ground state estimation. The proof exploits a connection to particle…
Quantum subspace expansion (QSE) offers promising avenues to perform spectral calculations on quantum processors but comes with a large measurement overhead. Informationally complete (IC) measurements, such as classical shadows, were…
Quantum circuit execution is the central task in quantum computation. Due to inherent quantum-mechanical constraints, quantum computing workflows often involve a considerable number of independent measurements over a large set of slightly…
Electromagnetic simulations form an indispensable part of the design and optimization process for superconducting quantum devices. Although several commercial platforms exist, open-source alternatives optimized for high-performance…
Continuous time quantum walks on exponentially large, sparse graphs form a powerful paradigm for quantum computing: On the one hand, they can be efficiently simulated on a quantum computer. On the other hand, they are themselves…
We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs). We show that a single counting quantifier strictly…
We present a lattice-based scheme for homomorphic evaluation of quantum programs and proofs that remains secure against quantum adversaries. Classical homomorphic encryption is lifted to the quantum setting by replacing composite-order…
We propose a method for general-purpose quantum computation and simulation that is well suited for today's pre-threshold-fidelity superconducting qubits. This approach makes use of the $n$-dimensional single-excitation subspace (SES) of a…
We consider quantum quench in large-N singlet sector quantum mechanics of a single hermitian matrix in the double scaling limit. The time dependent parameter is the self-coupling of the matrix. We find exact classical solutions of the…