Let's suppose that in year 2038 there will occur a serious breakthrough in the field of quantum computers- it will be possible to build a new type of quantum computer which word length is as many bits as one fixed elementary particle has actual neighbors and additionally neighbors of neighbors The developers of such a quantum computer will confirm that above-mentioned statement is valid only for a case where these elementary particles look like balls in a childrens' attraction "sea of balls. More precisely-where these elementary particles are considered to have a spherical shape, all particles have a same size and can move freely relative to each other, even though they are closely opposite each other. And finally-only these elementary particles that are in direct contact with each other quality as neighbors Task: What is the actual word length of such a quantum computer? Or in other words - how many neighbors does a single fixed elementary particle have (having three-dimensional space around us) and how many n
Let's suppose that in year 2038 there will occur a serious breakthrough in the field of quantum computers- it will be possible to build a new type of quantum computer which word length is as many bits as one fixed elementary particle has actual neighbors and additionally neighbors of neighbors The developers of such a quantum computer will confirm that above-mentioned statement is valid only for a case where these elementary particles look like balls in a childrens' attraction "sea of balls. More precisely-where these elementary particles are considered to have a spherical shape, all particles have a same size and can move freely relative to each other, even though they are closely opposite each other. And finally-only these elementary particles that are in direct contact with each other quality as neighbors
Task: What is the actual word length of such a quantum computer? Or in other words - how many neighbors does a single fixed elementary particle have (having three-dimensional space around us) and how many neighbors of neighbors does it have?
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)