Quantum computers ready to leap out of the lab in 2017

Castelvecchi, Davide

doi:10.1038/541009a

Cited by 107 publications

(92 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is necessary to find a new computing paradigm to explore * f.hu.the global properties of Boolean functions characterized in their exponential space.Quantum annealing [11] is an interesting alternative, and if the annealing progresses is sufficiently slow, natural quantum properties as quantum fluctuations and quantum tunneling effects can provide a quantum speedup in theory, at least for specific cases. More precisely, from the perspective of statistical theory, quantum-inspired systems can show a higher probability potentially to find the global optimum of multidimensional functions and can be seen as a global searching algorithm as compared with classical ones.Google, Microsoft, IBM and a host of labs and start-ups are on the verge of a quantum technology breakthrough [12][13][14]. Among them, D-Wave Systems, Inc.[15] is devoted to commercial quantum computing with prototypes based on the quantum annealing paradigm [16], and mainly aimed at three categories of software applications and algorithms: Monte Carlo simulations, optimization, and machine learning.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Quantum computing cryptography: Finding cryptographic Boolean functions with quantum annealing by a 2000 qubit D-wave quantum computer

Lamata

Sanz

et al. 2020

Physics Letters A

View full text Add to dashboard Cite

As the building block in symmetric cryptography, designing Boolean functions satisfying multiple properties is an important problem in sequence ciphers, block ciphers, and hash functions. However, the search of nvariable Boolean functions fulfilling global cryptographic constraints is computationally hard due to the superexponential size O(2 2 n ) of the space. Here, we introduce a codification of the cryptographically relevant constraints in the ground state of an Ising Hamiltonian, allowing us to naturally encode it in a quantum annealer, which seems to provide a quantum speedup. Additionally, we benchmark small n cases in a D-Wave machine, showing its capacity of devising bent functions, the most relevant set of cryptographic Boolean functions. We have complemented it with local search and chain repair to improve the D-Wave quantum annealer performance related to the low connectivity. This work shows how to codify super-exponential cryptographic problems into quantum annealers and paves the way for reaching quantum supremacy with an adequately designed chip.Information security is of increasing concern involving in politics, military affairs, diplomacy, as well as in our daily life, where the security of communication systems plays a central role. Cryptography is important for the information security aiming at hiding the key information based on secure channels to defend against malicious parties.The symmetric cryptosystem, including stream ciphers and block ciphers, is a typical way of implementing the encryption and decryption with the same key so that the high communication efficiency and security lead to wide applications in military defense, finance, and society. The performance of core cryptographic components that offer high security as the filter model, the combiner model, and S-box relies on the availability of Boolean functions [1]. In fact, different cryptographic attacks [2, 3] require different properties such as, e.g., nonlinearity, balancedness, and correlation immunity.However, there is a tradeoff among different criteria and it remains a challenge to achieve the best tradeoff to date [4][5][6]. Resilience and high nonlinearity are two important criteria proposed versus (fast) correlation attacks and best affine approximation (BAA) attacks [7]. The properties of low-order resilient Boolean functions with high nonlinearity are important in stream ciphers. Although there exist several ways to find low-resilient and highly nonlinear Boolean functions, they may be limited by the search procedure of classical computers and the given functions with certain desired properties [8][9][10].Although the size of the 1-resilient Boolean function with high nonlinearity is exponentially smaller than 2 2 n , it is still difficult for classical computers in the sub-exponential space. It is necessary to find a new computing paradigm to explore * f.hu.the global properties of Boolean functions characterized in their exponential space.Quantum annealing [11] is an interesting alternative, and if the annealing prog...

show abstract

mentioning

confidence: 99%

“…Google, Microsoft, IBM and a host of labs and start-ups are on the verge of a quantum technology breakthrough [12][13][14]. Among them, D-Wave Systems, Inc.…”

mentioning

confidence: 99%

Quantum computing cryptography: Finding cryptographic Boolean functions with quantum annealing by a 2000 qubit D-wave quantum computer

Lamata

Sanz

et al. 2020

Physics Letters A

View full text Add to dashboard Cite

show abstract

“…The prospective of experimenting with a practical quantum computer is closing up thanks to the recent developments in hardware technology [1], [2], [3]. Driven by the revolutionary potential capabilities of quantum computing, research is extremely active both in academic and in industrial environments [4]. The race is on to develop quantum algorithms capable of proving quantum supremacy, which is the ability to solve problems that cannot be solved classically [5], [6], [7], [8].…”

Section: Introductionmentioning

confidence: 99%

Reversible Pebbling Game for Quantum Memory Management

Meuli

Soeken

Roetteler

et al. 2019

2019 Design, Automation &Amp; Test in Europe Conference &Amp; Exhibition (DATE)

View full text Add to dashboard Cite

Quantum memory management is becoming a pressing problem, especially given the recent research effort to develop new and more complex quantum algorithms. The only existing automatic method for quantum states clean-up relies on the availability of many extra resources. In this work, we propose an automatic tool for quantum memory management. We show how this problem exactly matches the reversible pebbling game. Based on that, we develop a SAT-based algorithm that returns a valid clean-up strategy, taking the limitations of the quantum hardware into account. The developed tool empowers the designer with the flexibility required to explore the trade-off between memory resources and number of operations. We present three show-cases to prove the validity of our approach. First, we apply the algorithm to straight-line programs, widely used in cryptographic applications. Second, we perform a comparison with the existing approach, showing an average improvement of 52.77%. Finally, we show the advantage of using the tool when synthesizing a quantum circuit on a constrained near-term quantum device.

show abstract

“…Microsoft Q# behaviour is similar: the code is developed on a CC and then passed to a QC for execution. 6) Our position: Based on the above, QCs are becoming more mainstream; and we are not the only one making this claim, e.g., see [23]. Thus, we position that the Software Engineering (SE) community should start thinking about bringing SE practices into the domain of QCs.…”

Section: Introductionmentioning

confidence: 99%

On Testing Quantum Programs

Miranskyy

Zhang

2019

2019 IEEE/ACM 41st International Conference on Software Engineering: New Ideas and Emerging Results (ICSE-NIER)

View full text Add to dashboard Cite

A quantum computer (QC) can solve many computational problems more efficiently than a classic one. The field of QCs is growing: companies (such as DWave, IBM, Google, and Microsoft) are building QC offerings. We position that software engineers should look into defining a set of software engineering practices that apply to QC's software. To start this process, we give examples of challenges associated with testing such software and sketch potential solutions to some of these challenges.

show abstract

Quantum computers ready to leap out of the lab in 2017

Abstract: Quantum computers ready to leap out of the labThe race is on to turn scientific curiosities into working machines.A front runner in the pursuit of quantum computing uses single ions trapped in a vacuum.

Cited by 107 publications

References 0 publications

Quantum computing cryptography: Finding cryptographic Boolean functions with quantum annealing by a 2000 qubit D-wave quantum computer

Quantum computing cryptography: Finding cryptographic Boolean functions with quantum annealing by a 2000 qubit D-wave quantum computer

Reversible Pebbling Game for Quantum Memory Management

On Testing Quantum Programs

Contact Info

Product

Resources

About