Classical Time Crystals by Shapere, Alfred, Wilczek, Frank

“…We consider the possibility that classical dynamical systems display motion in their lowest-energy state, forming a time analogue of crystalline spatial order. …”
Get full text
Get full text

Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback by Shor, Peter Williston

“…We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. …”
Get full text

Uniform Additivity in Classical and Quantum Information by Cross, Andrew, Li, Ke, Smith, Graeme

“…Our complete characterization of uniform additivity exposes an intriguing new additive quantity and identifies a remarkable coincidence—the classical and quantum uniformly additive functions with one auxiliary variable are identical.…”
Get full text

Superadditivity of the Classical Capacity with Limited Entanglement Assistance by Zhu, Elton, Zhuang, Quntao, Shor, Peter Williston

“…Finding the optimal encoding strategies can be challenging for communication using quantum channels, as classical and quantum capacities may be superadditive. …”
Get full text
Get full text
Get full text
Get full text

Three-sphere free energy for classical gauge groups by Mezei, Mark Koppany, Pufu, Silviu

Get full text

Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement by Zhuang, Quntao, Zhu, Elton, Shor, Peter Williston

“…We give a capacity formula for the classical information transmission over a noisy quantum channel, with separable encoding by the sender and limited resources provided by the receiver’s preshared ancilla. …”
Get full text
Get full text
Get full text
Get full text

Beating the classical limits of information transmission using a quantum decoder by Chapman, Robert J., Karim, Akib, Huang, Zixin, Tomamichel, Marco, Peruzzo, Alberto, Flammia, Steven Thomas

“…By simulating the channel using a photonic interferometric setup, we experimentally increase the reliability of transmitting a data bit by greater than 20% for a certain damping range over classically sending the message twice. We show how our methodology can be extended to larger systems by simulating the transmission of a single bit with up to eight uses of the channel and a two-bit message with three uses of the channel, predicting a quantum enhancement in all cases.…”
Get full text

Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing by Crosson, Elizabeth, Harrow, Aram W.

“…Can quantum computers solve optimization problems much more quickly than classical computers? One major piece of evidence for this proposition has been the fact that Quantum Annealing (QA) finds the minimum of some cost functions exponentially more quickly than classical Simulated Annealing (SA). …”
Get full text

Effective field theory of dissipative fluids (II): classical limit, dynamical KMS symmetry and entropy current by Glorioso, Paolo, Crossley, Michael J., Liu, Hong

“…We first work out in detail the classical limit of the hydrodynamical action, which exhibits many simplifications. …”
Get full text
Get full text
Get full text

Superadditivity in Trade-Off Capacities of Quantum Channels by Zhu, Elton Yechao., Zhuang, Quntao, Shor, Peter Williston

“…For example, if a channel has an additive classical and quantum capacity, can the classical-quantum capacity be superadditive? …”
Get full text

Adaptive quantum simulated annealing for Bayesian inference and estimating partition functions by Harrow, Aram W., Wei, Annie Y.

“…Like other quantum walk algorithms, it also improves on classical algorithms by producing “qsamples” instead of classical samples. …”
Get full text

Quantum algorithms for jet clustering by Wei, Annie Y., Naik, Preksha, Harrow, Aram W., Thaler, Jesse

“…A key component of our analysis is the consideration of realistic models for interfacing classical data with a quantum algorithm. With a sequential computing model, we show how to speed up the well-known O(N3) classical algorithm to an O(N2) quantum algorithm, including the O(N) overhead of loading classical data from N final-state particles. …”
Get full text

Quantum Algorithms for Charged Particle Track Reconstruction in the LUXE Experiment by Crippa, Arianna, Funcke, Lena, Hartung, Tobias, Heinemann, Beate, Jansen, Karl, Kropf, Annabel, Kühn, Stefan, Meloni, Federico, Spataro, David, Tüysüz, Cenk, Yap, Yee C.

“…Approaches based on a quadratic unconstrained binary optimisation and a quantum graph neural network are investigated in classical simulations of quantum devices and compared with a classical track reconstruction algorithm. …”
Get full text

Coreset Clustering on Small Quantum Computers by Anschuetz, Eric R.

“…Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load the data set in superposition can erase any potential quantum speedup over classical algorithms. …”
Get full text

Quantum Locally Testable Codes by Aharonov, Dorit, Eldar, Lior

“…We initiate the study of quantum locally testable codes (qLTCs). Classical LTCs are very important in computational complexity. …”
Get full text
Get full text

Extremal eigenvalues of local Hamiltonians by Harrow, Aram W, Montanaro, Ashley

“…We apply classical algorithms for approximately solving constraint satisfaction problems to find bounds on extremal eigenvalues of local Hamiltonians. …”
Get full text

Quantum Symmetry Anomalies by Jackiw, Roman

“…The axial anomaly is a quantum term that violates the classical conservation of the the axial current.…”
Get full text
Get full text

Quantum Computational Supremacy by Harrow, Aram W., Montanaro, Ashley

“…A key milestone in this field will be when a universal quantum computer performs a computational task that is beyond the capability of any classical computer, an event known as quantum supremacy. …”
Get full text

Product-State Approximations to Quantum States by Brandão, Fernando G. S. L., Harrow, Aram W

“…This is a statement about the monogamy of entanglement, which cannot be shared without limit in the same way as classical correlation. Our main application is to Hamiltonians that are sums of two-body terms. …”
Get full text
Get full text

Expected Communication Cost of Distributed Quantum Tasks by Anshu, Anurag, Garg, Ankit, Harrow, Aram W., Yao, Penghui

“…The classical messages can have a variable length, and the goal is to minimize their expected length. …”
Get full text