A new look at the conditions for the synthesis of speed-independent circuits

This paper presents a set of sufficient conditions for the gate-level synthesis of speed-independent circuits when constrained to a given class of gate library. Existing synthesis methodologies are restricted to architectures that use simple AND-gates, and do not exploit the advantages offered by the existence of complex gates. The use of complex gates increases the speed and reduces the area of the circuits. These improvements are achieved because of (1) the elimination of the distributivity, signal persistency and unique minimal state requirements imposed by other techniques; (2) the reduction in the number of internal signals necessary to guarantee the synthesis; and finally (3) the utilization of optimization techniques to reduce the fan-in of the involved gates and the number of required memory elements.Peer ReviewedPostprint (published version

Identifying feasible operating regimes for early T-cell recognition: The speed, energy, accuracy trade-off in kinetic proofreading and adaptive sorting

In the immune system, T cells can quickly discriminate between foreign and self ligands with high accuracy. There is evidence that T-cells achieve this remarkable performance utilizing a network architecture based on a generalization of kinetic proofreading (KPR). KPR-based mechanisms actively consume energy to increase the specificity beyond what is possible in equilibrium.An important theoretical question that arises is to understand the trade-offs and fundamental limits on accuracy, speed, and dissipation (energy consumption) in KPR and its generalization. Here, we revisit this question through numerical simulations where we simultaneously measure the speed, accuracy, and energy consumption of the KPR and adaptive sorting networks for different parameter choices. Our simulations highlight the existence of a 'feasible operating regime' in the speed-energy-accuracy plane where T-cells can quickly differentiate between foreign and self ligands at reasonable energy expenditure. We give general arguments for why we expect this feasible operating regime to be a generic property of all KPR-based biochemical networks and discuss implications for our understanding of the T cell receptor circuit.Comment: 14 pages, 8 figure

Negative Quasi-Probability as a Resource for Quantum Computation

A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speedup and, in particular, for fault-tolerant quantum computation. We establish a remarkable connection between the potential for quantum speed-up and the onset of negative values in a distinguished quasi-probability representation, a discrete analog of the Wigner function for quantum systems of odd dimension. This connection allows us to resolve an open question on the existence of bound states for magic-state distillation: we prove that there exist mixed states outside the convex hull of stabilizer states that cannot be distilled to non-stabilizer target states using stabilizer operations. We also provide an efficient simulation protocol for Clifford circuits that extends to a large class of mixed states, including bound universal states.Comment: 15 pages v4: This is a major revision. In particular, we have added a new section detailing an explicit extension of the Gottesman-Knill simulation protocol to deal with positively represented states and measurement (even when these are non-stabilizer). This paper also includes significant elaboration on the two main results of the previous versio

Stimulating uncertainty: Amplifying the quantum vacuum with superconducting circuits

The ability to generate particles from the quantum vacuum is one of the most profound consequences of Heisenberg's uncertainty principle. Although the significance of vacuum fluctuations can be seen throughout physics, the experimental realization of vacuum amplification effects has until now been limited to a few cases. Superconducting circuit devices, driven by the goal to achieve a viable quantum computer, have been used in the experimental demonstration of the dynamical Casimir effect, and may soon be able to realize the elusive verification of analogue Hawking radiation. This article describes several mechanisms for generating photons from the quantum vacuum and emphasizes their connection to the well-known parametric amplifier from quantum optics. Discussed in detail is the possible realization of each mechanism, or its analogue, in superconducting circuit systems. The ability to selectively engineer these circuit devices highlights the relationship between the various amplification mechanisms.Comment: 27 pages, 10 figures, version published in Rev. Mod. Phys. as a Colloquiu

General Classical Electrodynamics

Maxwell’s Classical Electrodynamics (MCED) suffers several inconsistencies: (1) the Lorentz force law of MCED violates Newton’s Third Law of Motion (N3LM) in case of stationary and divergent or convergent current distributions; (2) the general Jefimenko electric field solution of MCED shows two longitudinal far fields that are not waves; (3) the ratio of the electrodynamic energy-momentum of a charged sphere in uniform motion has an incorrect factor of 4/3. A consistent General Classical Electrodynamics (GCED) is presented that is based on Whittaker’s reciprocal force law that satisfies N3LM. The Whittaker force is expressed as a scalar magnetic field force, added to the Lorentz force. GCED is consistent only if it is assumed that the electric potential velocity in vacuum, ’a’, is much greater than ’c’ (a ≫ c); GCED reduces to MCED, in case we assume a = c. Longitudinal electromagnetic waves and superluminal longitudinal electric potential waves are predicted. This theory has been verified by seemingly unrelated experiments, such as the detection of superluminal Coulomb fields and longitudinal Ampère forces, and has a wide range of electrical engineering applications

Exponential Quantum Speed-ups are Generic

A central problem in quantum computation is to understand which quantum circuits are useful for exponential speed-ups over classical computation. We address this question in the setting of query complexity and show that for almost any sufficiently long quantum circuit one can construct a black-box problem which is solved by the circuit with a constant number of quantum queries, but which requires exponentially many classical queries, even if the classical machine has the ability to postselect. We prove the result in two steps. In the first, we show that almost any element of an approximate unitary 3-design is useful to solve a certain black-box problem efficiently. The problem is based on a recent oracle construction of Aaronson and gives an exponential separation between quantum and classical bounded-error with postselection query complexities. In the second step, which may be of independent interest, we prove that linear-sized random quantum circuits give an approximate unitary 3-design. The key ingredient in the proof is a technique from quantum many-body theory to lower bound the spectral gap of local quantum Hamiltonians.Comment: 24 pages. v2 minor correction

Entropy flow in near-critical quantum circuits

Near-critical quantum circuits are ideal physical systems for asymptotically large-scale quantum computers, because their low energy collective excitations evolve reversibly, effectively isolated from the environment. The design of reversible computers is constrained by the laws governing entropy flow within the computer. In near-critical quantum circuits, entropy flows as a locally conserved quantum current, obeying circuit laws analogous to the electric circuit laws. The quantum entropy current is just the energy current divided by the temperature. A quantum circuit made from a near-critical system (of conventional type) is described by a relativistic 1+1 dimensional relativistic quantum field theory on the circuit. The universal properties of the energy-momentum tensor constrain the entropy flow characteristics of the circuit components: the entropic conductivity of the quantum wires and the entropic admittance of the quantum circuit junctions. For example, near-critical quantum wires are always resistanceless inductors for entropy. A universal formula is derived for the entropic conductivity: \sigma_S(\omega)=iv^{2}S/\omega T, where \omega is the frequency, T the temperature, S the equilibrium entropy density and v the velocity of `light'. The thermal conductivity is Real(T\sigma_S(\omega))=\pi v^{2}S\delta(\omega). The thermal Drude weight is, universally, v^{2}S. This gives a way to measure the entropy density directly.Comment: 2005 paper published 2017 in Kadanoff memorial issue of J Stat Phys with revisions for clarity following referee's suggestions, arguments and results unchanged, cross-posting now to quant-ph, 27 page