Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Chinese Physics B

Implementation of ternary Shor’s algorithm based on vibrational states of an ion in anharmonic potential

Wei Liu, Shuming Chen, Jian Zhang, Chun-Wang Wu, Wei Wu, Ping‐Xing Chen

Published Feb 26, 2015• 2 citations
Publisher

Abstract

It is widely believed that Shor’s factoring algorithm provides a driving force to boost the quantum computing research. However, a serious obstacle to its binary implementation is the large number of quantum gates. Non-binary quantum computing is an efficient way to reduce the required number of elemental gates. Here, we propose optimization schemes for Shor’s algorithm implementation and take a ternary version for factorizing 21 as an example. The optimized factorization is achieved by a two-qutrit quantum circuit, which consists of only two single qutrit gates and one ternary controlled-NOT gate. This two-qutrit quantum circuit is then encoded into the nine lower vibrational states of an ion trapped in a weakly anharmonic potential. Optimal control theory (OCT) is employed to derive the manipulation electric field for transferring the encoded states. The ternary Shor’s algorithm can be implemented in one single step. Numerical simulation results show that the accuracy of the state transformations is about 0.9919.

DOI
10.1088/1674-1056/24/3/033701

Related papers

Feasibility of encoding Shor's algorithm into the motional states of an ion in the anharmonic trap

Lei Wang, Dmitri Babikov

We demonstrate theoretically that it may be possible to encode states of a multi-qubit system into the progression of quantized motional∕vibrational levels of an ion trapped in a weakly anharmonic potential. Control over such register of quantum information is achieved by applying oscillatory radio-frequency fields shaped optimally for excitation of the desired state-to-state transitions. Anharmonicity of the vibrational spectrum plays a key role in this approach to the control and quantum computation, since it allows resolving different state-to-state transitions and addressing them selectively. Optimal control theory is used to derive pulses for implementing the four-qubit version of Shor's algorithm in a single step. Accuracy of the qubit-state transformations, reached in the numerical simulations, is around 0.999. Very detailed insight is obtained by analysis of the time-evolution of state populations and by spectral analysis of the optimized pulse.

The Journal of Chemical Physics•Aug 8, 2012•6 citations

Computational study of vibrational qubits in anharmonic linear ion traps

Lei Wang

A string of cold ions confined in a linear trap represents a man-made quantum object with a broad range of applications in atomic and molecular spectroscopy, such as high-precision measurement of atomic properties. An efficient isolation from the environment guarantees excellent coherent properties of such systems and makes them suitable for practical realization of the quantum information processing. The pioneering theoretical [Cirac and Zoller] and experimental [Wineland and Monroe] work in 1990s resulted in the explosive expansion of this field during the last decade. In this dissertation an alternative new method for controlling the quantized motional/vibrational states of ions in a trap is explored theoretically. It is proposed to create small anharmonicity in the trapping potential which would modify the spectrum of states and allow addressing the state-to-state transitions selectively. In this approach all ions remain in the ground electronic state and their motion is controlled adiabatically and coherently by applying the optimally shaped electric fields (RF). The optimal control theory, accurate numerical calculation of the energies and wavefunctions, and numerical propagation of wave packets are employed. Two sources of vibrational anharmonicity are studied: the intrinsic Coulomb anharmonicity due to the ion-ion interactions and the external anharmonicity of the trapping potential. It is shown that the magnitude of Coulomb anharmonicity is insufficient for the control. In contrast, anharmonicity of the trapping potential allows controlling the motion of ions very accurately. It is demonstrated that one ion in a slightly anharmonic trap can be easily controlled and used to represent one qubit. A multi-qubit system can be created by employing a long progression of states of a single ion, or by trapping multiple ions and controlling several normal vibration modes of the ion string. Up to four qubits are modeled in this work and accurate pulses are optimized for a set of universal quantum gates: NOT, conditional NOT (CNOT) and Hadamard transformation. The control field for Shor's algorithm (quantum algorithm for factorization onto prime numbers) is also obtained. It is demonstrated that a careful choice of system properties allows achieving very high accuracy of qubit transformations, up to 0.999.

•Jan 1, 2012•0 citations

Factoring with qutrits: Shor's algorithm on ternary and metaplectic quantum architectures

Alex Bocharov, Martin Roetteler, Krysta M. Svore

We determine the cost of performing Shor's algorithm for integer factorization on a ternary quantum computer, using two natural models of universal fault-tolerant computing: (i) a model based on magic state distillation that assumes the availability of the ternary Clifford gates, projective measurements, classical control as its natural instrumentation set; (ii) a model based on a metaplectic topological quantum computer (MTQC). A natural choice to implement Shor's algorithm on a ternary quantum computer is to translate the entire arithmetic into a ternary form. However, it is also possible to emulate the standard binary version of the algorithm by encoding each qubit in a three-level system. We compare the two approaches and analyze the complexity of implementing Shor's period-finding function in the two models. We also highlight the fact that the cost of achieving universality through magic states in MTQC architecture is asymptotically lower than in generic ternary case.

arXiv:1605.02756•Physical Review A•Jul 5, 2017•118 citations

Vibrational computing: Simulation of a full adder by optimal control

L. Bomble, David Lauvergnat, F. Remacle +1 more

Within the context of vibrational molecular quantum computing, we investigate the implementation of a full addition of two binary digits and a carry that provides the sum and the carry out. Four qubits are necessary and they are encoded into four different normal vibrational modes of a molecule. We choose the bromoacetyl chloride molecule because it possesses four bright infrared active modes. The ground and first excited states of each mode form the one-qubit computational basis set. Two approaches are proposed for the realization of the full addition. In the first one, we optimize a pulse that implements directly the entire addition by a single unitary transformation. In the second one, we decompose the full addition in elementary quantum gates, following a scheme proposed by Vedral et al. [Phys. Rev. A 54, 147 (1996)]. Four elementary quantum gates are necessary, two two-qubit CNOT gates (controlled NOT) and two three-qubit TOFFOLI gates (controlled-controlled NOT). All the logic operations consist in one-qubit flip. The logic implementation is therefore quasiclassical and the readout is based on a population analysis of the vibrational modes that does not take the phases into account. The fields are optimized by the multitarget extension of the optimal control theory involving all the transformations among the 2(4) qubit states. A single cycle of addition without considering the preparation or the measure or copy of the result can be carried out in a very competitive time, on a picosecond time scale.

The Journal of Chemical Physics•Feb 14, 2008•39 citations

Implementing Shor’s algorithm on Josephson charge qubits

Juha J. Vartiainen, A. O. Niskanen, Mikio Nakahara +1 more

We investigate the physical implementation of Shor's factorization algorithm on a Josephson charge qubit register. While we pursue a universal method to factor a composite integer of any size, the scheme is demonstrated for the number 21. We consider both the physical and algorithmic requirements for an optimal implementation when only a small number of qubits are available. These aspects of quantum computation are usually the topics of separate research communities; we present a unifying discussion of both of these fundamental features bridging Shor's algorithm to its physical realization using Josephson junction qubits. In order to meet the stringent requirements set by a short decoherence time, we accelerate the algorithm by decomposing the quantum circuit into tailored two- and three-qubit gates and we find their physical realizations through numerical optimization.

arXiv:quant-ph/0308171•Physical Review A•Jul 30, 2004•23 citations

Quantum Integer Factorization by 3 Different Methods, Their Implementations and Results

Jiří Tomčala

The content of this poster is a description of the implementation of two well-known quantum integer factorization methods and, in addition, a proposal of a new, third way along with some examples of its use. For all three methods, the measured results of their circuits will be shown.The first method is Shor's algorithm, where a quantum circuit is used only to find the period of a specially assembled modular exponentiating function. The rest of the algorithm is preprocessing and postprocessing that can be done on a classical computer, so one could say that this is a hybrid algorithm. New results of the successful factorization of the number 119, performed by this algorithm on a real 7-qubit quantum computer, will be presented. It is worth mentioning here that the highest number successfully factorized by this algorithm on a real quantum computer so far was 35.The second method is variational quantum factorization (VQF). In this method, preprocessing builds a system of equations based on the classical binary multiplication procedure of two numbers, resulting in a factorized number. This system of equations is then used to form a Hamiltonian in such a way that its ground state corresponds to the solution of this equation system. Only now the hybrid quantum optimization comes into play to iteratively find this ground state. The advantage over Shor's algorithm is that this method does not require a fault-tolerant quantum computer, but on the other hand it approaches the solution iteratively using a classical computer, which reduces the potential quantum advantage.The new, third method employs Grover's search algorithm in an unusual way to create a quantum factorization circuit. A key part of this approach is the quantum implementation of a multiplying oracle. The main advantage of this method over the previous ones is that it can be used to assemble a relatively simple universal factorization circuit. Moreover, there is almost no preprocessing and postprocessing required. This method is still under development, but this poster will present the first results.

•Dec 18, 2025•0 citations
It is widely believed that Shor’s factoring algorithm provides a driving force to boost the quantum computing research. However, a serious obstacle to its binary implementation is the large number of quantum gates. Non-binary quantum computing is an efficient way to reduce the required number of elemental gates. Here, we propose optimization schemes for Shor’s algorithm implementation and take a ternary version for factorizing 21 as an example. The optimized factorization is achieved by a two-qutrit quantum circuit, which consists of only two single qutrit gates and one ternary controlled-NOT gate. This two-qutrit quantum circuit is then encoded into the nine lower vibrational states of an ion trapped in a weakly anharmonic potential. Optimal control theory (OCT) is employed to derive the manipulation electric field for transferring the encoded states. The ternary Shor’s algorithm can be implemented in one single step. Numerical simulation results show that the accuracy of the state transformations is about 0.9919.
We demonstrate theoretically that it may be possible to encode states of a multi-qubit system into the progression of quantized motional∕vibrational levels of an ion trapped in a weakly anharmonic potential. Control over such register of quantum information is achieved by applying oscillatory radio-frequency fields shaped optimally for excitation of the desired state-to-state transitions. Anharmonicity of the vibrational spectrum plays a key role in this approach to the control and quantum computation, since it allows resolving different state-to-state transitions and addressing them selectively. Optimal control theory is used to derive pulses for implementing the four-qubit version of Shor's algorithm in a single step. Accuracy of the qubit-state transformations, reached in the numerical simulations, is around 0.999. Very detailed insight is obtained by analysis of the time-evolution of state populations and by spectral analysis of the optimized pulse.
A string of cold ions confined in a linear trap represents a man-made quantum object with a broad range of applications in atomic and molecular spectroscopy, such as high-precision measurement of atomic properties. An efficient isolation from the environment guarantees excellent coherent properties of such systems and makes them suitable for practical realization of the quantum information processing. The pioneering theoretical [Cirac and Zoller] and experimental [Wineland and Monroe] work in 1990s resulted in the explosive expansion of this field during the last decade. In this dissertation an alternative new method for controlling the quantized motional/vibrational states of ions in a trap is explored theoretically. It is proposed to create small anharmonicity in the trapping potential which would modify the spectrum of states and allow addressing the state-to-state transitions selectively. In this approach all ions remain in the ground electronic state and their motion is controlled adiabatically and coherently by applying the optimally shaped electric fields (RF). The optimal control theory, accurate numerical calculation of the energies and wavefunctions, and numerical propagation of wave packets are employed. Two sources of vibrational anharmonicity are studied: the intrinsic Coulomb anharmonicity due to the ion-ion interactions and the external anharmonicity of the trapping potential. It is shown that the magnitude of Coulomb anharmonicity is insufficient for the control. In contrast, anharmonicity of the trapping potential allows controlling the motion of ions very accurately. It is demonstrated that one ion in a slightly anharmonic trap can be easily controlled and used to represent one qubit. A multi-qubit system can be created by employing a long progression of states of a single ion, or by trapping multiple ions and controlling several normal vibration modes of the ion string. Up to four qubits are modeled in this work and accurate pulses are optimized for a set of universal quantum gates: NOT, conditional NOT (CNOT) and Hadamard transformation. The control field for Shor's algorithm (quantum algorithm for factorization onto prime numbers) is also obtained. It is demonstrated that a careful choice of system properties allows achieving very high accuracy of qubit transformations, up to 0.999.
We determine the cost of performing Shor's algorithm for integer factorization on a ternary quantum computer, using two natural models of universal fault-tolerant computing: (i) a model based on magic state distillation that assumes the availability of the ternary Clifford gates, projective measurements, classical control as its natural instrumentation set; (ii) a model based on a metaplectic topological quantum computer (MTQC). A natural choice to implement Shor's algorithm on a ternary quantum computer is to translate the entire arithmetic into a ternary form. However, it is also possible to emulate the standard binary version of the algorithm by encoding each qubit in a three-level system. We compare the two approaches and analyze the complexity of implementing Shor's period-finding function in the two models. We also highlight the fact that the cost of achieving universality through magic states in MTQC architecture is asymptotically lower than in generic ternary case.
Within the context of vibrational molecular quantum computing, we investigate the implementation of a full addition of two binary digits and a carry that provides the sum and the carry out. Four qubits are necessary and they are encoded into four different normal vibrational modes of a molecule. We choose the bromoacetyl chloride molecule because it possesses four bright infrared active modes. The ground and first excited states of each mode form the one-qubit computational basis set. Two approaches are proposed for the realization of the full addition. In the first one, we optimize a pulse that implements directly the entire addition by a single unitary transformation. In the second one, we decompose the full addition in elementary quantum gates, following a scheme proposed by Vedral et al. [Phys. Rev. A 54, 147 (1996)]. Four elementary quantum gates are necessary, two two-qubit CNOT gates (controlled NOT) and two three-qubit TOFFOLI gates (controlled-controlled NOT). All the logic operations consist in one-qubit flip. The logic implementation is therefore quasiclassical and the readout is based on a population analysis of the vibrational modes that does not take the phases into account. The fields are optimized by the multitarget extension of the optimal control theory involving all the transformations among the 2(4) qubit states. A single cycle of addition without considering the preparation or the measure or copy of the result can be carried out in a very competitive time, on a picosecond time scale.
We investigate the physical implementation of Shor's factorization algorithm on a Josephson charge qubit register. While we pursue a universal method to factor a composite integer of any size, the scheme is demonstrated for the number 21. We consider both the physical and algorithmic requirements for an optimal implementation when only a small number of qubits are available. These aspects of quantum computation are usually the topics of separate research communities; we present a unifying discussion of both of these fundamental features bridging Shor's algorithm to its physical realization using Josephson junction qubits. In order to meet the stringent requirements set by a short decoherence time, we accelerate the algorithm by decomposing the quantum circuit into tailored two- and three-qubit gates and we find their physical realizations through numerical optimization.
The content of this poster is a description of the implementation of two well-known quantum integer factorization methods and, in addition, a proposal of a new, third way along with some examples of its use. For all three methods, the measured results of their circuits will be shown.The first method is Shor's algorithm, where a quantum circuit is used only to find the period of a specially assembled modular exponentiating function. The rest of the algorithm is preprocessing and postprocessing that can be done on a classical computer, so one could say that this is a hybrid algorithm. New results of the successful factorization of the number 119, performed by this algorithm on a real 7-qubit quantum computer, will be presented. It is worth mentioning here that the highest number successfully factorized by this algorithm on a real quantum computer so far was 35.The second method is variational quantum factorization (VQF). In this method, preprocessing builds a system of equations based on the classical binary multiplication procedure of two numbers, resulting in a factorized number. This system of equations is then used to form a Hamiltonian in such a way that its ground state corresponds to the solution of this equation system. Only now the hybrid quantum optimization comes into play to iteratively find this ground state. The advantage over Shor's algorithm is that this method does not require a fault-tolerant quantum computer, but on the other hand it approaches the solution iteratively using a classical computer, which reduces the potential quantum advantage.The new, third method employs Grover's search algorithm in an unusual way to create a quantum factorization circuit. A key part of this approach is the quantum implementation of a multiplying oracle. The main advantage of this method over the previous ones is that it can be used to assemble a relatively simple universal factorization circuit. Moreover, there is almost no preprocessing and postprocessing required. This method is still under development, but this poster will present the first results.