Searcharxiv⌕ Search

arXiv subjects

Kae Nemoto

Publications and source records attributed to Kae Nemoto.

At least 55 records · Page 3Linked to original sources

Resource Reduction in Multiplexed High-Dimensional Quantum Reed-Solomon Codes

Quantum communication technologies will play an important role in quantum information processing in the near future as we network devices together. However, their implementation is still a challenging task due to both loss and gate errors. Quantum error correction codes are one important technique to address this issue. In particular, the Quantum Reed-Solomon codes are known to be quite efficient for quantum communication tasks. The high degree of physical resources required, however, makes such a code difficult to use in practice. A recent technique called quantum multiplexing has been shown to reduce resources by using multiple degrees of freedom of a photon. In this work, we propose a method to decompose multi-controlled gates using fewer $\rm{CX}$ gates via this quantum multiplexing technique. We show that our method can significantly reduce the required number of $\rm{CX}$ gates needed in the encoding circuits for the quantum Reed-Solomon code. Our approach is also applicable to many other quantum error correction codes and quantum algorithms, including Grovers and quantum walks.

quant-ph↗

Bell correlations in a split two-mode-squeezed Bose-Einstein condensate

We propose and analyze a protocol for observing a violation of the Clauser-Horne-Shimony-Holt (CHSH) Bell inequality using two spatially separated Bose-Einstein condensates (BECs). To prepare the Bell-correlated state, spin-changing collisions are used to first prepare a two-mode squeezed BEC. This is then split into two BECs by controlling the spatial wavefunction, e.g., by modifying the trapping potential. Finally, spin-changing collisions are also exploited locally, to compensate local squeezing terms. The correlators appearing in the inequality are evaluated using three different approaches. In the first approach, correlators are estimated using normalized expectation values of number operators, in a similar way to evaluating continuous-variable Bell inequalities. An improvement to this approach is developed using the sign-binning of total spin measurements, which allows for the construction of two-outcome measurements and violations of the CHSH inequality without auxiliary assumptions. Finally, we show a third approach where maximal violations of the CH inequality can be obtained by assigning zero values to local vacua outcomes under a no-enhancement assumption. The effect of loss and imperfect detection efficiency is investigated and the observed violations are found to be robust to noise.

quant-ph↗

Perspective on witnessing entanglement in hybrid quantum systems

Hybrid quantum systems aim at combining the advantages of different physical systems and to produce novel quantum devices. In particular, the hybrid combination of superconducting circuits and spins in solid-state crystals is a versatile platform to explore many quantum electrodynamics problems. Recently, the remote coupling of nitrogen-vacancy center spins in diamond via a superconducting bus was demonstrated. However, a rigorous experimental test of the quantum nature of this hybrid system and in particular entanglement is still missing. We review the theoretical ideas to generate and detect entanglement, and present our own scheme to achieve this.

quant-ph↗

Quantum reservoir computation utilising scale-free networks

Today's quantum processors composed of fifty or more qubits have allowed us to enter a computational era where the output results are not easily simulatable on the world's biggest supercomputers. What we have not seen yet, however, is whether or not such quantum complexity can be ever useful for any practical applications. A fundamental question behind this lies in the non-trivial relation between the complexity and its computational power. If we find a clue for how and what quantum complexity could boost the computational power, we might be able to directly utilize the quantum complexity to design quantum computation even with the presence of noise and errors. In this work we introduce a new reservoir computational model for pattern recognition showing a quantum advantage utilizing scale-free networks. This new scheme allows us to utilize the complexity inherent in the scale-free networks, meaning we do not require programing nor optimization of the quantum layer even for other computational tasks. The simplicity in our approach illustrates the computational power in quantum complexity as well as provide new applications for such processors.

quant-ph↗

Reservoir-assisted energy migration through multiple spin-domains

The transfer of energy through a network of nodes is fundamental to both how nature and current technology operates. Traditionally we think of the nodes in a network being coupled to channels that connect them and then energy is passed from node to channel to node until it reaches its targeted site. Here we introduce an alternate approach to this where our channels are replaced by collective environments (or actually reservoirs) which interact with pairs of nodes. We show how energy initially located at a specific node can arrive at a target node - even though that environment may be at zero temperate. Further we show that such a migration occurs on much faster time scales than the damping rate associated with a single spin coupled to the reservoir. Our approach shows the power of being able to tailor both the system & environment and the symmetries associated with them to provide new directions for future quantum technologies.

quant-ph↗

Visualising multiqubit correlatons using the Wigner function

Quantum engineering now allows to design and construct multi-qubit states in a range of physical systems. These states are typically quite complex in nature, with disparate, but relevant properties that include both single and multi-qubit coherences and even entanglement. All these properties can be assessed by reconstructing the density matrix of those states - but the large parameter space can mean physical insight of the nature of those states and their coherence can be hard to achieve. Here we explore how the Wigner function of a multipartite system and its visualization provides rich information on the nature of the state, not only at illustrative level but also at the quantitative level. We test our tools in a photonic architecture making use of the multiple degrees of freedom of two photons.

quant-ph↗

Quantum walks on a programmable two-dimensional 62-qubit superconducting processor

Quantum walks are the quantum mechanical analogue of classical random walks and an extremely powerful tool in quantum simulations, quantum search algorithms, and even for universal quantum computing. In our work, we have designed and fabricated an 8x8 two-dimensional square superconducting qubit array composed of 62 functional qubits. We used this device to demonstrate high fidelity single and two particle quantum walks. Furthermore, with the high programmability of the quantum processor, we implemented a Mach-Zehnder interferometer where the quantum walker coherently traverses in two paths before interfering and exiting. By tuning the disorders on the evolution paths, we observed interference fringes with single and double walkers. Our work is an essential milestone in the field, brings future larger scale quantum applications closer to realization on these noisy intermediate-scale quantum processors.

quant-ph↗

Dephasing-induced growth of discrete crystalline order in spin networks

A quantum phase of matter can be understood from the symmetry of the system's Hamiltonian. The system symmetry along the time axis has been proposed to show a new phase of matter referred as discrete-time crystals (DTCs). A DTC is a quantum phase of matter in non-equilibrium systems, and it is also intimately related to the symmetry of the initial state. DTCs that are stable in isolated systems are not necessarily resilient to the influence from the external reservoir. In this paper, we discuss the dynamics of the DTCs under the influence of an environment. Specifically, we consider a non-trivial situation in which the initial state is prepared to partly preserve the symmetry of the Liouvillian. Our analysis shows that the entire system evolves towards a DTC phase and is stabilised by the effect of dephasing. Our results provide a new understanding of quantum phases emerging from the competition between the coherent and incoherent dynamics in dissipative non-equilibrium quantum systems.

quant-ph↗

Practical Limits of Error Correction for Quantum Metrology

Noise is the greatest obstacle in quantum metrology that limits it achievable precision and sensitivity. There are many techniques to mitigate the effect of noise, but this can never be done completely. One commonly proposed technique is to repeatedly apply quantum error correction. Unfortunately, the required repetition frequency needed to recover the Heisenberg limit is unachievable with the existing quantum technologies. In this article we explore the discrete application of quantum error correction with current technological limitations in mind. We establish that quantum error correction can be beneficial and highlight the factors which need to be improved so one can reliably reach the Heisenberg limit level precision.

quant-ph↗

Robustness of Noisy Quantum Networks

Quantum networks are a new paradigm of complex networks, allowing us to harness networked quantum technologies and to develop a quantum internet. But how robust is a quantum network when its links and nodes start failing? We show that quantum networks based on typical noisy quantum-repeater nodes are prone to discontinuous phase transitions with respect to the random loss of operating links and nodes, abruptly compromising the connectivity of the network, and thus significantly limiting the reach of its operation. Furthermore, we determine the critical quantum-repeater efficiency necessary to avoid this catastrophic loss of connectivity as a function of the network topology, the network size, and the distribution of entanglement in the network. In particular, our results indicate that a scale-free topology is a crucial design principle to establish a robust large-scale quantum internet.

quant-ph↗

Chimera Time-Crystalline order in quantum spin networks

Symmetries are well known to have had a profound role in our understanding of nature and are a critical design concept for the realization of advanced technologies. In fact, many symmetry-broken states associated with different phases of matter appear in a variety of quantum technology applications. Such symmetries are normally broken in spatial dimension, however they can also be broken temporally leading to the concept of discrete time symmetries and their associated crystals. Discrete time crystals (DTCs) are a novel state of matter emerging in periodically-driven quantum systems. Typically, they have been investigated assuming individual control operations with uniform rotation errors across the entire system. In this work we explore a new paradigm arising from non-uniform rotation errors, where two dramatically different phases of matter coexist in well defined regions of space. We consider a quantum spin network possessing long-range interactions where different driving operations act on different regions of that network. What results from its inherent symmetries is a system where one region is a DTC, while the second is ferromagnetic. We envision our work to open a new avenue of research on Chimera-like phases of matter where two different phases coexist in space.

quant-ph↗

Double Nuclear Spin Relaxation in Hybrid Quantum Hall Systems

Recent advances in quantum engineering have given us the ability to design hybrid systems with novel properties normally not present in the regime they operate in. The coupling of spin ensembles and magnons to microwave resonators has for instance lead to a much richer understanding of collective effects in these systems and their potential quantum applications. We can also hybridize electron and nuclear spin ensembles together in the solid-state regime to investigate collective effects normally only observed in the atomic, molecular and optical world. Here we explore in the solid state regime the dynamics of a double domain nuclear spin ensemble coupled to the Nambu-Goldstone boson in GaAs semiconductors and show it exhibits both collective and individual relaxation (thermalization) on very different time scales. Further the collective relaxation of the nuclear spin ensemble is what one would expect from superradiant decay. This opens up the possibility for the exploration of novel collective behaviour in solid state systems where the natural energies associated with those spins are much less than the thermal energy.

cond-mat.mes-hall↗

Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus

Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a topological circuit, for which braided circuits represent one candidate model. Given the large overhead associated with encoded circuits, it is paramount to reduce their size in terms of computation time and qubit number through circuit compression. While these optimizations have typically been performed in the language of three-dimensional diagrams, such a representation does not allow an efficient, general, and scalable approach to reduction or verification. We propose the use of the ZX-calculus as an intermediate language for braided circuit compression, demonstrating advantage by comparing results using this approach with those previously obtained for the compression of A- and Y-state distillation circuits. We then provide a benchmark of our method against a small set of Clifford+T circuits, yielding compression percentages of 77%. Our results suggest that the overheads of braided, defect-based circuits are comparable to those of their lattice-surgery counterparts, restoring the potential of this model for surface-code quantum computation.

quant-ph↗

Quantum metamorphism

Crystals form regular and robust structures that under extreme conditions can melt and recrystallize into different arrangements in a process that is called crystal metamorphism. While crystals exist due to the breaking of a continuous translation symmetry in space, it has recently been proposed that discrete crystalline order can also emerge in time and give raise to a novel phase of matter named discrete time crystal (DTC). In this paper, we join these two ideas and propose a model for quantum metamorphism between two DTCs of different periodicity, a 2T and 4T-DTC. In our model the conditions for metamorphism come from the modulation of perturbative terms in the 4T-DTC Hamiltonian that gradually melt its structure and transform it into a 2T-DTC. This process is studied in detail from the viewpoint of manybody physics of periodically driven systems. We also propose a protocol to experimentally observe quantum metamorphism using current quantum technology.

quant-ph↗

Resource reduction for distributed quantum information processing using quantum multiplexed photons

Distributed quantum information processing is based on the transmission of quantum data over lossy channels between quantum processing nodes. These nodes may be separated by a few microns or on planetary scale distances, but transmission losses due to absorption/scattering in the channel are the major source of error for most distributed quantum information tasks. Of course quantum error detection (QED) /correction (QEC) techniques can be used to mitigate such effects but error detection approaches have severe performance limitations due to the signaling constraints between nodes and so error correction approaches are preferable -assuming one has sufficient high quality local operations. Typically, performance comparisons between loss-mitigating codes assume one encoded qubit per photon. However single photons can carry more than one qubit of information and so our focus in this work is to explore whether loss-based QEC codes utilizing quantum multiplexed photons are viable and advantageous, especially as photon loss results in more than one qubit of information being lost. We show that quantum multiplexing enables significant resource reduction: in terms of the number of single photon sources while at the same time maintaining (or even lowering) the number of two-qubit gates required. Further, our multiplexing approach requires only conventional optical gates already necessary for the implementation of these codes.

quant-ph↗

Cloning of Quantum Entanglement

Quantum no-cloning, the impossibility of perfectly cloning an arbitrary unknown quantum state, is one of the most fundamental limitations due to the laws of quantum mechanics, which underpin the physical security of quantum key distribution. Quantum physics does allow, however, approximate cloning with either imperfect state fidelity and/or probabilistic success. Whereas approximate quantum cloning of single-particle states has been tested previously, experimental cloning of quantum entanglement -- a highly non-classical correlation -- remained unexplored. Based on a multiphoton linear optics platform, we demonstrate quantum cloning of two photon entangled states for the first time. Remarkably our results show that one maximally entangled photon pair can be broadcast into two entangled pairs, both with state fidelities above 50\%. Our results are a key step towards cloning of complex quantum systems, and are likely to provide new insights into quantum entanglement.

quant-ph↗

Quantum teleportation of physical qubits into logical code-spaces

Quantum error correction is an essential tool for reliably performing tasks for processing quantum information on a large scale. However, integration into quantum circuits to achieve these tasks is problematic when one realizes that non-transverse operations, which are essential for universal quantum computation, lead to the spread of errors. Quantum gate teleportation has been proposed as an elegant solution for this. Here, one replaces these fragile, non-transverse inline gates with the generation of specific, highly entangled offline resource states that can be teleported into the circuit to implement the non-transverse gate. As the first important step, we create a maximally entangled state between a physical and an error-correctable logical qubit and use it as a teleportation resource. We then demonstrate the teleportation of quantum information encoded on the physical qubit into the error-corrected logical qubit with fidelities up to 0.786. Our scheme can be designed to be fully fault-tolerant so that it can be used in future large-scale quantum technologies.

quant-ph↗

Fully-programmable universal quantum simulator with a one-dimensional quantum processor

Current quantum devices execute specific tasks that are hard for classical computers and have the potential to solve problems such as quantum simulation of material science and chemistry, even without error correction. For practical applications it is highly desirable to reconfigure the connectivity of the device, which for superconducting quantum processors is determined at fabrication. In addition, we require a careful design of control lines and couplings to resonators for measurements. Therefore, it is a cumbersome and slow undertaking to fabricate a new device for each problem we want to solve. Here we periodically drive a one-dimensional chain to engineer effective Hamiltonians that simulate arbitrary connectivities. We demonstrate the capability of our method by engineering driving sequences to simulate star, all-to-all, and ring connectivities. We also simulate a minimal example of the 3-SAT problem including three-body interactions, which are difficult to realize experimentally. Our results open a new paradigm to perform quantum simulation in near term quantum devices by enabling us to stroboscopically simulate arbitrary Hamiltonians with a single device and optimized driving sequences

quant-ph↗