Quantum key distribution (QKD) provides a physical-based way to conciliate keys between remote users securely. Simulation is an essential method for designing and optimizing QKD systems. We develop a universal simulation framework based on quantum operator descriptions of photon signals and optical devices. The optical devices can be freely combined and driven by the photon excitation events, which make it appropriate for arbitrary QKD systems in principle. Our framework focuses on realistic characters of optical devices and system structures. The imperfections of the devices and the non-local properties of a quantum system are taken into account when modeling. We simulate the single-photon and Hong-Ou-Mandel (HOM) interference optical units, which are fundamental of QKD systems. The results using this event-driven framework agree well with the theoretical results, which indicate its feasibility for QKD.
Making use of an universal quantum network or QCPU proposed by me [6], some special quantum networks for simulating some quantum systems are given out. Specially, it is obtained that the quantum network for the time evolution operator which can simulate, in general, Schrödinger equation.
When can a quantum system of finite dimension be used to simulate another quantum system of finite dimension? What restricts the capacity of one system to simulate another? In this paper we complete the program of studying what simulations can be done with entangling many-qudit Hamiltonians and local unitary control. By entangling we mean that every qudit is coupled to every other qudit, at least indirectly. We demonstrate that the only class of finite-dimensional entangling Hamiltonians that aren't universal for simulation is the class of entangling Hamiltonians on qubits whose Pauli operator…
On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
Graduate School of Engineering Science, The University of Osaka（大阪大学工学研究科）；Center for Quantum Information and Quantum Biology, The University of Osaka（大阪大学量子信息与量子生物学中心）；Center for Quantum Computing, RIKEN（理化学研究所量子计算中心）
We present a gauge invariant digitization of $(1+1)$d scalar quantum electrodynamics for an arbitrary spin truncation for qudit-based quantum computers. We provide a construction of the Trotter operator in terms of a universal qudit-gate set. The cost savings of using a qutrit based spin-1 encoding versus a qubit encoding are illustrated. We show that a simple initial state could be simulated on current qutrit based hardware using noisy simulations for two different native gate set.
We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for anti-symmetrization is given. Finally, a simulation of the Hubbard model is discussed in detail.
A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that closely approximate physical states obtained from a broad class of dynamical evolutions. I provide an overview of theoretical research into universal quantum simulators and the strategies for minimizing computational space and time costs. Applications to simulating many-body quantum simulation and solving linear equations are discussed.
There is a pressing need to develop new rechargeable battery technologies that can offer higher energy storage, faster charging, and lower costs. Despite the success of existing methods for the simulation of battery materials, they can sometimes fall short of delivering accurate and reliable results. Quantum computing has been discussed as an avenue to overcome these issues, but only limited work has been done to outline how they may impact battery simulations. In this work, we provide a detailed answer to the following question: how can a quantum computer be used to simulate key properties of…
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with $T$ gates whose underlying graph has treewidth $d$ can be simulated deterministically in $T^{O(1)}\exp[O(d)]$ time, which, in particular, is polynomial in $T$ if $d=O(\log T)$. Among many implications, we show efficient simulations for log-depth circuits whose gates apply to nearby qubits only, a natural constraint satisfied by most physical implementations. We also show that one-way quantum computation of Raussendorf and Briegel (Physical Review Letters, 86:5188…
An universal quantum network which can implement a general quantum computing is proposed. In this sense, it can be called the quantum central processing unit (QCPU). For a given quantum computing, its realization of QCPU is just its quantum network. QCPU is standard and easy-assemble because it only has two kinds of basic elements and two auxiliary elements. QCPU and its realizations are scalable, that is, they can be connected together, and so they can construct the whole quantum network to implement the general quantum algorithm and quantum simulating procedure.
We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a continuous-time quantum walk or by terminating an adiabatic algorithm. In either case, the universality property can be understood as arising from an efficient simulation of a programmable quantum circuit. Using gadget perturbation theory, one can demonstrate the same kind of universality for related Hamiltonian families acting on qubits in 2D. Our results demonstrat…
Universal quantum computers are potentially an ideal setting for simulating many-body quantum dynamics that is out of reach for classical digital computers. We use state-of-the-art IBM quantum computers to study paradigmatic examples of condensed matter physics -- we simulate the effects of disorder and interactions on quantum particle transport, as well as correlation and entanglement spreading. Our benchmark results show that the quality of the current machines is below what is necessary for quantitatively accurate continuous time dynamics of observables and reachable system sizes are small …
We describe a simple n-dimensional quantum cellular automaton (QCA) capable of simulating all others, in that the initial configuration and the forward evolution of any n-dimensional QCA can be encoded within the initial configuration of the intrinsically universal QCA. Several steps of the intrinsically universal QCA then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA.
We examine the problem of simulating lattice gauge theories on a universal quantum computer. The basic strategy of our approach is to transcribe lattice gauge theories in the Hamiltonian formulation into a Hamiltonian involving only Pauli spin operators such that the simulation can be performed on a quantum computer using only one and two qubit manipulations. We examine three models, the U(1), SU(2), and SU(3) lattice gauge theories which are transcribed into a spin Hamiltonian up to a cutoff in the Hilbert space of the gauge fields on the lattice. The number of qubits required for storing a p…
We introduce an intermediate quantum computing model built from translation-invariant Ising-interacting spins. Despite being non-universal, the model cannot be classically efficiently simulated unless the polynomial hierarchy collapses. Equipped with the intrinsic single-instance-hardness property, a single fixed unitary evolution in our model is sufficient to produce classically intractable results, compared to several other models that rely on implementation of an ensemble of different unitaries (instances). We propose a feasible experimental scheme to implement our Hamiltonian model using c…
We describe a nuclear magnetic resonance (NMR) experiment which implements an efficient one-to-two qubit phase-covariant cloning machine(QPCCM). In the experiment we have achieved remarkably high fidelities of cloning, 0.848 and 0.844 respectively for the original and the blank qubit. This experimental value is close to the optimal theoretical value of 0.854. We have also demonstrated how to use our phase-covariant cloning machine for quantum simulations of bit by bit eavesdropping in the four-state quantum key distribution protocol.
The Hubbard model may be the simplest model of particles interacting on a lattice, but simulation of its dynamics remains beyond the reach of current numerical methods. In this article, we show that general quantum computations can be encoded into the physics of wave packets propagating through a planar graph, with scattering interactions governed by the fermionic Hubbard model. Therefore, simulating the model on planar graphs is as hard as simulating quantum computation. We give two different arguments, demonstrating that the simulation is difficult both for wave packets prepared as excitatio…
It is important to protect quantum information against decoherence and operational errors, and quantum error-correcting (QEC) codes are the keys to solving this problem. Of course, just the existence of codes is not efficient. It is necessary to perform operations fault-tolerantly on encoded states because error-correction process (i.e., encoding, decoding, syndrome measurement and recovery) itself induces an error. By using simulation, this paper investigates the effects of some important QEC codes (the five qubit code, the seven qubit code and the nine qubit code) and their fault-tolerant op…
We prove that the theorems of TDDFT can be applied to a class of qubit Hamiltonians that are universal for quantum computation. The theorems of TDDFT applied to universal Hamiltonians imply that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. From a practical standpoint this opens the possibility of approximating observables of interest in quantum computations directly in terms of single-qubit quantities (i.e. as density functionals). Additionally, we also demonstrate that TDDFT provides an exact presc…
Boson Sampling is the problem of sampling from the same distribution as indistinguishable single photons at the output of a linear optical interferometer. It is an example of a non-universal quantum computation which is believed to be feasible in the near term and cannot be simulated on a classical machine. Like all purported demonstrations of "quantum supremacy", this motivates optimizing classical simulation schemes for a realistic model of the problem, in this case Boson Sampling when the implementations experience lost or distinguishable photons. Although current simulation schemes for suf…
The common security criterion d in quantum key distribution is taken to solve the universal composability problem in quantum key distribution as well as providing good general quantitative security guarantee. In this paper it is shown that these are a result of an invalid interpretation of d. The general security significance of d is analyzed in detail. The related issues of universality and attacker's side information are discussed.
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains for some important computational tasks. In the context of quantum information, "universal" refers to the ability to perform arbitrary unitary transformations in the system's computational space. The combination of arbitrary single-quantum-bit (qubit) gates with an entangling two-qubit gate is a gate set capable of achieving universal control of any number of q…
We construct a universal set of high fidelity quantum gates to be used on a sparse bipartite lattice with always-on Ising couplings. The gates are based on dynamical decoupling sequences using shaped pulses, they protect against low-frequency phase noise, and can be run in parallel on non-neighboring qubits. This makes them suitable for implementing quantum error correction with low-density parity check codes like the surface codes and their finite-rate generalizations. We illustrate the construction by simulating quantum Zeno effect with the $[[4,2,2]]$ toric code on a spin chain.
We investigate the universally non-equilibrium dynamics of superradiant phase transition in the anisotropic quantum Rabi model. By introducing position and momentum operators, we obtain the ground states and their excitation gaps for both normal and superradiant phases via perturbation theory. We analytically extract the critical exponents from the excitation gap and the diverging length scale near the critical point, and find that the critical exponents are independent upon the anisotropy ratio. Moreover, by simulating the real-time dynamics across the critical point, we numerically extract t…
We propose an efficient four-intensity decoy-state BB84 protocol and derive concise security bounds for this protocol with the universally composable finite-key analysis method. Comparing with the efficient three-intensity protocol, we find that our efficient four-intensity protocol can increase the secret key rate by at least $30\%$. Particularly, this increasing rate of secret key rate will be raised as the transmission distance increases. At a large transmission distance, our efficient four-intensity protocol can improve the performance of quantum key distribution profoundly.
Quantum information processing provides remarkable advantages over its classical counterpart. Quantum optical systems are proved to be sufficient for realizing general quantum tasks, which however often rely on single photon sources. In practice, imperfect single photon sources, such as weak coherent state source, are used instead, which will inevitably limit the power in demonstrating quantum effects. For instance, with imperfect photon sources, the key rate of the BB84 quantum key distribution protocol will be very low, which fortunately can be resolved by utilizing the decoy state method. A…
To gain deeper insight into the dynamics of complex quantum systems we need a quantum leap in computer simulations. We can not translate quantum behaviour arising with superposition states or entanglement efficiently into the classical language of conventional computers. The final solution to this problem is a universal quantum computer [1], suggested in 1982 and envisioned to become functional within the next decade(s); a shortcut was proposed via simulating the quantum behaviour of interest in a different quantum system, where all parameters and interactions can be controlled and the outcome…
A global quantum repeater network involving satellite-based links is likely to have advantages over fiber-based networks in terms of long-distance communication, since the photon losses in free space scale only polynomially with the distance -- compared to the exponential losses in optical fibers. To simulate the performance of such networks, we have introduced a scheme of large-scale event-based Monte Carlo simulation of quantum repeaters with multiple memories that can faithfully represent loss and imperfections in these memories. In this work, we identify the quantum key distribution rates …
The rise of programmable quantum devices has motivated the exploration of circuit models which could realize novel physics. A promising candidate is a class of hybrid circuits, where entangling unitary dynamics compete with disentangling measurements. Novel phase transitions between different entanglement regimes have been identified in their dynamical states, with universal properties hinting at unexplored critical phenomena. Trapped ion hardware is a leading contender for the experimental realization of such physics, which requires not only traditional two-qubit entangling gates, but a const…
Superconducting quantum circuits is one of the leading candidates for a universal quantum computer. Designing novel qubit and multiqubit superconducting circuits requires the ability to simulate and analyze the properties of a general circuit. In particular, going outside the transmon approach, we cannot make assumptions on anharmonicity, thus precluding blackbox quantization approaches and necessitating the formal circuit quantization approach. We consider and solve two issues involved in simulating general superconducting circuits. One of the issues is the handling of free modes in the circu…
Magnetic molecules, modelled as finite-size spin systems, are test-beds for quantum phenomena and could constitute key elements in future spintronics devices, long-lasting nanoscale memories or noise-resilient quantum computing platforms. Inelastic neutron scattering is the technique of choice to probe them, characterizing molecular eigenstates on atomic scales. However, although large magnetic molecules can be controllably synthesized, simulating their dynamics and interpreting spectroscopic measurements is challenging because of the exponential scaling of the required resources on a classica…
We provide an efficient approximation for the exponential of a local operator in quantum spin systems using tensor-network representations of a cluster expansion. We benchmark this cluster tensor network operator (cluster TNO) for one-dimensional systems, and show that the approximation works well for large real- or imaginary-time steps. We use this formalism for representing the thermal density operator of a two-dimensional quantum spin system at a certain temperature as a single cluster TNO, which we can then contract by standard contraction methods for two-dimensional tensor networks. We ap…
We introduce a unified formulation of variational methods for simulating ground state properties of quantum many-body systems. The key feature is a novel variational method over quantum circuits via infinitesimal unitary transformations, inspired by flow equation methods. Variational classes are represented as efficiently contractible unitary networks, including the matrix-product states of density matrix renormalization, multiscale entanglement renormalization (MERA) states, weighted graph states, and quantum cellular automata. In particular, this provides a tool for varying over classes of s…
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. The encoding is linear and hence does not carry any of the cost of the computation. We do this…
With the discovery of Majorana quasiparticles in semiconductor-superconductor hybrid structures, topologically protected qubits have emerged as a promising contender for quantum information processing. While the construction of a universal quantum computer with topological protection likely requires significant advances in materials science, intermediate-scale devices are nearly within the reach of current technology. As a near-term milestone for topological qubits, we propose a network of topological superconductors as a simulator of a large variety of quantum spin systems, including those wi…
We consider the problem of constructing a "universal set" of Markovian processes, such that any Markovian open quantum system, described by a one-parameter semigroup of quantum channels, can be simulated through sequential simulations of processes from the universal set. In particular, for quantum systems of dimension $d$, we explicitly construct a universal set of semigroup generators, parametrized by $d^2-3$ continuous parameters, and prove that a necessary and sufficient condition for the dynamical simulation of a $d$ dimensional Markovian quantum system is the ability to implement a) quant…
As the realization of a fully operational quantum computer remains distant, quantum simulation, whereby one quantum system is engineered to simulate another, becomes a key goal of great practical importance. Here we report on a variational method exploiting the natural physics of cavity QED architectures to simulate strongly interacting quantum fields. Our scheme is broadly applicable to any architecture involving tunable and strongly nonlinear interactions with light; as an example, we demonstrate that existing cavity devices could simulate models of strongly interacting bosons. The scheme ca…
Privacy amplification is the art of shrinking a partially secret string Z to a highly secret key S. We show that, even if an adversary holds quantum information about the initial string Z, the key S obtained by two-universal hashing is secure, according to a universally composable security definition. Additionally, we give an asymptotically optimal lower bound on the length of the extractable key S in terms of the adversary's (quantum) knowledge about Z. Our result has applications in quantum cryptography. In particular, it implies that many of the known quantum key distribution protocols are …
Advances in photonics require photon-number resolved simulations of quantum optical experiments with Gaussian states. We demonstrate a simple and versatile method to simulate the photon statistics of general multimode Gaussian states. The derived generating functions enable simulations of the photon number distribution, cumulative probabilities, moments, and factorial moments of the photon statistics of Gaussian states as well as of multimode photon-added and photon-subtracted Gaussian states. Numerical results are obtained by automatic differentiation of these generating functions by employin…
Error mitigation is likely to be key in obtaining near term quantum advantage. In this work we present one of the first implementations of several Clifford data regression based methods which are used to mitigate the effect of noise in real quantum data. We explore the dynamics of the 1-D Ising model with transverse and longitudinal magnetic fields, highlighting signatures of confinement. We find in general Clifford data regression based techniques are advantageous in comparison with zero-noise extrapolation and obtain quantitative agreement with exact results for systems of 9 qubits with circ…
We present the method of decoy-state analysis after bit-flip error correction and using confidential observed numbers. Taking this tool we then construct a universal approach to sending-or-not-sending (SNS) protocol of twin-field quantum key distribution. In this improved protocol, the code bits are not limited to heralded events in time windows participated by pulses of intensity $μ_z$ and vacuum. All kinds of heralded events can be used for code bits to distill the final keys. The number of intensities (3 or 4) and the kinds of heralded events for code bits are automatically chosen by the ke…
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input state is the completely mixed state except for a single clean qubit, and only a single output qubit is measured at the end of the computing. It is proved that the restriction of quantum computation to the DQC1 model does not change the complexity classes NQP and SBQP. As a main consequence, it follows that the DQC1 model cannot be efficiently simulated by classical computers unless the polynomial-time hierarchy collapses to the second level (more precisely, to AM), which ans…
