Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
31,714
This Month
152
Today
0
Research Volume
15,743 papers in 12 months (-37% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
Validating quantum-classical programming models with tensor network simulations
A. McCaskey, E. Dumitrescu, Mengsu Chen +2 more·Jul 20, 2018
The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the util...
Quantum circuit model of black hole evaporation
Tomoro Tokusumi, Akira Matsumura, Y. Nambu·Jul 20, 2018
We consider a quantum circuit model describing the evaporation process of black holes. We specifically examine the behavior of the multipartite entanglement represented by this model, and find that the entanglement structure depends on the black hole...
Quantum Arnoldi and conjugate gradient iteration algorithm
Changpeng Shao·Jul 20, 2018
Arnoldi method and conjugate gradient method are important classical iteration methods in solving linear systems and estimating eigenvalues. Their efficiency often affected by the high dimension of the space, where quantum computer can play a role in...
Local-measurement-based quantum state tomography via neural networks
T. Xin, Sirui Lu, Ningping Cao +5 more·Jul 19, 2018
Quantum state tomography is a daunting challenge of experimental quantum computing, even in moderate system size. One way to boost the efficiency of state tomography is via local measurements on reduced density matrices, but the reconstruction of the...
Quantum computation via Floquet topological edge modes
R. W. Bomantara, J. Gong·Jul 19, 2018
Floquet topological matter has emerged as one exciting platform to explore rich physics and game-changing applications of topological phases. As one remarkable and recently discovered feature of Floquet symmetry protected topological (SPT) phases, in...
Passive, deterministic photonic conditional-phase gate via two-level systems
William Konyk, J. Gea-Banacloche·Jul 19, 2018
Photons are one of the best carriers of quantum information, as they interact only weakly with the environment, and photon processes are fast and efficient. Despite these advantages, two main issues have prevented alloptical quantum computing from be...
Quantum Computing with Majorana Kramers Pairs.
C. Schrade, L. Fu·Jul 17, 2018
We propose a universal gate set acting on a qubit formed by the degenerate ground states of a Coulomb-blockaded time-reversal invariant topological superconductor island with spatially separated Majorana Kramers pairs: the "Majorana Kramers qubit." A...
Quantum Chebyshev's Inequality and Applications
Yassine Hamoudi, F. Magniez·Jul 17, 2018
In this paper we provide new quantum algorithms with polynomial speed-up for a range of problems for which no such results were known, or we improve previous algorithms. First, we consider the approximation of the frequency moments $F_k$ of order $k ...
Remote Sampling with Applications to General Entanglement Simulation
G. Brassard, L. Devroye, C. Gravel·Jul 17, 2018
We show how to sample exactly discrete probability distributions whose defining parameters are distributed among remote parties. For this purpose, von Neumann’s rejection algorithm is turned into a distributed sampling communication protocol. We stud...
Finding a marked node on any graph by continuous time quantum walk
Shantanav Chakraborty, Leonardo Novo, J. Roland·Jul 16, 2018
Spatial search by a discrete-time quantum walk can find a marked node on any ergodic, reversible Markov chain $P$ quadratically faster than its classical counterpart, i.e., in a time that is in the square root of the hitting time of $P$. However, in ...
Hyperbolic fracton model, subsystem symmetry, and holography. II. The dual eight-vertex model
Han Yan·Jul 16, 2018
We propose that the fracton topological order is a class of toy models for holography. The discovery of AdS/CFT correspondence as a concrete construction of holography, and the subsequent developments including the Ryu-Takanayagi formula of entanglem...
Propagation of generalized Pauli errors in qudit Clifford circuits
Daniel Miller, T. Holz, H. Kampermann +1 more·Jul 16, 2018
It is important for performance studies in quantum technologies to analyze quantum circuits in the presence of noise. We introduce an error probability tensor, a tool to track generalized Pauli error statistics of qudits within quantum circuits compo...
Design and Implementation of a Digital Signature Scheme Based on Low-density Generator Matrix Codes
M. Baldi, Alessandro Barenghi, F. Chiaraluce +4 more·Jul 16, 2018
In this paper we consider a post-quantum digital signature scheme based on low-density generator matrix codes and propose efficient algorithmic solutions for its implementation. We also review all known attacks against this scheme and derive closed-f...
Learning the Alpha-bits of black holes
P. Hayden, Geoffrey Penington·Jul 16, 2018
When the bulk geometry in AdS/CFT contains a black hole, boundary subregions may be sufficient to reconstruct certain bulk operators if and only if the black hole microstate is known, an example of state dependence. Reconstructions exist for any micr...
Partially smoothed information measures
Anurag Anshu, Mario Berta, Rahul Jain +1 more·Jul 15, 2018
Smooth entropies are a tool for quantifying resource trade-offs in (quantum) information theory and cryptography. In typical bi- and multi-partite problems, however, some of the sub-systems are often left unchanged and this is not reflected by the st...
Sinkhorn–Knopp theorem for PPT states
D. Cariello·Jul 15, 2018
Given a PPT state $$A=\sum _{i=1}^nA_i\otimes B_i \in M_k\otimes M_k$$A=∑i=1nAi⊗Bi∈Mk⊗Mk and a rank k tensor v within the image of A, we provide an algorithm that checks whether the positive map $$G_A:M_k\rightarrow M_k$$GA:Mk→Mk, $$G_A(X)=\sum _{i=1...
Efficient Quantum Algorithms for GHZ and W States, and Implementation on the IBM Quantum Computer
Diogo Cruz, Romain Fournier, Fabien Gremion +8 more·Jul 15, 2018
Efficient deterministic algorithms are proposed with logarithmic step complexities for the generation of entangled GHZN and WN states useful for quantum networks, and an implementation on the IBM quantum computer up to N=16 is demonstrated. Improved ...
Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels
Z. Cai, S. Benjamin·Jul 13, 2018
Twirling is a technique widely used for converting arbitrary noise channels into Pauli channels in error threshold estimations of quantum error correction codes. It is vitally useful both in real experiments and in classical quantum simulations. Mini...
Quantum algorithm for solving linear differential equations: Theory and experiment
T. Xin, Shijie Wei, Jianlian Cui +7 more·Jul 12, 2018
Solving linear differential equations (LDEs) is a hard problem for classical computers, while quantum algorithms have been proposed to be capable of speeding up the calculation. However, they are yet to be realized in experiment as it cannot be easil...
Nonasymptotic assisted distillation of quantum coherence
Bartosz Regula, Ludovico Lami, A. Streltsov·Jul 12, 2018
We characterize the operational task of environment-assisted distillation of quantum coherence under different sets of free operations when only a finite supply of copies of a given state is available. We first evaluate the one-shot assisted distilla...