Quantum computation is an emerging technology that promises to be a powerful tool in many areas. Though some years likely still remain until significant quantum advantage is demonstrated, the development of the technology has led to a range of valuable resources. These include publicly available prototype quantum hardware, advanced simulators for small quantum programs and programming frameworks to test and develop quantum software. In this provocation paper we seek to demonstrate that these resources are sufficient to provide the first useful results in the field of procedural generation. This is done by introducing a proof-of-principle method: a quantum generalization of a blurring process, in which quantum interference is used to provide a unique effect. Through this we hope to show that further developments in the technology are not required before it becomes useful for procedural generation. Rather, fruitful experimentation with this new technology can begin now.
Quantum computation is an emerging technology that promises to be a powerful tool in many areas. Though some years likely still remain until significant quantum advantage is demonstrated, the development of the technology has led to a range of valuable resources. These include publicly available prototype quantum hardware, advanced simulators for small quantum programs and programming frameworks to test and develop quantum software. In this provocation paper we seek to demonstrate that these resources are sufficient to provide the first useful results in the field of procedural generation. This is done by introducing a proof-of-principle method: a quantum generalization of a blurring process, in which quantum interference is used to provide a unique effect. Through this we hope to show that further developments in the technology are not required before it becomes useful for procedural generation. Rather, fruitful experimentation with this new technology can begin now.
Though some years remain before quantum computation can fully outperform conventional computation, it already provides resources that can be used for exploratory purposes in various fields. This includes certain tasks for procedural generation in computer games, music and art. The so-called 'Quantum Blur' method represents the first step on this journey, providing a simple proof-of-principle example of how quantum software can be useful in these areas today. Here we analyse the 'Quantum Blur' method and compare it to conventional blur effects. This investigation was guided by discussions with the most prominent user of the method, to determine which features were found most useful. In particular we determine how these features depend on the quantum phenomena of superposition and entanglement.
Quantum computation is an emerging technology that promises a wide range of possible use cases. This promise is primarily based on algorithms that are unlikely to be viable over the coming decade. For near-term applications, quantum software needs to be carefully tailored to the hardware available. In this paper, we begin to explore whether near-term quantum computers could provide tools that are useful in the creation and implementation of computer games. The procedural generation of geopolitical maps and their associated history is considered as a motivating example. This is performed by encoding a rudimentary decision making process for the nations within a quantum procedure that is well-suited to near-term devices. Given the novelty of quantum computing within the field of procedural generation, we also provide an introduction to the basic concepts involved.
In the contemporary era of scientific and technical innovations, we are witnessing remarkable progress in the realm of quantum computing. Today’s phase is referred to as the second quantum revolution, characterized by ongoing research and progress in the hardware, software, and applications of quantum computers. While the theoretical foundations of quantum computing have been in place for decades, the practical tools and technologies that have emerged in recent years have catapulted this field from theory into reality. This paper provides a brief overview of the fundamental principles of quantum computing and explores the various technologies that support them. From quantum programming languages and simulators to quantum hardware platforms and software development kits, these tools have paved the way for groundbreaking research, experimentation, and the exploration of quantum’s boundless potential. Furthermore, it addresses the current developments, existing challenges, ongoing improvements, and future prospects in this dynamic field.
Vision paper Abstract-Quantum computers have long been more of a toy for researchers than a tool for solving complex problems. However, recent advances in the field make exploiting the advantages of fault-tolerant quantum computers feasible in the next 5 to 10 years. It is now time to begin imagining how such devices could be used in practice for game development and deployment. In this work we identify procedural content generation as a very promising area of application and exploration. We examine a selection of algorithmic approaches used in classical procedural content generation and propose promising quantum algorithms that could provide an alternative approach or a computational advantage. We then end with a hypothetical game that exploits a recent quantum algorithm for computing the Jones polynomial exponentially faster than classical computers could.
The development of second-generation quantum technologies (quantum sensors, quantum computers and quantum internet) has been carried out by large companies and has received state investments in the order of billions of dollars in several countries. Among these technologies, the quantum computer gained greater prominence in the media due to its promise to solve problems much faster and more efficiently than classical computers, which could produce numerous scientific advances with impacts on society and industry. In recent years, companies such as IBM, Google, Microsoft, among others, have made great progress in building the first prototypes of quantum hardware and software. However, these prototypes are devices that operate with few qubits and are heavily affected by noise, which still prevents them from performing truly useful computation. In particular, IBM has provided remote access to some of its machines available to the general public, as well as special access to selected researchers in its research program. Using this resource, in this work we study a method for reconstructing pure states of a multi-qubit system in a quantum computer. In the context of quantum computing, this is a very useful tool, for example, to determine input or output states of a given algorithm, or to characterize the logical operations that constitute the algorithm. The method we study is known as quantum ptychography, where a pure state is subjected to a set of projections with some degree of intersection between them, followed by a projective measurement on a single orthonormal basis. The results generated in the process serve as input to an iterative algorithm that estimates the state. Our study was divided between simulations and experiments. The simulations were carried out in ideal scenarios without noise and more realistic scenarios with noise, where the method was successfully demonstrated for a variety of states of up to 6 qubits. In experiments, we obtained good results for reconstructing states of up to 4 qubits; the results for a larger number were strongly affected by noise in the devices. The advantages and limitations of the ptychographic method are discussed in comparison with other state reconstruction methods. In addition to demonstrating quantum ptychography on a quantum computer, we also achieved some advances in the method. The first was a modification to the iterative reconstruction algorithm, which improves its convergence and, consequently, the state estimation. The second was the use of measurement bases that are less affected by noise in a quantum computer. This second advance is still part of a preliminary study but points to promising avenues for future investigations.
A Suite for Testing and Debugging Quantum Programs", addresses an underdeveloped area of research in the current scope of quantum computing: testing and debugging quantum programs.This work makes a significant contribution not only to the future of quantum software development but also more broadly to the advancement of the field of quantum computing, as software tools are critical to maturing from the current NISQ (noisy intermediate-scale quantum) era to the FTQC (fault-tolerant quantum computation) era.Quantum technology has been rapidly evolving, as seen through the significant advances in quantum computing, sensing, cryptography, and communication.Quantum technology is transitioning from experimental prototypes to more practical, yet still limited, applications.These advances offer the prospect of unprecedented computational capabilities for specific tasks like optimization, chemical simulation, and cryptography but are hindered by challenges such as error rates, qubit coherence times, and scalability.All of these problems are being addressed by physicists and engineers.One area receiving far too little attention is the emerging field of quantum software engineering.