QNu Labs devises qubit-powered solutions for the ‘trillion-dollar cyber-attack problem’ 

Start-up wants to foster a quantum leap in molecular problem-solving

Dewey Library - QC174.12.B35525 2019

At the first sign of trouble, one should exit credit risk funds: Arvind Chari, Head - Fixed Income and Alternatives, Quantum Advisors

Quantum House holds drive by parade | WTVX  cw34.com

In a step that brings silicon-based quantum computers closer to reality, researchers at Princeton University have built a device in which a single electron can pass its quantum information to a particle of light. The particle of light, or photon, can then act as a messenger to carry the information to other electrons, creating connections that form the circuits of a quantum computer.

The first ab initio aspherical structure refinement against experimental X-ray structure factors for polypeptides and proteins using a fragmentation approach to break up the protein into residues and solvent, thereby speeding up quantum-crystallographic Hirshfeld atom refinement (HAR) calculations, is described. It it found that the geometric and atomic displacement parameters from the new fragHAR method are essentially unchanged from a HAR on the complete unfragmented system when tested on dipeptides, tripeptides and hexapeptides. The largest changes are for the parameters describing H atoms involved in hydrogen-bond interactions, but it is shown that these discrepancies can be removed by including the interacting fragments as a single larger fragment in the fragmentation scheme. Significant speed-ups are observed for the larger systems. Using this approach, it is possible to perform a highly parallelized HAR in reasonable times for large systems. The method has been implemented in the TONTO software.

Corrections are published for the article by Caldararu et al. [(2019), Acta Cryst. D75, 368–380].

Quantum beats in fluorescence decay from Zeeman-split magnetic sublevels have been measured for helium Rydberg states excited by synchrotron radiation. The Zeeman quantum beats observed in this prototypical case were fitted with an equation from a theoretical formulation. It is proposed that Zeeman quantum beat measurement can be a useful way to simply evaluate the polarization characteristics of extreme ultraviolet light.

Given the current state of quantum computing and the significant challenges that still need to be overcome, it is highly unlikely that a quantum computer that can compromise public-key cryptography – a basis for the security of most of today’s computers and networks – will be built within the next decade, says a new report by the National Academies of Sciences, Engineering, and Medicine.

Polarised light forms the basis of many technologies, such as computer monitors. However, current approaches for making polarised light are inefficient, as they produce more than is ultimately used or needed. Researchers may now have found a way to directly produce polarised light using tiny nanostructures, called quantum dots, opening the way for more energy-efficient technologies.

The post IBM deal to fast track quantum chip development appeared first on The Lead SA.

Reality can never be perfectly simulated if you take into consideration quantum complexity.

Quantum theory offers an answer to one of the oldest and most fundamental questions in biochemistry.

After a successful Kickstarter campaign, the Somnox Sleep Robot launches on Amazon US exclusively with e-commerce expert Quantum Networks

Overtone Labs has entrusted the e-commerce experts at Quantum Networks to relaunch the Tune-Bot Gig, a simplified version of their original drum tuner.

Quantum networking commercialization will lead to opportunities in encryption key distribution, secure mobile payment systems, quantum sensors for the Internet-of-Things, networked atomic clocks, and networked quantum computers.

Immediately Expose Your Enterprise to Millions of Social Media Fans

Cover Girl has launched its newest clothing line in activewear on Amazon exclusively with e-commerce experts Quantum Networks.

In this article, we prove that the completeness of the Hamilton flow and essential self-dajointness are equivalent for real principal type operators on the circle. Moreover, we study spectral properties of these operators.

Connections between set theoretic Yang-Baxter and reflection equations and quantum integrable systems are investigated. We show that set theoretic $R$-matrices are expressed as twists of known solutions. We then focus on reflection and twisted algebras and we derive the associated defining algebra relations for $R$-matrices being Baxterized solutions of the $A$-type Hecke algebra ${cal H}_N(q=1)$. We show in the case of the reflection algebra that there exists a "boundary" finite sub-algebra for some special choice of "boundary" elements of the $B$-type Hecke algebra ${cal B}_N(q=1, Q)$. We also show the key proposition that the associated double row transfer matrix is essentially expressed in terms of the elements of the $B$-type Hecke algebra. This is one of the fundamental results of this investigation together with the proof of the duality between the boundary finite subalgebra and the $B$-type Hecke algebra. These are universal statements that largely generalize previous relevant findings, and also allow the investigation of the symmetries of the double row transfer matrix.

We investigate the quantum twistor bundle constructed as a $U(1)$-quotient of the quantum instanton bundle of Bonechi, Ciccoli and Tarlini. It is an example of a locally trivial noncommutative bundle fulfilling conditions of the framework recently proposed by Brzezi'nski and Szyma'nski. In particular, we give a detailed description of the corresponding $C^*$-algebra of 'continuous functions' on its noncommutative total space. Furthermore, we analyse a different construction of a quantum instanton bundle due to Landi, Pagani and Reina, find a basis of its polynomial algebra and discover an intriguing and unexpected feature of its enveloping $C^*$-algebra.

Quantum computing has evolved quickly in recent years and is showing significant benefits in a variety of fields. Malware analysis is one of those fields that could also take advantage of quantum computing. The combination of software used to locate the most frequent hashes and $n$-grams between benign and malicious software (KiloGram) and a quantum search algorithm could be beneficial, by loading the table of hashes and $n$-grams into a quantum computer, and thereby speeding up the process of mapping $n$-grams to their hashes. The first phase will be to use KiloGram to find the top-$k$ hashes and $n$-grams for a large malware corpus. From here, the resulting hash table is then loaded into a quantum machine. A quantum search algorithm is then used search among every permutation of the entangled key and value pairs to find the desired hash value. This prevents one from having to re-compute hashes for a set of $n$-grams, which can take on average $O(MN)$ time, whereas the quantum algorithm could take $O(sqrt{N})$ in the number of table lookups to find the desired hash values.

The quantum Fourier transform brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are examined. The capabilities of QFT-based addition and multiplication are improved with some modifications. The proposed operations are compared with the nearest quantum arithmetic operations. Furthermore, novel QFT-based subtraction and division operations are presented. The proposed arithmetic operations can perform non-modular operations on all signed numbers without any limitation by using less resources. In addition, novel quantum circuits of two's complement, absolute value and comparison operations are also presented by using the proposed QFT based addition and subtraction operations.

Noisy Intermediate-Scale Quantum (NISQ) computers are entering an era in which they can perform computational tasks beyond the capabilities of the most powerful classical computers, thereby achieving "Quantum Supremacy", a major milestone in quantum computing. NISQ Supremacy requires comparison with a state-of-the-art classical simulator. We report HPC simulations of hard random quantum circuits (RQC), which have been recently used as a benchmark for the first experimental demonstration of Quantum Supremacy, sustaining an average performance of 281 Pflop/s (true single precision) on Summit, currently the fastest supercomputer in the World. These simulations were carried out using qFlex, a tensor-network-based classical high-performance simulator of RQCs. Our results show an advantage of many orders of magnitude in energy consumption of NISQ devices over classical supercomputers. In addition, we propose a standard benchmark for NISQ computers based on qFlex.

The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to its stationary distribution is known as the classical mixing time. In this article, we deal with analog quantum algorithms for mixing. First, we provide an analog quantum algorithm that given a Markov chain, allows us to sample from its stationary distribution in a time that scales as the sum of the square root of the classical mixing time and the square root of the classical hitting time. Our algorithm makes use of the framework of interpolated quantum walks and relies on Hamiltonian evolution in conjunction with von Neumann measurements.

There also exists a different notion for quantum mixing: the problem of sampling from the limiting distribution of quantum walks, defined in a time-averaged sense. In this scenario, the quantum mixing time is defined as the time required to sample from a distribution that is close to this limiting distribution. Recently we provided an upper bound on the quantum mixing time for Erd"os-Renyi random graphs [Phys. Rev. Lett. 124, 050501 (2020)]. Here, we also extend and expand upon our findings therein. Namely, we provide an intuitive understanding of the state-of-the-art random matrix theory tools used to derive our results. In particular, for our analysis we require information about macroscopic, mesoscopic and microscopic statistics of eigenvalues of random matrices which we highlight here. Furthermore, we provide numerical simulations that corroborate our analytical findings and extend this notion of mixing from simple graphs to any ergodic, reversible, Markov chain.

Quantum dialogue is a process of two way secure and simultaneous communication using a single channel. Recently, a Measurement Device Independent Quantum Dialogue (MDI-QD) protocol has been proposed (Quantum Information Processing 16.12 (2017): 305). To make the protocol secure against information leakage, the authors have discarded almost half of the qubits remaining after the error estimation phase. In this paper, we propose two modified versions of the MDI-QD protocol such that the number of discarded qubits is reduced to almost one-fourth of the remaining qubits after the error estimation phase. We use almost half of their discarded qubits along with their used qubits to make our protocol more efficient in qubits count. We show that both of our protocols are secure under the same adversarial model given in MDI-QD protocol.

Correlation alignment (CORAL), a representative domain adaptation (DA) algorithm, decorrelates and aligns a labelled source domain dataset to an unlabelled target domain dataset to minimize the domain shift such that a classifier can be applied to predict the target domain labels. In this paper, we implement the CORAL on quantum devices by two different methods. One method utilizes quantum basic linear algebra subroutines (QBLAS) to implement the CORAL with exponential speedup in the number and dimension of the given data samples. The other method is achieved through a variational hybrid quantum-classical procedure. In addition, the numerical experiments of the CORAL with three different types of data sets, namely the synthetic data, the synthetic-Iris data, the handwritten digit data, are presented to evaluate the performance of our work. The simulation results prove that the variational quantum correlation alignment algorithm (VQCORAL) can achieve competitive performance compared with the classical CORAL.

In this technical report we give an elementary introduction to Quantum Computing for non-physicists. In this introduction we describe in detail some of the foundational Quantum Algorithms including: the Deutsch-Jozsa Algorithm, Shor's Algorithm, Grocer Search, and Quantum Counting Algorithm and briefly the Harrow-Lloyd Algorithm. Additionally we give an introduction to Solomonoff Induction, a theoretically optimal method for prediction. We then attempt to use Quantum computing to find better algorithms for the approximation of Solomonoff Induction. This is done by using techniques from other Quantum computing algorithms to achieve a speedup in computing the speed prior, which is an approximation of Solomonoff's prior, a key part of Solomonoff Induction. The major limiting factors are that the probabilities being computed are often so small that without a sufficient (often large) amount of trials, the error may be larger than the result. If a substantial speedup in the computation of an approximation of Solomonoff Induction can be achieved through quantum computing, then this can be applied to the field of intelligent agents as a key part of an approximation of the agent AIXI.

Methods for the synthesis of metal quantum clusters within the framework of a porous gel matrix are described. For example, Ag25(glutathione)18 quantum clusters are synthesized in a cross-linked polyacrylamide gel matrix. The methods can be performed on large-scale and yields monodispersed metal quantum clusters.

Quantum annealing may include applying and gradually removing disorder terms to qubits of a quantum processor, for example superconducting flux qubits of a superconducting quantum processor. A problem Hamiltonian may be established by applying control signals to the qubits, an evolution Hamiltonian established by applying disorder terms, and annealing by gradually removing the disorder terms. Change in persistent current in the qubits may be compensated. Multipliers may mediate coupling between various qubits and a global signal line, for example by applying respective scaling factors. Two global signal lines may be arranged in an interdigitated pattern to couple to respective qubits of a communicatively coupled pair of qubits. Pairs of qubits may be communicatively isolated and used to measure a response of one another to defined signals.

A method and apparatus for forming and distributing quantum encryption keys. A first quantum signal generated by a number generator in a communicator is transmitted through an aperture in the communicator to a receiving communicator. A second quantum signal is received through the aperture at the communicator from a transmitting communicator. The first quantum signal is isolated from the second quantum signal such that the first quantum signal is transmitted from the communicator in response to the first quantum signal passing through the aperture and such that the second quantum signal is received at a number detector in the communicator in response to the second quantum signal passing through the aperture.