Tim Byrnes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tim Byrnes has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Yoshihisa Yamamoto
National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan
4 shared publicationsKai Yan
National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan
2 shared publicationsShinsuke Koyama
The Institute of Statistical Mathematics 10-3 Midori-cho 190-8562 Tachikawa Tokyo Japan
2 shared publicationsAhmed Abdelrahman
Department of Physics University of California 94720 Berkeley California USA
1 shared publicationAlexey Pyrkov
Institute of Problems of Chemical Physics RAS Acad. Semenov av
1 shared publicationAndreas Thomasen
National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-ku 101-8430 Tokyo Japan
1 shared publication
Latest Publications
- Open Access
Macroscopic quantum information processing using spin coherent states
Previously a new scheme of quantum information processing based on spin coherent states of two component Bose-Einstein condensates was proposed (Byrnes {\it et al.} Phys. Rev. A 85, 40306(R)). In this paper we give a more detailed exposition of the scheme, expanding on several aspects that were not discussed in full previously. The basic concept of the scheme is that spin coherent states are used instead of qubits to encode qubit information, and manipulated using collective spin operators. The scheme goes beyond the continuous variable regime such that the full space of the Bloch sphere is used. We construct a general framework for quantum algorithms to be executed using multiple spin coherent states, which are individually controlled. We illustrate the scheme by applications to quantum information protocols, and discuss possible experimental implementations. Decoherence effects are analyzed under both general conditions and for the experimental implementation proposed.
Open AccessMacroscopic quantum information processing using spin coherent states
Previously a new scheme of quantum information processing based on spin coherent states of two component Bose-Einstein condensates was proposed (Byrnes {\it et al.} Phys. Rev. A 85, 40306(R)). In this paper we give a more detailed exposition of the scheme, expanding on several aspects that were not discussed in full previously. The basic concept of the scheme is that spin coherent states are used instead of qubits to encode qubit information, and manipulated using collective spin operators. The scheme goes beyond the continuous variable regime such that the full space of the Bloch sphere is used. We construct a general framework for quantum algorithms to be executed using multiple spin coherent states, which are individually controlled. We illustrate the scheme by applications to quantum information protocols, and discuss possible experimental implementations. Decoherence effects are analyzed under both general conditions and for the experimental implementation proposed.
- Open Access
- 30 August 2013
- Published by Springer Nature in Scientific Reports
- Vol. 3 (1) , 2531
Neural networks using two-component Bose-Einstein condensates
The authors previously considered a method of solving optimization problems by using a system of interconnected network of two component Bose-Einstein condensates (Byrnes, Yan, Yamamoto New J. Phys. 13, 113025 (2011)). The use of bosonic particles gives a reduced time proportional to the number of bosons N for solving Ising model Hamiltonians by taking advantage of enhanced bosonic cooling rates. Here we consider the same system in terms of neural networks. We find that up to the accelerated cooling of the bosons the previously proposed system is equivalent to a stochastic continuous Hopfield network. This makes it clear that the BEC network is a physical realization of a simulated annealing algorithm, with an additional speedup due to bosonic enhancement. We discuss the BEC network in terms of neural network tasks such as learning and pattern recognition and find that the latter process may be accelerated by a factor of N.
- 30 August 2013
- Published by Springer Nature in Scientific Reports
- Vol. 3 (1) , 2531
Open AccessNeural networks using two-component Bose-Einstein condensates
The authors previously considered a method of solving optimization problems by using a system of interconnected network of two component Bose-Einstein condensates (Byrnes, Yan, Yamamoto New J. Phys. 13, 113025 (2011)). The use of bosonic particles gives a reduced time proportional to the number of bosons N for solving Ising model Hamiltonians by taking advantage of enhanced bosonic cooling rates. Here we consider the same system in terms of neural networks. We find that up to the accelerated cooling of the bosons the previously proposed system is equivalent to a stochastic continuous Hopfield network. This makes it clear that the BEC network is a physical realization of a simulated annealing algorithm, with an additional speedup due to bosonic enhancement. We discuss the BEC network in terms of neural network tasks such as learning and pattern recognition and find that the latter process may be accelerated by a factor of N.
- Open Access
- 1 November 2011
- Published by IOP Publishing in New Journal of Physics
- Vol. 13 (11) , 113025
Accelerated optimization problem search using Bose–Einstein condensation
- 1 November 2011
- Published by IOP Publishing in New Journal of Physics
- Vol. 13 (11) , 113025
Open AccessAccelerated optimization problem search using Bose–Einstein condensation
- Top Cited Papers
- 17 February 2006
- Published by American Physical Society (APS) in Physical Review A
- Vol. 73 (2) , 022328
Simulating lattice gauge theories on a quantum computer
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 particular state is found to have a linear dependence on the total number of lattice sites. The number of qubit operations required for performing the time evolution corresponding to the Hamiltonian is found to be between a linear to quadratic function of the number of lattice sites, depending on the arrangement of qubits in the quantum computer. We remark that our results may also be easily generalized to higher gauge theories.- 17 February 2006
- Published by American Physical Society (APS) in Physical Review A
- Vol. 73 (2) , 022328
Top Cited PapersSimulating lattice gauge theories on a quantum computer
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 particular state is found to have a linear dependence on the total number of lattice sites. The number of qubit operations required for performing the time evolution corresponding to the Hamiltonian is found to be between a linear to quadratic function of the number of lattice sites, depending on the arrangement of qubits in the quantum computer. We remark that our results may also be easily generalized to higher gauge theories. - Open Access
Simulating lattice gauge theories on a quantum computer
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 particular state is found to have a linear dependence with the total number of lattice sites. The number of qubit operations required for performing the time evolution corresponding to the Hamiltonian is found to be between a linear to quadratic function of the number of lattice sites, depending on the arrangement of qubits in the quantum computer. We remark that our results may also be easily generalized to higher SU(N) gauge theories.
Open AccessSimulating lattice gauge theories on a quantum computer
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 particular state is found to have a linear dependence with the total number of lattice sites. The number of qubit operations required for performing the time evolution corresponding to the Hamiltonian is found to be between a linear to quadratic function of the number of lattice sites, depending on the arrangement of qubits in the quantum computer. We remark that our results may also be easily generalized to higher SU(N) gauge theories.